THE SEMANTICS OF MINIMA L INTUITIONISM G.N. GEORGACARAKOS. Introduction

Size: px
Start display at page:

Download "THE SEMANTICS OF MINIMA L INTUITIONISM G.N. GEORGACARAKOS. Introduction"

Transcription

1 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 f intuitionistic logic. Fo r example, some logicians have suggested that this axiom does not have any intuitive foundation (cf. [51 and [6], p. 421). Even Heyting admitted that the axiom was perhaps not intuitively clear and, as a consequence, believed that counting it among the axioms o f intuitionistic logic required some kind o f justification (cf. 141, p. 102). Heyting's attempted justification f o r keeping it involved claiming that it added to the 'precision o f the definition of implication' (again cf. [4], p. 102). However, it has been argued more recently b y Susan Haack that its inclusion really amounts to an extension of the intuitionist's sense of 'construction' to a point where it no longer seems characteristically intuitionistic. In view of this consideration, she concludes rather emphatically that the system resulting from dropping the tenth axiom represents the set of intuitionistic logical truths better than the original Heyting axiomatization (12], p. 102). Whatever the merits of this claim, it shall not be discussed here. We mention it only because it suggests an examination of the system is perhaps worthwile, especially f ro m a semantical point o f vie w. Consequently, the purpose of this paper will be to provide a semantical interpretation of the resulting system. This system is well-known and has come to be called Johansson's 'minimal calculus' (cf. [5]). It has been studied proof-theorretically by Prawitz[9] and algebraically by Rasiowa and Sikorski [ 10]. Actually, a modeling for the system has been provided by Fitting [ I ]

2 384 G. N. GEORGACARAKOS propose differs in many important respects from his we consider it of some interest to present it here. In formulating 'possible world' semantics for intuitionistic logic, Kripke makes use of semantic tableaux for proving the completeness theorem 17l. The virtue of that approach is that it is more in keeping with the spirit of intuitionistic constructivism. Nevertheless, in proving the completeness theorem for the minimal calculus, we shall employ techniques adapted from HenkinI31, and, accordingly, shall proceed without any intuitionistic scruples. The reason for adopting this approach is that we consider it intrinsically interesting to direct attention to the two kinds of saturated sets of statement-forms in the minimal calculus. In any event, since the interpretation we shall offer involves a rather straight-forward modification of Kripke's semantics for intuitionistic logic, recovering a completeness theorem based on semantic tableaux would be easily obtainable with only a minimum of corresponding changes. It should also be mentioned that we shall only concern ourselves with statement logic : an extension of the modeling to the first-order predicate calculus could be accomplished by following after the manner of either [71 or 111 Section I : Syntax The symbolic language for Johansson's minimal calculus (JMC) is a triple < P,C,F> where P is a denumerably infinite set of statement variables, C is the set whose members are the unary connective binary connectives A, V, -> and the punctuation symbols (,), and F is the set o f statement-forms built up as usual from the statement variables in P and the connectives and punctuation symbols in C. The axiom schemata of JMC are the following: Al. A ) (A A A) A2. ( A A B ) A3. ( A A4. ((A ) B) A (13 > C)) ) (A ) C) A5. B > (A ) B) A6. (A A (A A7. A ) (A v B)

3 THE SEMANTICS OF MINIMAL INTUITIONISM A8. (A V B)-> (B VA) A9. ((A -) C) A (B-> C))-) ((A V B)-> C) A10. ((A->B) A (A-> TB))-> T A We note that the axiom-schemata for JMC are the same as for the intuitionistic logic of Heyting except of course for the conspicuous absence of T A - ) (A -) B). The only definition and rule of inference of JMC is given by: Dl. A B =d f (A- B) A (13-) A) From A-* B and A infer B. The notion o f a deduction o f a statement form A from a set o f statement-forms S is defined as in 181. Accordingly, we will write 'S H A' to indicate that there exists a deduction of A from S, and 'H A' as an abbreviation fo r 'OH A'. We now list, without proof, some metatheorems of JMC for future reference (they are easily proved in the usual sorts of ways): MT1. I f A ES, then Si-A. MT2. I f S H A, then S US' HA. MT3. HA -4 (B VA) MT4. I f S U IA1 HB, then S HA -) B. MT5. I f SH A and S HA-+ B, then S i - MT6. S U1A1- HB and S 111A1 HTB, then S i-t A. Mr7. I f S H A and S H 13, then SHA AB. MT8. I f SHA AB, then S H A and S i - Because o f the absence in JMC o f Heyting's tenth axiom, it is possible to distinguish between two kinds o f deductive consistency. Let's define a set o f S o f statement-forms o f JMC to be negation consistent just in case for some statement-form A of JMC, not both S H A and S H A. Correspondingly, a set S o f statement-forms o f JMC is said t o be absolutely consistent ju st in case f o r some statement-form A, not S A. Of course, the distinction between these two kinds of deductive consistency breaks down in Heyting's intuitionistic logic and in the classical logic, but not so in the minimal calculus.

