Axiom schema of Markov s principle preserves disjunction and existence properties
|
|
- Victor May
- 5 years ago
- Views:
Transcription
1 Axiom schema of Markov s principle preserves disjunction and existence properties Nobu-Yuki Suzuki Shizuoka University Computability Theory and Foundations of Mathematics 2015 September 7, 2015 (Tokyo, Japan) N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 1 / 11
2 Introduction: Disjunction and Existence Properties Hallmarks of constructivity of intuitionistic logic H : Fact H has the disjunction property (DP); for every A B: H A B H A or H B H has the existence property (EP); for every xa(x): H xa(x) there exists a v such that H A(v) NB A(v) should be taken as a formula congruent to A free from collision of variables N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 2 / 11
3 Introduction: Disjunction and Existence Properties Hallmarks of constructivity of intuitionistic logic H : Fact H has the disjunction property (DP); for every A B: H A B H A or H B H has the existence property (EP); for every xa(x): H xa(x) there exists a v such that H A(v) H + A: the logic obtained from H by adding the axiom schema A There are schmemata A such that H + A enjoys both of DP and EP We are interested in such schemata (ie, H + A still enjoys DP and EP) in the setting of Intermediate Predicate Logics, particularly in those schemata related to constructive theories NB A(v) should be taken as a formula congruent to A free from collision of variables N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 2 / 11
4 Markov s Principle and Limited Principle of Omniscience In the setting of intermediate Predicate Logics, we consider: Axiom schema of Markov s principle: MP : x(a(x) A(x)) xa(x) xa(x) Axiom schema of the limited principle of omniscience: LPO : x(a(x) A(x)) xa(x) xa(x), Both principles enlarge the concept of constructivity, particularly the concept of from that of intuitionistic logic H However, still we have: Theorem H + MP and H + LPO enjoy DP and EP That is, MP and LPO preserve DP and EP N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 3 / 11
5 Harrop-DP and Harrop-EP Definition A formula is said to be a Harrop-formula (H-formula) if every strictly positive subformula is neither of the form A B nor xa(x) Theorem (Harrop) H has the H(arrop)-DP and the H(arrop)-EP, ie, for any H-formula H, H H A B H H A or H H B, H H xa(x) H H A(v) for some v Theorem H + MP and H + LPO enjoy H-DP and H-EP That is, MP and LPO preserve H-DP and H-EP N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 4 / 11
6 Pointed Join of Kripke Models Definition M 1, M 2 : Kripke frames with the least elements 0 1 and 0 2, resp, such that the domains at 0 1 and 0 2 coincide with V (= D 1 (0 1 ) = D 2 (0 2 )) A Kripke frame M is said to be the pointed join frame of M 1 and M 2, if M = {(0, V )} M 1 M 2 with a fresh least element 0 (M 1, = 1 ), (M 2, = 2 ): Kripke models with V = D 1 (0 1 ) = D 2 (0 2 ) A Kripke model (M, =) is said to be a pointed join model of (M 1, = 1 ) and (M 2, = 2 ), if M is the pointed join frame of M 1 and M 2, and the restrictions of = to M 1 and M 2 are = 1 and = 2, resp N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 5 / 11
7 Axiomatic Truth and its Preservation Definition A formula A is said to be axiomatically true in a Kripke model (M, =), if universal closures of all of substitution instances of A are true in (M, =) Lemma If A preserves its axiomatic truth in the construction of pointed join models, ie, satisfies the following: If A is axiomatically true in Kripke models (M 1, = 1 ) and (M 2, = 2 ) with V = D 1 (0 1 ) = D 2 (0 2 ), then A is still axiomatically true in any pointed join model of (M 1, = 1 ) and (M 2, = 2 ), then H + A preserves H-DP and H-EP N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 6 / 11
8 Axiomatic Truth and its Preservation Definition A formula A is said to be axiomatically true in a Kripke model (M, =), if universal closures of all of substitution instances of A are true in (M, =) Lemma If A preserves its axiomatic truth in the construction of pointed join models, ie, satisfies the following: If A is axiomatically true in Kripke models (M 1, = 1 ) and (M 2, = 2 ) with V = D 1 (0 1 ) = D 2 (0 2 ), then A is still axiomatically true in any pointed join model of (M 1, = 1 ) and (M 2, = 2 ), then H + A preserves H-DP and H-EP Theorem MP and LPO have this property Hence, MP and LPO preserve H-DP and H-EP N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 6 / 11
9 Another Phenomenon: Prawitz-Doorman EP Definition A formula is said to be a weak Harrop-formula (wh-formula) if every strictly positive subformula is not of the form xa(x) Theorem (Prawitz, Doorman) H has the Prawitz-Doorman EP, ie, for any wh-formula H, H H xa(x) there exist finitely many v 1,, v n in the vocabulary of H xa(x) such that H H A(v 1 ) A(v n ) Prawitz proved EP of H by showing DP and the Prawitz-Doorman EP N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 7 / 11
10 Another Phenomenon: Prawitz-Doorman EP Definition A formula is said to be a weak Harrop-formula (wh-formula) if every strictly positive subformula is not of the form xa(x) Theorem (Prawitz, Doorman) H has the Prawitz-Doorman EP, ie, for any wh-formula H, H H xa(x) there exist finitely many v 1,, v n in the vocabulary of H xa(x) such that H H A(v 1 ) A(v n ) Prawitz proved EP of H by showing DP and the Prawitz-Doorman EP Proposition H + MP and H + LPO fail to have the Prawitz-Doorman EP That is, MP and LPO do not preserve the Prawitz-Doorman EP N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 7 / 11
11 Concluding Remarks (1) In this talk, we considered preservation of DP and EP by two schemata MP and LPO in the setting of intermediate predicate logics H-DP,H-EP PD-EP H YES YES H + MP, H + LPO YES NO N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 8 / 11
12 Concluding Remarks (1) In this talk, we considered preservation of DP and EP by two schemata MP and LPO in the setting of intermediate predicate logics H-DP,H-EP PD-EP H YES YES H + MP, H + LPO YES NO H + WLPO, H + LLPO? YES H + CD YES NO H + WEM NO YES WLPO: x(p(x) p(x)) xp(x) xp(x), LLPO: { x(p(x) p(x)) x(q(x) q(x)) ( xp(x) xq(x)) } xp(x) xq(x), CD: x(p(x) q) xp(x) q, (x is not free in q) WEM: p p, N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 8 / 11
13 Background Story: Ono s Problem P52 Relations betwen DP and EP in Intermediate Logics Relations? In intermediate predicate logics: DP EP? EP DP? (Nakamura 1983) There exists an intermediate logic having DP but lacking EP Ie, DP EP EP DP? in intermediate logics Ono s Problem P52 (1987) (cf Umezawa(1980), Minari(1983)) N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 9 / 11
14 Background Story: Ono s Problem P52 Relations betwen DP and EP in Intermediate Logics Proposition In intermediate predicate logics, EP and DP are independent Ie, (Nakamura 1983) There exists an intermediate logic having DP but lacking EP Ie, DP EP (S ) There exists an intermediate logic having EP but lacking DP Ie, EP DP Theorem (S ) If L is closed under the rule: A (p(x) p(y)) (ZR) A where x, y and p are distinct and do not occur in A Then, EP of L implies DP of L N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 9 / 11
15 Concluding Remarks (2) Do H + WLPO and H + LLPO have H-DP and/or H-EP? H-DP DP? H-EP EP? This problem is known as Ono s problem P54 Remark: In intermediate propositional logic, we have: H-DP DP There must be waiting us other axiom schemata arising from constructive theories which are interesting from the viewpoint of intermediate logics! There must be waiting us other phenomena in intermediate logics which are interesting from the view point of constructive theories! N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 10 / 11
16 References Doorman, L M, A note on the existence property for intuitionistic logic with function symbols, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 36(1990), Gabbay, D, and de Jongh, D H, Sequences of decidable and finitely axiomatizable intermediate logics with the disjunction property, J Symbolic Logic 39(1974), Kleene, S C, Disjunction and existence under implication in elementary intuitionistic formalisms, J Symbolic Logic 27(1962), (An addendum, 28(1963), ) Komori, Y, Some results on the super-intuitionistic predicate logics, Reports on Mathematical Logic, No15(1983), Nakamura, T, Disjunction property for some intermediate predicate logics, ibid, Ono, H, Some problems in intermediate predicate logics, ibid, No21(1987), Prawitz, D, Natural deduction A proof-theoretical study, Acta Universitatis Stockholmiensis Stockholm Studies in Philosophy, No 3 Almqvist & Wiksell, Stockholm 1965 (Reprint: Dover Publications, 2006) Suzuki, N-Y, A remark on the delta operation and the Kripke sheaf semantics in super-intuitionistic predicate logics, Bulletin of Section of Logic, University of Lódź, 25(1996), Suzuki, N-Y, A negative solution to Ono s problem P52: Existence and disjunction properties in intermediate predicate Logics, to appear Troelstra, A S, Metamathematical investigation of intuitionistic arithmetic and analysis, Lecture Notes in Mathematics, Vol 344 (1973) N-Y Suzuki (Shizuoka Univ) Markov s principle preserves DP and EP CTFM 2015 (Sept 7, 2015) 11 / 11
A remark on predicate extensions of intuitionistic logic
A remark on predicate extensions of intuitionistic logic Nobu-Yuki Suzuki 1 Department of Mathematics, Faculty of Science, Shizuoka University Second Workshop on Mathematical Logic and its Applications
More informationPřednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1
Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of
More informationTABLEAUX VARIANTS OF SOME MODAL AND RELEVANT SYSTEMS
Bulletin of the Section of Logic Volume 17:3/4 (1988), pp. 92 98 reedition 2005 [original edition, pp. 92 103] P. Bystrov TBLEUX VRINTS OF SOME MODL ND RELEVNT SYSTEMS The tableaux-constructions have a
More informationConstructive analysis
Constructive analysis Philosophy, Proof and Fundamentals Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Interval
More informationON THE ATOMIC FORMULA PROPERTY OF HÄRTIG S REFUTATION CALCULUS
Takao Inoué ON THE ATOMIC FORMULA PROPERTY OF HÄRTIG S REFUTATION CALCULUS 1. Introduction It is well-known that Gentzen s sequent calculus LK enjoys the so-called subformula property: that is, a proof
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationNotes on the Foundations of Constructive Mathematics
Notes on the Foundations of Constructive Mathematics by Joan Rand Moschovakis December 27, 2004 1 Background and Motivation The constructive tendency in mathematics has deep roots. Most mathematicians
More informationcse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018
cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationFirst-Order Intuitionistic Logic with Decidable Propositional Atoms
First-Order Intuitionistic Logic with Decidable Propositional Atoms Alexander Sakharov alex@sakharov.net http://alex.sakharov.net Abstract First-order intuitionistic logic extended with the assumption
More informationConstructive (functional) analysis
Constructive (functional) analysis Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Proof and Computation, Fischbachau,
More informationA SEQUENT SYSTEM OF THE LOGIC R FOR ROSSER SENTENCES 2. Abstract
Bulletin of the Section of Logic Volume 33/1 (2004), pp. 11 21 Katsumi Sasaki 1 Shigeo Ohama A SEQUENT SYSTEM OF THE LOGIC R FOR ROSSER SENTENCES 2 Abstract To discuss Rosser sentences, Guaspari and Solovay
More informationKLEENE LOGIC AND INFERENCE
Bulletin of the Section of Logic Volume 4:1/2 (2014), pp. 4 2 Grzegorz Malinowski KLEENE LOGIC AND INFERENCE Abstract In the paper a distinguished three-valued construction by Kleene [2] is analyzed. The
More informationWeak Arithmetics and Kripke Models 1
Weak Arithmetics and Kripke Models 1 Morteza Moniri Institute for Studies in Theoretical Physics and Mathematics P.O. Box 19395-5746, Tehran, Iran email: ezmoniri@ipm.ir Abstract In the first section of
More informationBETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR
Bulletin of the Section of Logic Volume 38:3/4 (2009), pp. 123 133 Kordula Świȩtorzecka BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR Abstract In the presented text we shall focus on some specific
More informationThe faithfulness of atomic polymorphism
F Ferreira G Ferreira The faithfulness of atomic polymorphism Abstract It is known that the full intuitionistic propositional calculus can be embedded into the atomic polymorphic system F at, a calculus
More informationREPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES
Wojciech Buszkowski REPRESENTATION THEOREMS FOR IMPLICATION STRUCTURES Professor Rasiowa [HR49] considers implication algebras (A,, V ) such that is a binary operation on the universe A and V A. In particular,
More informationConstructive (functional) analysis
Constructive (functional) analysis Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Proof and Computation, Fischbachau,
More informationOn Urquhart s C Logic
On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced
More informationPositive provability logic
Positive provability logic Lev Beklemishev Steklov Mathematical Institute Russian Academy of Sciences, Moscow November 12, 2013 Strictly positive modal formulas The language of modal logic extends that
More informationConstructive reverse mathematics: an introduction
Constructive reverse mathematics: an introduction Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan CMFP 2013, Nis,
More informationMarie Duží
Marie Duží marie.duzi@vsb.cz 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: 1. a language 2. a set of axioms 3. a set of deduction rules ad 1. The definition of a language
More informationOn Jankov-de Jongh formulas
On Jankov-de Jongh formulas Nick Bezhanishvili Institute for Logic, Language and Computation University of Amsterdam http://www.phil.uu.nl/~bezhanishvili The Heyting day dedicated to Dick de Jongh and
More informationcase of I? 1 (over P A? ) was essentially treated in [11], where the authors show that 2 consequences of that theory are contained in EA, cf also [6].
Parameter free induction and reection Lev D. Beklemishev Steklov Mathematical Institute Vavilova 42, 117966 Moscow, Russia e-mail: lev@bekl.mian.su November 21, 1996 Abstract We give a precise characterization
More informationOn interpolation in existence logics
On interpolation in existence logics Matthias Baaz and Rosalie Iemhoff Technical University Vienna, Wiedner Hauptstrasse 8-10, A-1040 Vienna, Austria baaz@logicat, iemhoff@logicat, http://wwwlogicat/people/baaz,
More informationPart I: Propositional Calculus
Logic Part I: Propositional Calculus Statements Undefined Terms True, T, #t, 1 False, F, #f, 0 Statement, Proposition Statement/Proposition -- Informal Definition Statement = anything that can meaningfully
More informationSIMPLE DECISION PROCEDURE FOR S5 IN STANDARD CUT-FREE SEQUENT CALCULUS
Bulletin of the Section of Logic Volume 45/2 (2016), pp. 125 140 http://dx.doi.org/10.18778/0138-0680.45.2.05 Andrzej Indrzejczak SIMPLE DECISION PROCEDURE FOR S5 IN STANDARD CUT-FREE SEQUENT CALCULUS
More informationFrom pre-models to models
From pre-models to models normalization by Heyting algebras Olivier HERMANT 18 Mars 2008 Deduction System : natural deduction (NJ) first-order logic: function and predicate symbols, logical connectors:,,,,
More informationPredicate Logic - Deductive Systems
CS402, Spring 2018 G for Predicate Logic Let s remind ourselves of semantic tableaux. Consider xp(x) xq(x) x(p(x) q(x)). ( xp(x) xq(x) x(p(x) q(x))) xp(x) xq(x), x(p(x) q(x)) xp(x), x(p(x) q(x)) xq(x),
More informationLogic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.4 Prenex normal form. Skolemization. Clausal form.
Logic as a Tool Chapter 4: Deductive Reasoning in First-Order Logic 4.4 Prenex normal form. Skolemization. Clausal form. Valentin Stockholm University October 2016 Revision: CNF and DNF of propositional
More informationReferences A CONSTRUCTIVE INTRODUCTION TO FIRST ORDER LOGIC. The Starting Point. Goals of foundational programmes for logic:
A CONSTRUCTIVE INTRODUCTION TO FIRST ORDER LOGIC Goals of foundational programmes for logic: Supply an operational semantic basis for extant logic calculi (ex post) Rational reconstruction of the practice
More informationUniversity of Oxford, Michaelis November 16, Categorical Semantics and Topos Theory Homotopy type theor
Categorical Semantics and Topos Theory Homotopy type theory Seminar University of Oxford, Michaelis 2011 November 16, 2011 References Johnstone, P.T.: Sketches of an Elephant. A Topos-Theory Compendium.
More informationModal systems based on many-valued logics
Modal systems based on many-valued logics F. Bou IIIA - CSIC Campus UAB s/n 08193, Bellaterra, Spain fbou@iiia.csic.es F. Esteva IIIA - CSIC Campus UAB s/n 08193, Bellaterra, Spain esteva@iiia.csic.es
More informationInquisitive Logic. Ivano Ciardelli.
Inquisitive Logic Ivano Ciardelli www.illc.uva.nl/inquisitive-semantics Information states A state is a set of valuations. Support Let s be a state. The system InqB 1. s = p iff w s : w(p) = 1 2. s = iff
More informationSeparating Variants of LEM, LPO, and MP
Matt Hendtlass, U Canterbury Robert S. Lubarsky, FAU Proof Theory, Modal Logic and Reflection Principles Mexico City, Mexico September 29 - October 2, 2014 Implications Definition The Law of Excluded Middle
More informationMotivation. CS389L: Automated Logical Reasoning. Lecture 10: Overview of First-Order Theories. Signature and Axioms of First-Order Theory
Motivation CS389L: Automated Logical Reasoning Lecture 10: Overview of First-Order Theories Işıl Dillig Last few lectures: Full first-order logic In FOL, functions/predicates are uninterpreted (i.e., structure
More informationSome Non-Classical Approaches to the Brandenburger-Keisler Paradox
Some Non-Classical Approaches to the Brandenburger-Keisler Paradox Can BAŞKENT The Graduate Center of the City University of New York cbaskent@gc.cuny.edu www.canbaskent.net KGB Seminar The Graduate Center
More informationBruno DINIS and Gilda FERREIRA INSTANTIATION OVERFLOW
RPORTS ON MATHMATICAL LOGIC 51 (2016), 15 33 doi:104467/20842589rm160025279 Bruno DINIS and Gilda FRRIRA INSTANTIATION OVRFLOW A b s t r a c t The well-known embedding of full intuitionistic propositional
More informationFuzzy Logic in Narrow Sense with Hedges
Fuzzy Logic in Narrow Sense with Hedges ABSTRACT Van-Hung Le Faculty of Information Technology Hanoi University of Mining and Geology, Vietnam levanhung@humg.edu.vn arxiv:1608.08033v1 [cs.ai] 29 Aug 2016
More informationCombining Propositional Dynamic Logic with Formal Concept Analysis
Proc. CS&P '06 Combining Propositional Dynamic Logic with Formal Concept Analysis (extended abstract) N.V. Shilov, N.O. Garanina, and I.S. Anureev A.P. Ershov Institute of Informatics Systems, Lavren ev
More informationMathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy
Reasoning in First Order Logic FBK-IRST, Trento, Italy April 12, 2013 Reasoning tasks in FOL Model checking Question: Is φ true in the interpretation I with the assignment a? Answer: Yes if I = φ[a]. No
More informationLogic: The Big Picture
Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving
More informationWhat are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos
What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It
More informationTowards Intuitionistic Dynamic Logic
Towards Intuitionistic Dynamic Logic J. W. Degen and J. M. Werner October 25, 2006 Outline Definitions Separation of PDL and ipdl Separation of Necessitas and Possibilitas Induction principles Definability
More informationComputational Logic Lecture 3. Logical Entailment. Michael Genesereth Autumn Logical Reasoning
Computational Logic Lecture 3 Logical Entailment Michael Genesereth Autumn 2010 Logical Reasoning Logical Reasoning relates premises and conclusion does not say whether conclusion is true in general says
More informationModels and Interpretations of (Intuitionistic) Analysis
Models and Interpretations of (Intuitionistic) Analysis Joan Rand Moschovakis Occidental College (Emerita), MPLA VIG at UCLA February 4-6, 2011 What is intuitionistic analysis and why should we care? Historically,
More informationOmitting Types in Fuzzy Predicate Logics
University of Ostrava Institute for Research and Applications of Fuzzy Modeling Omitting Types in Fuzzy Predicate Logics Vilém Novák and Petra Murinová Research report No. 126 2008 Submitted/to appear:
More informationComputational Logic. Recall of First-Order Logic. Damiano Zanardini
Computational Logic Recall of First-Order Logic Damiano Zanardini UPM European Master in Computational Logic (EMCL) School of Computer Science Technical University of Madrid damiano@fi.upm.es Academic
More informationKRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
More informationThe logic of Σ formulas
The logic of Σ formulas Andre Kornell UC Davis BLAST August 10, 2018 Andre Kornell (UC Davis) The logic of Σ formulas BLAST August 10, 2018 1 / 22 the Vienna Circle The meaning of a proposition is the
More informationTR : Binding Modalities
City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2012 TR-2012011: Binding Modalities Sergei N. Artemov Tatiana Yavorskaya (Sidon) Follow this and
More informationPredicate Calculus - Syntax
Predicate Calculus - Syntax Lila Kari University of Waterloo Predicate Calculus - Syntax CS245, Logic and Computation 1 / 26 The language L pred of Predicate Calculus - Syntax L pred, the formal language
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Reasoning Modal Logics Bernhard Nebel, Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg May 2 & 6, 2008 Nebel, Helmert, Wölfl (Uni Freiburg)
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More information260 Index. Cut (cont.) rank, 193, 202 segment, 201 Cut-off subtraction, 211
References J. Barwise (ed.). Handbook of Mathematical Logic. North-Holland, Amsterdam, 1977 G. Boolos. The Logic of Provability. Cambridge University Press, Cambridge, 1993 E. Börger. Computability, Complexity,
More informationPart II Logic and Set Theory
Part II Logic and Set Theory Theorems Based on lectures by I. B. Leader Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationPredicate Logic: Sematics Part 1
Predicate Logic: Sematics Part 1 CS402, Spring 2018 Shin Yoo Predicate Calculus Propositional logic is also called sentential logic, i.e. a logical system that deals with whole sentences connected with
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More informationThe Syntax of First-Order Logic. Marc Hoyois
The Syntax of First-Order Logic Marc Hoyois Table of Contents Introduction 3 I First-Order Theories 5 1 Formal systems............................................. 5 2 First-order languages and theories..................................
More informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
More informationarxiv: v1 [math.lo] 8 Mar 2018
An interpolant in predicate Gödel logic arxiv:1803.03003v1 [math.lo] 8 Mar 2018 Matthias Baaz 1 baaz@logic.at, Mai Gehrke 2 mgehrke@unice.fr, Sam van Gool 3 samvangool@me.com 1 Institute of Discrete Mathematics
More informationElimination of binary choice sequences
Elimination of binary choice sequences Tatsuji Kawai Japan Advanced Institute of Science and Technology JSPS Core-to-Core Program Workshop on Mathematical Logic and its Application 16 17 September 2016,
More information2-4: The Use of Quantifiers
2-4: The Use of Quantifiers The number x + 2 is an even integer is not a statement. When x is replaced by 1, 3 or 5 the resulting statement is false. However, when x is replaced by 2, 4 or 6 the resulting
More informationAAA615: Formal Methods. Lecture 2 First-Order Logic
AAA615: Formal Methods Lecture 2 First-Order Logic Hakjoo Oh 2017 Fall Hakjoo Oh AAA615 2017 Fall, Lecture 2 September 24, 2017 1 / 29 First-Order Logic An extension of propositional logic with predicates,
More informationTHE SEMANTICS OF MINIMA L INTUITIONISM G.N. GEORGACARAKOS. Introduction
THE SEMANTICS OF MINIMA L INTUITIONISM G.N. GEORGACARAKOS Introduction There has existed some controversy in the history o f intuitionism concerning the tenth axiom o f Heyting's famous formalization o
More informationRELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED LOGIC
Bulletin of the Section of Logic Volume 10/4 (1981), pp. 185 190 reedition 2009 [original edition, pp. 185 191] Newton C. A. da Costa Elias H. Alves RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED
More informationExplicit Composition and Its Application in Proofs of Normalization
Explicit osition and Its Application in Proofs of Normalization Jan von Plato Abstract The class of derivations in a system of logic has an inductive definition One would thus expect that crucial properties
More informationPropositional and Predicate Logic - XIII
Propositional and Predicate Logic - XIII Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - XIII WS 2016/2017 1 / 22 Undecidability Introduction Recursive
More informationLogic Part II: Intuitionistic Logic and Natural Deduction
Yesterday Remember yesterday? classical logic: reasoning about truth of formulas propositional logic: atomic sentences, composed by connectives validity and satisability can be decided by truth tables
More informationMathematical Logics. 12. Soundness and Completeness of tableaux reasoning in first order logic. Luciano Serafini
12. Soundness and Completeness of tableaux reasoning in first order logic Fondazione Bruno Kessler, Trento, Italy November 14, 2013 Example of tableaux Example Consider the following formulas: (a) xyz(p(x,
More informationOn the Logic and Computation of Partial Equilibrium Models
On the Logic and Computation of Partial Equilibrium Models Pedro Cabalar 1, Sergei Odintsov 2, David Pearce 3 and Agustín Valverde 4 1 Corunna University (Corunna, Spain), cabalar@dc.fi.udc.es 2 Sobolev
More informationMARKOV S PRINCIPLE AND SUBSYSTEMS OF INTUITIONISTIC ANALYSIS
MARKOV S PRINCIPLE AND SUBSYSTEMS OF INTUITIONISTIC ANALYSIS J. R. MOSCHOVAKIS Abstract. Using a technique developed by Coquand and Hofmann [3] we verify that adding the analytical form MP 1: α( xα(x)
More informationSyntax and Semantics. The integer arithmetic (IA) is the first order theory of integer numbers. The alphabet of the integer arithmetic consists of:
Integer Arithmetic Syntax and Semantics The integer arithmetic (IA) is the first order theory of integer numbers. The alphabet of the integer arithmetic consists of: function symbols +,,s (s is the successor
More informationA note on fuzzy predicate logic. Petr H jek 1. Academy of Sciences of the Czech Republic
A note on fuzzy predicate logic Petr H jek 1 Institute of Computer Science, Academy of Sciences of the Czech Republic Pod vod renskou v 2, 182 07 Prague. Abstract. Recent development of mathematical fuzzy
More informationMONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC
Bulletin of the Section of Logic Volume 45:3/4 (2016), pp. 143 153 http://dx.doi.org/10.18778/0138-0680.45.3.4.01 Anna Glenszczyk MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC Abstract We investigate
More informationTRUTH TELLERS. Volker Halbach. Scandinavian Logic Symposium. Tampere
TRUTH TELLERS Volker Halbach Scandinavian Logic Symposium Tampere 25th August 2014 I m wrote two papers with Albert Visser on this and related topics: Self-Reference in Arithmetic, http://www.phil.uu.nl/preprints/lgps/number/316
More informationBetween proof theory and model theory Three traditions in logic: Syntactic (formal deduction)
Overview Between proof theory and model theory Three traditions in logic: Syntactic (formal deduction) Jeremy Avigad Department of Philosophy Carnegie Mellon University avigad@cmu.edu http://andrew.cmu.edu/
More informationThe Mother of All Paradoxes
The Mother of All Paradoxes Volker Halbach Truth and Intensionality Amsterdam 3rd December 2016 A theory of expressions The symbols of L are: 1. infinitely many variable symbols v 0, v 1, v 2, v 3,...
More informationThe Independence of Peano's Fourth Axiom from. Martin-Lof's Type Theory without Universes. Jan M. Smith. Department of Computer Science
The Independence of Peano's Fourth Axiom from Martin-Lof's Type Theory without Universes Jan M. Smith Department of Computer Science University of Goteborg/Chalmers S-412 96 Goteborg Sweden March 1987
More information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationOn 3-valued paraconsistent Logic Programming
Marcelo E. Coniglio Kleidson E. Oliveira Institute of Philosophy and Human Sciences and Centre For Logic, Epistemology and the History of Science, UNICAMP, Brazil Support: FAPESP Syntax Meets Semantics
More informationIntroduction to Logic
Introduction to Logic 1 What is Logic? The word logic comes from the Greek logos, which can be translated as reason. Logic as a discipline is about studying the fundamental principles of how to reason
More informationOn Sequent Calculi for Intuitionistic Propositional Logic
On Sequent Calculi for Intuitionistic Propositional Logic Vítězslav Švejdar Jan 29, 2005 The original publication is available at CMUC. Abstract The well-known Dyckoff s 1992 calculus/procedure for intuitionistic
More informationEquivalents of Mingle and Positive Paradox
Eric Schechter Equivalents of Mingle and Positive Paradox Abstract. Relevant logic is a proper subset of classical logic. It does not include among itstheoremsanyof positive paradox A (B A) mingle A (A
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationInfinitary Equilibrium Logic and Strong Equivalence
Infinitary Equilibrium Logic and Strong Equivalence Amelia Harrison 1 Vladimir Lifschitz 1 David Pearce 2 Agustín Valverde 3 1 University of Texas, Austin, Texas, USA 2 Universidad Politécnica de Madrid,
More informationThe Modal Logic of Pure Provability
The Modal Logic of Pure Provability Samuel R. Buss Department of Mathematics University of California, San Diego July 11, 2002 Abstract We introduce a propositional modal logic PP of pure provability in
More informationPropositional Calculus - Deductive Systems
Propositional Calculus - Deductive Systems Moonzoo Kim CS Division of EECS Dept. KAIST moonzoo@cs.kaist.ac.kr http://pswlab.kaist.ac.kr/courses/cs402-07 1 Deductive proofs (1/3) Suppose we want to know
More informationCogito ergo sum non machina!
Cogito ergo sum non machina! About Gödel s First Incompleteness Theorem and Turing machines. Ricardo Pereira Tassinari 1 Philosophy Department of State University of São Paulo - UNESP - Campus Marília
More informationModal and temporal logic
Modal and temporal logic N. Bezhanishvili I. Hodkinson C. Kupke Imperial College London 1 / 83 Overview Part II 1 Soundness and completeness. Canonical models. 3 lectures. 2 Finite model property. Filtrations.
More informationPiotr Kulicki The Use of Axiomatic Rejection
Piotr Kulicki The Use of Axiomatic Rejection 1. Introduction The central point of logic is an entailment relation, which in different contexts is expressed as an implication in a system, syntactic derivability
More informationTopos Theory. Lectures 17-20: The interpretation of logic in categories. Olivia Caramello. Topos Theory. Olivia Caramello.
logic s Lectures 17-20: logic in 2 / 40 logic s Interpreting first-order logic in In Logic, first-order s are a wide class of formal s used for talking about structures of any kind (where the restriction
More informationSystematic Construction of Natural Deduction Systems for Many-valued Logics: Extended Report
Systematic Construction of Natural Deduction Systems for Many-valued Logics: Extended Report Matthias Baaz Christian G. Fermüller Richard Zach May 1, 1993 Technical Report TUW E185.2 BFZ.1 93 long version
More informationModal Logic XX. Yanjing Wang
Modal Logic XX Yanjing Wang Department of Philosophy, Peking University May 6th, 2016 Advanced Modal Logic (2016 Spring) 1 Completeness A traditional view of Logic A logic Λ is a collection of formulas
More informationRasiowa-Sikorski proof system for the non-fregean sentential logic SCI
Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI Joanna Golińska-Pilarek National Institute of Telecommunications, Warsaw, J.Golinska-Pilarek@itl.waw.pl We will present complete and
More informationON THE LOGIC OF DISTRIBUTIVE LATTICES
Bulletin of the Section of Logic Volume 18/2 (1989), pp. 79 85 reedition 2006 [original edition, pp. 79 86] Josep M. Font and Ventura Verdú ON THE LOGIC OF DISTRIBUTIVE LATTICES This note is a summary
More informationAN AXIOMATIZATION OF HERZBERGER'S 2-DIMENSIONAL PRESUPPOSITIONAL SEMANTICS JOHN N. MARTIN
378 Notre Dame Journal of Formal Logic Volume XVIII, Number 3, July 3 977 NDJFAM AN AXIOMATIZATION OF HERZBERGER'S 2-DIMENSIONAL PRESUPPOSITIONAL SEMANTICS JOHN N. MARTIN The purpose of this paper* is
More information