4 386 G. N. GEORGACARAKOS Section 2 : Semantics Except for two modifications, JMC-models are essentially the same as intuitionistic models. The first modification involves distinguishing between two kinds of possible worlds. In intuitionistic models, there is only one kind of possible world, however, JMC-models have what we shall call 'negation coherent' and 'absolutely coherent' possible worlds. Negation coherent worlds are worlds which are negation consistent ; absolutely coherent worlds, however, may or may not be negation consistent. Nevertheless, we require that the latter worlds be characterized by the stipulation that there exists at least one statement-form in them which receive the valuation 'false.' Furthermore, we require that every JMC-model has either one or both of these kinds of possible worlds. The second modification has t o do with the valuation of statement-forms of the form true in a given world provided that A is false in all accessible negation coherent worlds. More formally, we define a JMC-model as a triple < W,R,V where W is a set of possible worlds, R is a reflexive and transitive relation defined on W and V is a value assignment satisfying the following conditions : SC1. Fo r any A e P and for any w e W, if both V (A,w w,rw SC2. Fo r any A EF o f the f o rm B AC and f o r any w V (A,w V (A,w SC3. Fo r a n y A cf o f the f o rm B VC and f o r any w EW, V (A,w V (A,w SC4_ Fo r any A EF o f the fo rm B > C and f o r any w V (A,w V (13,w SC5. Fo r any A e F of the form a n d for any w i f fo r every negation coherent w V (B,w,) F ; otherwise V (A,w

5 THE SEMANTICS OF MINIMAL INTUITIONISM We say that any w e W is negation coherent if and only if for no A cf is it the case that both V (A,w w e W is said to be absolutely coherent nust in case there is at least one A cf such that V (A,w JMC-logically true if and only if for every JMC-model <W,R,V > and for every w Given o u r definitions o f the two kinds o f possible worlds in JMC-models, it is obvious that every negation coherent world is also an absolutely coherent world ; but of course the converse doesn't hold. Accordingly, JMC-models allow for the possibility that there are states of affairs which are classically and intuitionistically inconsistent (in the sense of allowing A and T A to be present) but without the consequent disaster of allowing everything to be derivable. Resorting to metaphor, we might say that, unlike classical and intuitionistic models. JMC-models permit the existence of states of affairs which are negation inconsistent, but which are, nevertheless, devoid of total chaos and absolute absurdity. It is an easy matter to prove the soundness theorem for JMC and so we leave it to the reader to verify that all of the axiom-schemata of JMC are JMC-logically true and that the rule of detachment is truth preserving. As we should expect JMC-logically true since it isn't true in all JMC-models. Th is is patently evident once we consider the following JMC-model : le t W = w 2, w absolutely coherent. Furthermore, let w let V (A,w V (TA,W case that there exists some statement-form, sa y B, such that V (B,w V (A-) B,w V ( JMC-logically true. Section 3: Intuitive Interpretation Borrowing from Kripke in [7], pp. 97 ff. we shall say that, in general, in a JMC-model < W,R,V>, we interpret W as the set o f

6 388 G, N. GEORGACARAKOS 'evidential situations.' Where w w enough information to advance to w that at a particular time w thus, we might alternatively understand V (A,w has been verified at the point w means that A has not been verified at w do n o t denote intuitionistic tru th a n d fa lsity since although V (A,w latter only means that A has not, as yet, been verified at w might be later. Intuitionistically speaking, an evidential situation w V (A,w would entail that any statement whatsoever has been verified to be true at w intuitionism such an evidential situation, although negation inconsistent, would not necessarily entail that any statement whatsoever is verified to be true at w absolutely coherent evidential situation, in which case, there would be at least one statement at w true. I n intuitionistic logic, t o assert knowing not only that A has not been verified at w possibly be verified at any later time, no matter how much more information is gained ; thus in intuitionistic logic, V (7 A,w for every w negation inconsistent evidential situation, intuitionistically speaking, is disastrous since such a situation commits us to the absurd view that a given statement has been verified to be true at that situation and not verified to be true at that situation and any other situation which will eventually come at a later time. However, in JMC-models, since for any w for every negation coherent w assert there and cannot possibly be verified at any later negation coherent situation, no matter how much more information is gained. Thus, an evidential situation w (i.e., a situation which is negation inconsistent, but, nonetheless, absolutely coherent) simply entails that A has been verified to be true

7 THE SEMANTICS OF MINIMAL INTUITIONISM at w then, the absurdity mentioned above in the case o f intuitionistic models, doesn't arise in the case of JMC-models. Section 4: Completeness Given that there are two kinds o f deductively consistent sets of statement-forms in JMC, it is possible to define two corresponding kinds of saturated sets in J MC. Let's d e of JMC t o be negation-saturated just in case (i) F is negation consistent ; and (ii) if r H A, then A e l of statement-forms of JMC to be absolutely-saturated just in case (i) is absolutely consistent ; and (ii) if I' HA, then A Er. We now direct our attention to the proof of certain lemmata which will eventually be used in the proof of the completeness theorem. L I F o r every negation consistent set S of statement-forms of J MC there exists some negation-saturated set F o f statement-forms such that S F. Define the sets F (a) Fo = S (b) Enumerate the statement-forms o f JMC. Fo r each i 0, i f F otherwise 1 (c) F = Obviously there exists a set F such that S c r. What we must now show is that conditions (i) and (ii) o f a negation-saturated set hold for F. It is easily demonstrated by induction on i that if S is negation consistent in JMC then so is each F negation consistent since S is. Assume that F but that F

8 390 G. N. GEORGACARAKOS = F tent after all. Therefore, F We now show that i f I' H A, then A el'. Suppose that Furthermore, suppose for the sake of reductio that A F. In view of the way F was constructed, F 1 AI must be negation inconsistent ; i.e., for any statement-form B, both r!jim HB and F LI { Consequently (by MT6), f H TA. But now we have both r I- A and F established above. Therefore, A Er. L2. Fo r every absolutely consistent S o f statement forms o f JMC there exists some absolutely-saturated set I' of statement-forms such that S Define the sets fo, F replace 'negation consistent' by 'absolutely consistent.' Obviously there exists a set F such that S F. is absolutely consistent by way o f the same argument given in the proof of Ll Now we show that if I' HA, then A cr. Suppose that F suppose for the sake of reductio that A F. In view of the way I' was constructed, F 1.31A1 must be absolutely inconsistent ; i.e., for any statement-form B, F LI 1A1 H B. Consequently (b y MT4), B and so (by MT5) for any statement-form B, F H B. But in that case F is absolutely inconsistent contrary t o wh a t wa s established above. Therefore, A Er. The following lemma identifies the distinctive feature of absolutelysaturated sets: L3. Fo r any absolutely-saturated set F o f statement-forms o f JMC there is some statement-form A of JMC such that A F. Suppose that l is any absolutely-saturated set of statement-forms of JMC. Since it is absolutely consistent it must be the case that for some

9 THE SEMANTICS OF MINIMAL INTUITIONISM statement-form A ofjmc not I" H A. But in that case we may conclude that for some statement-form A of JMC, A F (by MT1). In most of the remaining lemmata, when we speak of a 'saturated set' we are speaking o f any and every saturated set whether it is negation-saturated or absolutely-saturated. L4. L e t A be any statement-form of JMC and IF any saturated set of statement-forms of JMC. Then H A if and only if A c By condition (ii) of either definition of a saturated set and MTI. L5. Let A be any statement-form of JMC and I" any saturated set of statement-forms o f J MC. Then 1' U {A} is consistent (in the appropriate sense) if and only if A c r. Suppose I' U { the way r was constructed A would have been added to r and so A c f Now suppose A c f. Furthermore, suppose F A I is inconsistent (in either sense). In that case, in view of the way F was constructed, it must be the case that A 0" which is contrary to the first supposition. Therefore, F U fal is consistent (in the appropriate sense). L6. Let A be any statement-form of JMC and IF any saturated set of statement-forms of JMC. Then if A F, then there exists some saturated set I" ' such that 1' çl"' and A ( r. Suppose A F. Then clearly (by L5) F (JI M is inconsistent. Now L i and L2 guarantee that there exists some saturated set F' such that But in that case F' U fal is also inconsistent. Consequently (by L5), A OF'. L7. Fo r any statement-form A of JMC and every saturated set F. if HA, then A cr.

10 392 G. N. GEORGACARAKOS Suppose H A. Also suppose for the sake of reductio A (p F. Now H A is the same as OH- A. Hence (b y MT2 ) U r HA and so, since UF = F, 1 A. But (by hypothesis) A F, thus (by L4) not I' HA and so we have a contradiction. Therefore, A c f. L8. Fo r any statement-forms A and B of JMC and for every saturated set F, if A VB Er', then either A c f or B (a) Suppose that I" is negation-saturated and that A V B e l. Furthermore, suppose fo r the sake o f reductio that neither A e l B E r; i.e., A a and B a. Then (by L5) I" U tal and U t B 1 are both negation inconsistent ; in other words: F U I AI HC and I' U1A11-7C: and U113)-HC and I' U{BH TC. Clearly (by MT4), we have in each case: HA-0C and H A ) F i - Hence (by MT7) we have: H (A ) C) A (B > C) H (A > C) A (13 ) Now since both ((A ) C) A (B * C)) ( ( A V B) > C) and ((A > TC) A (B )C)) > ((A V B) > C) are axioms of JMC, it follows (by L7) that they are both in F. Hence (by MT1): H ((A ) C) A (B C)) > ((A v B) > C) ((A > Consequently (by MT5): I' 1 T

11 THE SEMANTICS OF MINIMAL INTUITIONISM But A V B EU (by hypothesis), hence (by MTI ): FHA VB. Thus (again by MT5): HC and H Consequently, F is negation inconsistent contrary to supposition. Therefore, either A E r or B EU. (b) No w suppose I' is absolutely-saturated and A V B El for the sake of reductio, assume A el' and B Er. Then (by L5) both UfAl and I' U1131 are absolutely inconsistent; i.e., for any satement-form C, F UtAl-HC Hence (by MT4 and MT7) F F- (A->C) A (B -) C). But because ( is an axiom of JMC, we have (by L7 and MTI ): H ((A-> C) A (B-4 C)) ( ( A v B)-> C) and so (by MT5): H (A v B)-> C. but A V B El' (by hypothesis). Hence (by MT1): F HA VB Consequently (by MT5) it follows that for any statement-form C. F- C. Clearly, F is absolutely inconsistent contrary to the hypothesis of the proof. Therefore, either A Er' or B On either supposition, then, we have A e l

12 394 G. N. GEORGACARAKOS lemma is proved. L9. Fo r any statement-forms A and B of JMC and every saturated set F, if A V B a, then A a and B F. Suppose A V B F. Furthermore, suppose, for the sake of reductio, that not both A a and B ; i.e., either A E r or B c f. If A el', then r H A (by MTI). But A > (A v B) is an axiom of JMC, hence (by L7 and MT2 ) A (A V B) and so (by MT5 ) f HA v B. But (b y hypothesis and L4) not I' H A v B. Obviously we have a contradiction and so A a and B 4 yields the same conclusion. Either way, then, we have A 0 and so the lemma is proved. L b. Fo r any statement-form A ofjmc and for every saturated set I', if T A Er, then for every negation-saturated set r such that Ici', A Suppose T A Er and that r g r where I ' is negation-saturated. Obviously, T A a n d so (by MTI) H A. Now suppose for the sake o f recluctio A c r. Then (again by MT I ) A. Thus r is negation inconsistent contrary to the hypothesis. Therefore A IF". LI I. Fo r any statement form A and every saturated set F, if T A then there exists some negation-saturated set r' such that F and A e r. Suppose T A U. Then (by 16) there exists some saturated set r' such that. f _ r and T A H e n c e (by L4) not r H A. Clearly, then, (by MT6) not both r A I HB and r u { quently. r t A l is negation consistent. But in that case (by L5) A e r and r is negation-saturated. Let us now employ the set I' as the set of all negation-saturated and

13 THE SEMANTICS OF MINIMAL INTUITIONISM absolutely-saturated sets of JMC with set-theoretic inclusion defined on it. We can now easily form a JMC-model < W,R,V> on the basis of F. With each F rated associate a negation coherent world, where F, is absolutely-saturated associate a absolutely coherent world). I n other words, le t W = F. Let R be the relation such that w V be the following value assignment: for any statement-variable A and every w, E W, V (A,w,) = T if A r Clearly, < W,R,V> thus defined is a JMC-model. We are now prepared to state and prove the completeness theorem. (Completeness) Let W. R and V be defined as above. Then for every statement-form A of JMC and for every w, EW,V (A,w,) = T if A c r Case I: A is a statement-variable. Obviously the theorem holds for A by the initial value assignment to statement variables. Case 2: A is B A case F, B and F, HC (by MT8). Consequently (by L4), B el', and C e r V (B,w,) = T a n d V (C,w,) = T. Therefore ( b y SC2 ), V (A,w,) = T. (b) Let A 0",. In that case not F, H A (by L4). Hence (by M T7) either not F. B or not F, H C. If not F, B, then B 0', (by MTI). Consequently V (B,w,) = F (by inductive assumption) and so V (A,w,) = F (by SC2). If not I', C, then C f hypothesis) and so V (A,w,) = F (by SC2). Case 3: A is B v C. (a) Let A EF,. Then either B El', or C El', (by L8). But in that case, either V (B,w,) = T or V (C,w,) = T (by the hypothesis of induction). Therefore, V (A,w,) = T (by SC3). (b) Let A f induction hypothesis) both V (B,w,) = F and V (C,w,) = F. Therefore (by SC3), V (A,w,) = F. Case 4 : A is B--* C. (a) Let A c r F, g r

14 396 G. N. GEORGACARAKOS MT5) r Put differently, either B if o r C c r hypothesis o f in d u ctio n ) e i t h e r V (B,w (C,w A (tr r L6) there exists some saturated set r and C (tr induction) V (B,w SC4), V (A,w Case 5: A is TB. (a) Let A c r saturated set r sis o f induction) f o r every negation coherent world w (B,w A F set r of the induction) there exists some negation coherent world w Undoubtedly, i f we were t o define entailment along the lines mentioned in I l l, we could also, given our approach, prove the strong semantical completeness theorem without any difficulty.* Department o f Philosophy' Gustavus Adolphu St. Peter, Minnesota GEORGACARAKOS * 1 am indebted to my colleague Robin Smith for valuable discussion concerning some of the points mentioned in this paper. REFERENCES 111 Fitting WC. intuitionistic Logic Model Theory and Forcing. Studies in Logic and the Foundations of Mathematics, North-Holland: Publishing Company, Haack, Susan, Deviant Logic. Cambridge University Press, Henkin L. The Completeness of the First-Order Functional Calculus. Journal of Symbolic Logic 1949; 14:

15 THE SEMANTICS OF MINIMAL INTUITIONISM Heyting A. Intuitionism. North-Holland: Publishing Company, Johansson 1. Der Minimalkalkul, ein reduzierter intuitionistische Formalismus. Compositio Mathematica 1936; Kolmogorov A.N. On the Principle of Excluded Middle. In From Frege to Gode!. ed. J. Heijenoort, Harvard University Press, Kripk e S. Semantical Analysis o f Intuitionistic Logic I. Formal Systems and Recursive Functions, ed. J. Crossley and M. Dummett Amsterdam, 1965, [81 Montague R., Henkin. O n the Definition o f 'Formal Deduction'. Journal o f Symbolic Logic 1957; 21: Prawitz D. Natural Deduction, A Proof-Theoretical Study, Acta Universitatis Stockholmiensis. Stockholm : Studies in Philosophy No. 3, Almquis t and Wiksell, Stockholm Rasiowa H., Sikorski R. The Mathematics of Metamathematics. Warszawa 1963, 3rd ed [I 11 Thomason R.H. On the Strong Semantical Completeness of the Intuitionistic Predicate Calculus. Journal of Symbolic Logic 1968; 33: 1-7.

CHAPTER 11. Introduction to Intuitionistic Logic

CHAPTER 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 information

Chapter 11: Automated Proof Systems (1)

Chapter 11: Automated Proof Systems (1) Chapter 11: Automated Proof Systems (1) SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems

More information

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

KRIPKE 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 information

Classical Propositional Logic

Classical Propositional Logic The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,

More information

1. Propositional Calculus

1. Propositional Calculus 1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:

More information

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

cse371/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 information

1. Propositional Calculus

1. Propositional Calculus 1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:

More information

Propositional Logic Language

Propositional 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 information

arxiv: v3 [math.lo] 13 Apr 2010

arxiv: v3 [math.lo] 13 Apr 2010 CONSTRUCTIVE TRUTH AND CIRCULARITY arxiv:0905.1681v3 [math.lo] 13 Apr 2010 NIK WEAVER Abstract. We propose a constructive interpretation of truth which resolves the standard semantic paradoxes. 1. Heuristic

More information

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models

Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Agata Ciabattoni Mauro Ferrari Abstract In this paper we define cut-free hypersequent calculi for some intermediate logics semantically

More information

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS

CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS 1 Language There are several propositional languages that are routinely called classical propositional logic languages. It is due to the functional dependency

More information

Introduction to Metalogic

Introduction 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 information

Chapter 11: Automated Proof Systems

Chapter 11: Automated Proof Systems Chapter 11: Automated Proof Systems SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems are

More information

Natural Deduction for Propositional Logic

Natural Deduction for Propositional Logic Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic

More information

Formal (natural) deduction in propositional logic

Formal (natural) deduction in propositional logic Formal (natural) deduction in propositional logic Lila Kari University of Waterloo Formal (natural) deduction in propositional logic CS245, Logic and Computation 1 / 67 I know what you re thinking about,

More information

Chapter 2: Introduction to Propositional Logic

Chapter 2: Introduction to Propositional Logic Chapter 2: Introduction to Propositional Logic PART ONE: History and Motivation Origins: Stoic school of philosophy (3rd century B.C.), with the most eminent representative was Chryssipus. Modern Origins:

More information

Logic for Computer Science - Week 4 Natural Deduction

Logic for Computer Science - Week 4 Natural Deduction Logic for Computer Science - Week 4 Natural Deduction 1 Introduction In the previous lecture we have discussed some important notions about the semantics of propositional logic. 1. the truth value of a

More information

Overview of Logic and Computation: Notes

Overview of Logic and Computation: Notes Overview of Logic and Computation: Notes John Slaney March 14, 2007 1 To begin at the beginning We study formal logic as a mathematical tool for reasoning and as a medium for knowledge representation The

More information

The semantics of propositional logic

The semantics of propositional logic The semantics of propositional logic Readings: Sections 1.3 and 1.4 of Huth and Ryan. In this module, we will nail down the formal definition of a logical formula, and describe the semantics of propositional

More information

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic

CHAPTER 10. Gentzen Style Proof Systems for Classical Logic CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning

More information

Propositional Logics and their Algebraic Equivalents

Propositional Logics and their Algebraic Equivalents Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic

More information

Relational Reasoning in Natural Language

Relational Reasoning in Natural Language 1/67 Relational Reasoning in Natural Language Larry Moss ESSLLI 10 Course on Logics for Natural Language Inference August, 2010 Adding transitive verbs the work on R, R, and other systems is joint with

More information

Subminimal Negation. Almudena Colacito, Dick de Jongh and Ana Lucia Vargas. March 30, 2016

Subminimal Negation. Almudena Colacito, Dick de Jongh and Ana Lucia Vargas. March 30, 2016 Subminimal Negation Almudena Colacito, Dick de Jongh and Ana Lucia Vargas March 30, 2016 Abstract Minimal Logic, i.e. intuitionistic logic without the ex falso principle, is investigated in its original

More information

Logic via Algebra. Sam Chong Tay. A Senior Exercise in Mathematics Kenyon College November 29, 2012

Logic via Algebra. Sam Chong Tay. A Senior Exercise in Mathematics Kenyon College November 29, 2012 Logic via Algebra Sam Chong Tay A Senior Exercise in Mathematics Kenyon College November 29, 2012 Abstract The purpose of this paper is to gain insight to mathematical logic through an algebraic perspective.

More information

Modal Dependence Logic

Modal Dependence Logic Modal Dependence Logic Jouko Väänänen Institute for Logic, Language and Computation Universiteit van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam, The Netherlands J.A.Vaananen@uva.nl Abstract We

More information

Semantics of intuitionistic propositional logic

Semantics of intuitionistic propositional logic Semantics of intuitionistic propositional logic Erik Palmgren Department of Mathematics, Uppsala University Lecture Notes for Applied Logic, Fall 2009 1 Introduction Intuitionistic logic is a weakening

More information

Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism

Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism A. Avron 1, A. Ciabattoni 2, and A. Zamansky 1 1 Tel-Aviv University 2 Vienna University of Technology Abstract. We apply the semantic

More information

Draft of February 2019 please do not cite without permission. A new modal liar 1 T. Parent

Draft of February 2019 please do not cite without permission. A new modal liar 1 T. Parent Draft of February 2019 please do not cite without permission 1. Introduction A new modal liar 1 T. Parent Standardly, necessarily is treated in modal logic as an operator on propositions (much like ~ ).

More information

Chapter 4: Classical Propositional Semantics

Chapter 4: Classical Propositional Semantics Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical

More information

Propositions and Proofs

Propositions and Proofs Chapter 2 Propositions and Proofs The goal of this chapter is to develop the two principal notions of logic, namely propositions and proofs There is no universal agreement about the proper foundations

More information

Formal Logic Lecture 11

Formal Logic Lecture 11 Faculty of Philosophy Formal Logic Lecture 11 Peter Smith Peter Smith: Formal Logic, Lecture 11 1 Outline Where next? Introducing PL trees Branching trees Peter Smith: Formal Logic, Lecture 11 2 Where

More information

Propositional Language - Semantics

Propositional Language - Semantics Propositional Language - Semantics Lila Kari University of Waterloo Propositional Language - Semantics CS245, Logic and Computation 1 / 41 Syntax and semantics Syntax Semantics analyzes Form analyzes Meaning

More information

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem

GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS. Contents 1. Introduction Gödel s Completeness Theorem GÖDEL S COMPLETENESS AND INCOMPLETENESS THEOREMS BEN CHAIKEN Abstract. This paper will discuss the completeness and incompleteness theorems of Kurt Gödel. These theorems have a profound impact on the philosophical

More information

The Curry-Howard Isomorphism

The Curry-Howard Isomorphism The Curry-Howard Isomorphism Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) The Curry-Howard Isomorphism MFES 2008/09

More information

Fuzzy Does Not Lie! Can BAŞKENT. 20 January 2006 Akçay, Göttingen, Amsterdam Student No:

Fuzzy Does Not Lie! Can BAŞKENT. 20 January 2006 Akçay, Göttingen, Amsterdam   Student No: Fuzzy Does Not Lie! Can BAŞKENT 20 January 2006 Akçay, Göttingen, Amsterdam canbaskent@yahoo.com, www.geocities.com/canbaskent Student No: 0534390 Three-valued logic, end of the critical rationality. Imre

More information

RELATIONS BETWEEN PARACONSISTENT LOGIC AND MANY-VALUED LOGIC

RELATIONS 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 information

Principles of Knowledge Representation and Reasoning

Principles 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 information

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC

CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,

More information

A BRIEF INTRODUCTION TO TYPED PREDICATE LOGIC

A BRIEF INTRODUCTION TO TYPED PREDICATE LOGIC A BRIEF INTRODUCTION TO TYPED PREDICATE LOGIC Raymond Turner December 6, 2010 Abstract Typed Predicate Logic 1 was developed to o er a unifying framework for many of the current logical systems, and especially

More information

cse541 LOGIC FOR COMPUTER SCIENCE

cse541 LOGIC FOR COMPUTER SCIENCE cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax

More information

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018

More information

Axiom schema of Markov s principle preserves disjunction and existence properties

Axiom schema of Markov s principle preserves disjunction and existence properties 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,

More information

Propositional logic (revision) & semantic entailment. p. 1/34

Propositional logic (revision) & semantic entailment. p. 1/34 Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)

More information

4 Kosta Do»sen models the modal relation will be as general as possible, and hence HK± 0 will be in the same position as the modal logic K based on th

4 Kosta Do»sen models the modal relation will be as general as possible, and hence HK± 0 will be in the same position as the modal logic K based on th PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série, tome 35 (49), 1984, pp. 3 14 NEGATIVE MODAL OPERATORS IN INTUITIONISTIC LOGIC Kosta Do»sen Abstract. Modal operators which correspond to impossibility

More information

Philosophy 134 Module 2 Non-Modal Sentential Logic

Philosophy 134 Module 2 Non-Modal Sentential Logic Philosophy 134 Module 2 Non-Modal Sentential Logic G J Mattey August 1, 2013 Contents 1 Syntax of Sentential Logic 3 11 Expressions of SL 3 12 Rules of Formation for SL 4 2 Semantics for Sentential Logic

More information

Completeness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them:

Completeness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them: Completeness in the Monadic Predicate Calculus We have a system of eight rules of proof. Let's list them: PI At any stage of a derivation, you may write down a sentence φ with {φ} as its premiss set. TC

More information

Topos Theory. Lectures 17-20: The interpretation of logic in categories. Olivia Caramello. Topos Theory. Olivia Caramello.

Topos 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 information

Introduction to Metalogic

Introduction to Metalogic Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional

More information

185.A09 Advanced Mathematical Logic

185.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 information

First-Degree Entailment

First-Degree Entailment March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?

More information

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets

More information

VALUATIONS FOR DIRECT PROPOSITIONAL

VALUATIONS FOR DIRECT PROPOSITIONAL VALUATIONS FOR DIRECT PROPOSITIONAL LOGIC In (1969) a subsystem of classical propositional logic - called direct logic since all indirect inferences are excluded from it - was formulated as a generalized

More information

The Syntax of First-Order Logic. Marc Hoyois

The 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 information

TRUTH-THEORIES FOR FRAGMENTS OF PA

TRUTH-THEORIES FOR FRAGMENTS OF PA TRUTH-THEORIES FOR FRAGMENTS OF PA RICHARD G. HECK, JR. The discussion here follows Petr Hájek and Pavel Pudlák, Metamathematics of First-order Arithmetic (Berlin: Springer-Verlag, 1993). See especially

More information

Introduction to Metalogic 1

Introduction to Metalogic 1 Philosophy 135 Spring 2012 Tony Martin Introduction to Metalogic 1 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: (i) sentence letters p 0, p 1, p 2,... (ii) connectives,

More information

Dual-Intuitionistic Logic and Some Other Logics

Dual-Intuitionistic Logic and Some Other Logics Dual-Intuitionistic Logic and Some Other Logics Hiroshi Aoyama 1 Introduction This paper is a sequel to Aoyama(2003) and Aoyama(2004). In this paper, we will study various proof-theoretic and model-theoretic

More information

admissible and derivable rules in intuitionistic logic

admissible and derivable rules in intuitionistic logic admissible and derivable rules in intuitionistic logic Paul Rozière Equipe de Logique, CNRS UA 753 Université Paris 7 2 place Jussieu, 75230 PARIS cedex 05 roziere@logique.jussieu.fr preliminary draft,

More information

Lecture 7. Logic. Section1: Statement Logic.

Lecture 7. Logic. Section1: Statement Logic. Ling 726: Mathematical Linguistics, Logic, Section : Statement Logic V. Borschev and B. Partee, October 5, 26 p. Lecture 7. Logic. Section: Statement Logic.. Statement Logic..... Goals..... Syntax of Statement

More information

PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série, tome 35 (49), 1984, pp INTUITIONISTIC DOUBLE NEGATION AS A NECESSITY OPERATOR Kosta Do»

PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série, tome 35 (49), 1984, pp INTUITIONISTIC DOUBLE NEGATION AS A NECESSITY OPERATOR Kosta Do» PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série, tome 35 (49), 1984, pp. 15 20 INTUITIONISTIC DOUBLE NEGATION AS A NECESSITY OPERATOR Kosta Do»sen Abstract. An intuitionistic propositional modal

More information

Madhavan Mukund Chennai Mathematical Institute

Madhavan Mukund Chennai Mathematical Institute AN INTRODUCTION TO LOGIC Madhavan Mukund Chennai Mathematical Institute E-mail: madhavan@cmiacin Abstract ese are lecture notes for an introductory course on logic aimed at graduate students in Computer

More information

The Logic of Proofs, Semantically

The Logic of Proofs, Semantically The Logic of Proofs, Semantically Melvin Fitting Dept. Mathematics and Computer Science Lehman College (CUNY), 250 Bedford Park Boulevard West Bronx, NY 10468-1589 e-mail: fitting@lehman.cuny.edu web page:

More information

BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR

BETWEEN 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 information

Learning Goals of CS245 Logic and Computation

Learning Goals of CS245 Logic and Computation Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction

More information

SEMANTICS OF INTUITIONISTIC PROPOSITIONAL LOGIC: HEYTING ALGEBRAS AND KRIPKE MODELS

SEMANTICS OF INTUITIONISTIC PROPOSITIONAL LOGIC: HEYTING ALGEBRAS AND KRIPKE MODELS SEMNTICS OF INTUITIONISTIC PROPOSITIONL LOGIC: HEYTING LGEBRS ND KRIPKE MODELS CHD E. BROWN bstract. We describe two well-known semantics for intuitionistic propositional logic: Heyting algebras and Kripke

More information

Plan of the talk. Harmony and Separability in Classical Logic. Two aspects of use. Logical inferentialism. Julien Murzi

Plan of the talk. Harmony and Separability in Classical Logic. Two aspects of use. Logical inferentialism. Julien Murzi Introduction Plan of the talk (1) In the first part of the talk, I ll introduce three possible (indeed, actual) interpretations of the inferentialist thesis that rules determine meanings Harmony and Separability

More information

AN EXTENSION OF THE PROBABILITY LOGIC LP P 2. Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2

AN EXTENSION OF THE PROBABILITY LOGIC LP P 2. Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2 45 Kragujevac J. Math. 33 (2010) 45 62. AN EXTENSION OF THE PROBABILITY LOGIC LP P 2 Tatjana Stojanović 1, Ana Kaplarević-Mališić 1 and Zoran Ognjanović 2 1 University of Kragujevac, Faculty of Science,

More information

Propositional Logic Review

Propositional Logic Review Propositional Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula Semantics Defining

More information

Propositional Logic: Part II - Syntax & Proofs 0-0

Propositional Logic: Part II - Syntax & Proofs 0-0 Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems

More information

cis32-ai lecture # 18 mon-3-apr-2006

cis32-ai lecture # 18 mon-3-apr-2006 cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem

More information

TR : Binding Modalities

TR : 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 information

TR : Tableaux for the Logic of Proofs

TR : Tableaux for the Logic of Proofs City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2004 TR-2004001: Tableaux for the Logic of Proofs Bryan Renne Follow this and additional works

More information

MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC

MONADIC 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 information

The Lambek-Grishin calculus for unary connectives

The Lambek-Grishin calculus for unary connectives The Lambek-Grishin calculus for unary connectives Anna Chernilovskaya Utrecht Institute of Linguistics OTS, Utrecht University, the Netherlands anna.chernilovskaya@let.uu.nl Introduction In traditional

More information

The Countable Henkin Principle

The Countable Henkin Principle The Countable Henkin Principle Robert Goldblatt Abstract. This is a revised and extended version of an article which encapsulates a key aspect of the Henkin method in a general result about the existence

More information

The Johansson/Heyting letters and the birth of minimal logic

The Johansson/Heyting letters and the birth of minimal logic The Johansson/Heyting letters and the birth of minimal logic Tim van der Molen 12 May 2016 Abstract In 1935 and 1936 Johansson and Heyting exchanged a series of letters. This exchange inspired Johansson

More information

Introduction to Intuitionistic Logic

Introduction to Intuitionistic Logic Introduction to Intuitionistic Logic August 31, 2016 We deal exclusively with propositional intuitionistic logic. The language is defined as follows. φ := p φ ψ φ ψ φ ψ φ := φ and φ ψ := (φ ψ) (ψ φ). A

More information

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Logical preliminaries Let L 0 be a language containing a complete set of Boolean connectives, including

More information

1. Tarski consequence and its modelling

1. Tarski consequence and its modelling Bulletin of the Section of Logic Volume 36:1/2 (2007), pp. 7 19 Grzegorz Malinowski THAT p + q = c(onsequence) 1 Abstract The famous Tarski s conditions for a mapping on sets of formulas of a language:

More information

On Modal Logics of Partial Recursive Functions

On Modal Logics of Partial Recursive Functions arxiv:cs/0407031v1 [cs.lo] 12 Jul 2004 On Modal Logics of Partial Recursive Functions Pavel Naumov Computer Science Pennsylvania State University Middletown, PA 17057 naumov@psu.edu June 14, 2018 Abstract

More information

PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL

PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL THOMAS HOFWEBER PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL 1. PROOF-THEORETIC REDUCTION AND HILBERT S PROGRAM Hilbert s program in the philosophy of mathematics comes in two parts. One part is a

More information

An Intuitively Complete Analysis of Gödel s Incompleteness

An Intuitively Complete Analysis of Gödel s Incompleteness An Intuitively Complete Analysis of Gödel s Incompleteness JASON W. STEINMETZ (Self-funded) A detailed and rigorous analysis of Gödel s proof of his first incompleteness theorem is presented. The purpose

More information

Module 5 K and Equivalent Systems

Module 5 K and Equivalent Systems Module 5 K and Equivalent Systems G. J. Mattey July 8, 2010 Contents 1 The Semantical System KI 2 1.1 Specification of KI....................................... 2 1.2 Semantical Properties and Relations

More information

Proof Theoretical Studies on Semilattice Relevant Logics

Proof Theoretical Studies on Semilattice Relevant Logics Proof Theoretical Studies on Semilattice Relevant Logics Ryo Kashima Department of Mathematical and Computing Sciences Tokyo Institute of Technology Ookayama, Meguro, Tokyo 152-8552, Japan. e-mail: kashima@is.titech.ac.jp

More information

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. Modalities in Ackermann's "Rigorous Implication" Author(s): Alan Ross Anderson and Nuel D. Belnap, Jr. Source: The Journal of Symbolic Logic, Vol. 24, No. 2 (Jun., 1959), pp. 107-111 Published by: Association

More information

Př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 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 information

Lecture 2: Syntax. January 24, 2018

Lecture 2: Syntax. January 24, 2018 Lecture 2: Syntax January 24, 2018 We now review the basic definitions of first-order logic in more detail. Recall that a language consists of a collection of symbols {P i }, each of which has some specified

More information

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic

Mathematics 114L Spring 2018 D.A. Martin. Mathematical Logic Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)

More information

A simplified proof of arithmetical completeness theorem for provability logic GLP

A simplified proof of arithmetical completeness theorem for provability logic GLP A simplified proof of arithmetical completeness theorem for provability logic GLP L. Beklemishev Steklov Mathematical Institute Gubkina str. 8, 119991 Moscow, Russia e-mail: bekl@mi.ras.ru March 11, 2011

More information

General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations

General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations OFER ARIELI AND ARNON AVRON, Department of Computer Science, School of Mathematical Sciences, Tel-Aviv University,

More information

First Order Logic: Syntax and Semantics

First Order Logic: Syntax and Semantics CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday

More information

Truth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation.

Truth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation. Outline 1 2 3 4 5 1 / 41 2 / 41 The Liar Sentence Let L be the sentence: This sentence is false This sentence causes trouble If it is true, then it is false So it can t be true Thus, it is false If it

More information

Taming Implications in Dummett Logic

Taming Implications in Dummett Logic Taming Implications in Dummett Logic Guido Fiorino Dipartimento di Metodi Quantitativi per le cienze Economiche ed Aziendali, Università di Milano-Bicocca, Piazza dell Ateneo Nuovo, 1, 20126 Milano, Italy.

More information

02 The Axiomatic Method

02 The Axiomatic Method CAS 734 Winter 2005 02 The Axiomatic Method Instructor: W. M. Farmer Revised: 11 January 2005 1 What is Mathematics? The essence of mathematics is a process consisting of three intertwined activities:

More information

Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI

Rasiowa-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 information

1 Completeness Theorem for Classical Predicate

1 Completeness Theorem for Classical Predicate 1 Completeness Theorem for Classical Predicate Logic The relationship between the first order models defined in terms of structures M = [M, I] and valuations s : V AR M and propositional models defined

More information

The Modal Logic of Pure Provability

The 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 information

Symposium: L.E.J. Brouwer, Fifty Years Later. Free Choice Sequences: A Temporal Interpretation Compatible with Acceptance of Classical Mathematics

Symposium: L.E.J. Brouwer, Fifty Years Later. Free Choice Sequences: A Temporal Interpretation Compatible with Acceptance of Classical Mathematics Symposium: L.E.J. Brouwer, Fifty Years Later Amsterdam December 9 th, 2016 Free Choice Sequences: A Temporal Interpretation Compatible with Acceptance of Classical Mathematics Saul A. Kripke CUNY Graduate

More information

De Jongh s characterization of intuitionistic propositional calculus

De Jongh s characterization of intuitionistic propositional calculus De Jongh s characterization of intuitionistic propositional calculus Nick Bezhanishvili Abstract In his PhD thesis [10] Dick de Jongh proved a syntactic characterization of intuitionistic propositional

More information

The faithfulness of atomic polymorphism

The 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 information

A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ

A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ A MODEL-THEORETIC PROOF OF HILBERT S NULLSTELLENSATZ NICOLAS FORD Abstract. The goal of this paper is to present a proof of the Nullstellensatz using tools from a branch of logic called model theory. In

More information