COMPLETENESS O F SOME QUANTIFIED MO DA L LOGICS. James W. GARSON

Size: px
Start display at page:

Download "COMPLETENESS O F SOME QUANTIFIED MO DA L LOGICS. James W. GARSON"

Transcription

1 COMPLETENESS O F SOME QUANTIFIED MO DA L LOGICS James W. GARSON O. Introduction We give here simple completeness proofs fo r a wide range of quantified modal logics. The systems in question have the axioms a n d rules o f some standard system o f propositional modal logic, axioms f o r intensional identity, and quantificational principles drawn from free logic. The semantics we give is more general than usual, and perhaps that explains the simplicity of the completeness results. Usually a semantics f o r quantified mo d a l lo g ic in vo lve s the introduction of a function D which assigns to each possible world d the set D(d) of individuals which «exist» in that world. We may think of D as the intension of a corresponding existence predicate 'E' in the object language. In our semantics, we introduce a function Ill, wh ich assigns to each possible wo rld d a set W(d) o f individual concepts, o r world lines (i.e., functions fro m the set o f possible worlds to the set of individuals). In this wa y we agree wit h Montague's [5] and Bressans [1] more general treatment of the intension of a predicate in our description o f the intension o f 'E'. ( result, the te rm position in 'E' becomes opaque, and not subject to substitution of identites. ( ( and by Bressan [1] on p. 24 and following. ( semantical treatment of 'E' t o the systems of this paper. The only changes required inv olv e res tric tion of the substitution of identities t o t erm -places of predicates whic h are n o t giv en t he more general interpretation.

2 154 J A M E S W. GARSON 1. Fo rma l Motivation Wh y should we want to generalize the treatment of the in - tension of 'E' in this wa y? The first set of reasons are formal. When D is used, there are several ways of introducing the truth definition f o r th e quantifiers, a n d i t i s n o t e a sy t o decide which is best. () A t least one o f these results in a definition of validity which is not axiomitizable (system Q2). On another definition (system Q3 ) t h e completeness results a re h ig h ly sensitive t o t h e strength o f th e mo d a l operator. Strategies which wo rk (say) t o show th e completeness o f S4 strength quantified modal logics (fo r example those used to show completeness o f Q3-S4) are not applicable to the weaker systems such as Q3-M o r Q3-K. That difficulty does not arise with the more general interpretation o f the quantifiers w e g ive here. One simple strategy serves to provide results for any quantified modal logic whose modal fragment is determined by some nonempty class of Kripke frames, and fo r which a standard Henkin style completeness proof is available. In short, the methods of this paper yie ld simple completeness proofs f o r quantified versions o f th e va st ma jo rit y o f studied systems o f mo d a l logic. 2. I n f o rma l Motivation Are there any reasons other than formal fo r accepting the approach o f this paper? I believe there are philosophical in - tuitions which recommend it, particularly when the quantified modal logics at issue are tense logics. I t is generally felt that it is not part of the province of logic to determine which of the competing ontological theories is correct. I t follows that semantics f o r quantified modal logics should n o t ru le o u t a n y reasonable ontological theory. ( discusses s imilar matters f o r another intens ional logic.

3 COMPLETENESS OF SOME QUANTIFIED MODAL LOGICS 155 There is a venerable and pervasive ontology, which we might call ordinary onotology, o r Aristotelian ontology, which seems to require the approach we have taken to the intension of the existence predicate. I t is basic to this position that there are objects, and that objects change. So the formal counterpart of an object in a tense lo g ic semantics must be a time -wo rm o r individual concept, and not a slice o f a time wo rm, since i t makes no sense to say of the latter that it changes. In a tense logic then, a n object should be treated as a function f ro m times in t o temporal slices o f objects (o r point-events), a n d hence objects a re th e intensions, n o t th e extensions o f the terms. Now what does this have to do with whether the intension of 'E' should yield at time t a sot of individuals o r a set o f individual concepts? We kn o w that there are ma n y predicats P which are extensional, which means that the calculation of the truth-value o f 'Pn' (sa y a t t) depends so le y o n whether the time slice (individual) refered to b y 'n' at t fails in the extension of 'P' (at t), and does not otherwise involve the intension of 'n'. Couldn't it turn out that 'E' is one o f these extensional predicates? I think there are stong intuitions which rule against this and wh ich show that at least one rather basic treatment of existence i n temporal situations requires th e intensional approach. To see this, imagine what we would say (at t) i f a temporal slice (o f finite, b u t small duration, i f yo u like ) o f an object (say a slice of Gerald Ford) were to be present at t, in a context where the preceding and subsequent temporal slices o f Gerald Ford were absent. No w it is true that we might be in - clined to say that something existed a t t, namely a temporal slice of Gerald Ford, o r a fleeting «apparition» o f Gerald Ford. It would be strange, however, to claim that Gerald Ford existed at t under these circumstances, fo r part o f what makes us want to say that Gerald Ford exists a t t, is the existence o f previous and subsequent stages of Gerald Ford arranged in a certain coherent fashion. This result should not be surprizing. The ordinary ontology takes objects as basic, so questions about existence and non-

4 156 J A M E S W. GARSON existence of objects should be questions about objects and not about certain o f th e ir temporal parts. So i t fo llo ws th a t i f objects are to be treated as functions from times to times slices, then the referent o f 'Er a t a time t should be a set o f these sorts of functions, and not a set of time slices. 3. T h e predicate 'E' The predicate 'E' is included as a p rimitive of our systems. Its p rimit ive inclusion is important t o the generality o f the results. I n free logc, and in modal logics where the domain of quantification shifts from possible wo rld to possible world, the usual a xio m o f universal instantiation is invalid, since i t is possible f o r V xa t o b e t ru e a t wo rld d, a n d f o r A n i x t o be false when 'n ' denotes something outside th e domain o f quantification for d. If we conditionalize the consequent of this axiom, a va lid formula results, wh e n the rig h t condition is chosen. The condition we want is a formula wh ich expresses that 'n' refers to some «object» in the domain of quantification for d. I n free lo g ic ' 3 xx n' serves that purpose. However, this formula will not wo rk in an intensional logic which gives '--' th e intensional o r we a k interpretation o f identitiy, a n d which includes our approach to existence. That is because we now need a condition which says that the function refered to by 'n' falls into the domain 1 But ' 3 xx n' says something weaker, namely that there is a function g such that g(d) is the extension of n at d. It does not improve matters to replace ' 3 xx n' wit h ' x x = -n ', unless the u n d e rlyin g mo d a l syste m i s a s stro n g a s Szl. ( ' 3 xelx n' says o n ly that there is a function g T ( d ) wh ich agrees with the intension of n at those arguments in the range of the Kripke relation R at d. ( n n F r i ) bec omes v a l i d o n o u r semantics, i n s p it e o f t h e f a c t t h a t x 0 x n does not express that the func tion refered to b y ' n' at d falls in.411(d).

5 COMPLETENESS OF SOME QUANTIFIED MODAL LOGICS Rig id it y of variables One o f th e ma jo r simp lifyin g assumptions ma d e i n Q3, Thomason's [6] approach to quantified modal logic, is to assume that the intensions o f the variables a re constant functions, that is to say, that their extensions do not change f ro m possible wo rld to possible world. On the other hand, he allows the terms t o be non-rigid. Th is leads t o fo rma l and philosophical akwardness. The formal akwardness is that the domain of quantification becomes the set of constant functions, or as Thomason believes he should ca ll them, the substances. This invalidates the usual axiom fo r universal generalization. B y adding an instantiation condition H x x n', a valid axiom A4' V xad(3xdx ndanx) results, b u t o n ly when the underlying modal lo g ic is S4 o r stronger. I n logics o f weaker modality, A4 i s invalid, and it is difficult to specify the instantiation condition that is needed for a sound and complete system. Hin tikka [4] describes this matter in detail and gives the complicated axioms wh ich must be used. Thomason's refusal t o consider we a ke r modalities saves h im fro m considerable complications, and even so, the rules fo r his system Q3 are elaborate. Insisting on the rig id ity of variables leads to formal complications, b u t I doubt th a t i t i s acceptable o n philosophical grounds either. Thomason motivates his decision to «rigidify» the variables b y claiming that this allows us to incorporate a concept of substance into modal logic. In choosing our variables to be rig id designators, we are supposed to get the effect of quantifying ju st o ve r the substances. But wh y should we conclude th a t th e substances a re e xa ctly th e intensions o f rigid designators. It is at the ve ry least inconvenient to do so. First, the insistence that a term for a substance refers to the same individual in each possible wo rld immediately poses the problem of providing id e n tity conditions fo r individuals across possible worlds. Is i t sensible to assume that Plato (wh ich I

6 158 J A M E S W. GARSON take to be a substance for the present discussion) in this wo rld is exactly identical to the Plato of some other possible wo rld? Well, not unless Plato's identity does not depen don his accidental properties. But if trans-world identification is to depend only on essential properties, h o w can we be sure that there aren't possible wo rld s wh e re t wo substances (sa y Aristo tle and Plato) have exactly the some essence, and so are identical in that world, with the result that they must be ruled identical in all worlds? The inconvenience becomes mo re apparent when we g ive modal logics a tense interpretation. We would like to quantify over Gerald Ford as a member of our ontology, yet the extension o f 'Gerald Ford' is not constant across times, since each time slice of his has its own peculiar properties. Insistence on the myth that 'Gerald Ford' is after all a rig id designator provokes a fruitless search fo r «something» wh ich remains constant in all these time slices. The difference between substances a n d o th e r «things» i s undoubtedly too subtle to be captured via the simple notion of the rig id it y o f designators. I n fact, i n order to be fa ir to any system o f ontology, th e best th in g t o d o wo u ld b e t o make no assumptions at all about the semantical properties o f the terms that happen to refer to substances. We now find another reason for choosing the general approach of this paper. O u r existence predicate E has a set o f in - dividual concepts as its extension, and this set can serve admirably as the boundary between substances and non-substances for those ontologies which bother to make the distinction. Since there are no conditions on this set in our definition o f a model, any sort of ontology of substances may be accomodated. Since the substances so identified are not necessarily constant functions, the problem o f trans-world identification does n o t need t o bother us unless th e ontology in question requires such a concept. In this wa y we leave the problem to the ontologist, not the logician. Special logics designed t o capture assumptions about substance o r any other interesting sorts fo r quantification can be constructed b y putting appropriate conditions o n the seman-

7 COMPLETENESS OF SOME QUANTIFIED MODAL LOGICS 159 tical behavior of E in our definition of a model. So Thomason's approach can be reconstructed with in ours. If we want a logic which does n o t close ontological issues, however, we should choose the generality of the approach of this paper. 4. A xio ma t ic Features of MQ We w i l l demonstrate th e completeness o f a system MQ, written i n a morphology L f o r quantified mo d a l lo g ic wit h identity, wh ich includes the primative predicate constant 'E' for 'exists'. M Q contains the principles o f some propositonal modal logic M for which a standard Henkin-style completeness proof is available. (By standard, we mean to include that the definition o f the Krip ke relation R in the canonical model is given in the standard way: Rdc if f {A : 0 A E d }c c. ) I t includes as we ll axioms for intensional identity: (A=) t = t (AS) H (s = t D (F(s) F ( t ) ), where F(s) is atomic and F(t) is the result of replacing t fo r some occurrence o f s in F(s). A formula is atomic just in case it contains no logical constants. We consider 'E' to be a logical constant, so substitution guaranteed b y (AS) does not apply to 'E'. M Q also contains the following quantificational principles d ra wn f ro m free logic: (VG) H ( A D (Ex DB)) H ( A D V xb) (VI) ( V xa D (EtDAt/x)). At/x i s t h e re su lt o f replacing a n y t e rm t p ro p e rly f o r x wherever x appears in A. 'When l'' is a set of formulas, 'F H A' means that either A is provable in MQ, o r there is some conjunction G o f members of I ' such that H 31Q

8 160 J A M E S W. GARSON contradiction o f propositional logic. Let T be any set o f terms o f L, and le t F(T) be the set o f formulas o f the morphology like L save that i t has its o n ly terms the members of T. Let T b e the set of terms that appear in the set of formulas A set o f formulas A i s a MQ-se t if f f o r e ve ry formula A of F(TA) j. A 4 V x A E A. A MQ-set is ju st a saturated set with respect to the set F(TA) of formulas of the morphology which contains only terms found in A, where saturation is defined as is appropriate fo r free logic. MQ-set Lemma. I f F is a set o f formulas such that r and there is an infinite set of terms T of L, none o f which is in T F (T Proof: Simila r t o th e p ro o f o f the Lindenbaum Lemma. MQ-sets obey the usual properties o f saturated sets wh e n attention is restricted to the formulas o f th e ir corresponding morphologies. In particular P. Wh e n A is a MQ-set, the fo llo win g properties hold fo r all A, B F ( T 1. i f A 2. A E A iff A E A. 3. ( A D B ) E A iff A(4 A o r BE A. 4. V x A L if f for all terms tett,, ( E t D A t x ) L. 5. Semantics for MQ An M-model U fo r L is a quintuple < D, R, I, u >, where <D, R > is a member of the set of Kripke frames which deter- (5) Following Hans s on a n d Gardenfors [31 a K rip k e f ra me i s a p a i r < D, R > c ons is ting of a non-empty domain D (of possible worlds ) and a binary relat ion R on D. A propos itional modal logic M is determined b y

9 COMPLETENESS OF SOME QUANTIFIED MODAL LOGICS 161 mine M, ( which assigns to each d D a subset o f the set o f functions from D into I, and u is an interpretation function which assigns to each term t a function u(t) fro m D into I, and which assigns to each j-a ry predicate letter Pi (other than E) a function fro m D into the power set o f V. (We le t P null set, so that in the case o f a propositional variable 1: u (1 We define ' U d 0) U d Et iff u(t) (1)(d) 1) U d Pit 2) U s = t iff u(s) (d) is u(t)(d) 3) U d A iff not U d A 4) U ( A B ) iff not U A or U B 5) U 1 d V x A iffuf/x or fix A for all f U ( d ) (Ufix the model identical to U save that its interpretation function assigns f to x.) 6) U D A iff for all e I D, if Rde, then U e A set o f formulas F o f morphology L is MQ-satisfiable i n L just in case there is an M-model fo r L en wh ich each o f the members o f F is true. Valid ity is defined fro m satisfaction in the usual way. It is a simple matter to show by induction that S. U " (t) / 6. T h e completeness of MQ Let us define a canonical model U quintuple < D, R, I, 1 there is an infinite set of terms o f L not in T {A : D A c d} c, and iii. u(t)(d) is { s : s = t c.1}, and iv. u(pl)(d) a class K of Kripk e frames jus t in case f o r ev ery member < D, R > o f K, every model f o r < D, R > satisfies a ll and only the theorems of M.

10 162 J A M E S W. GARSON is t < u (t 1 ) is i fo r some term t of L and d ED, and vi. f k lf (d ) if f u(t) is f and EtE d for some term t of L. If follows from this definition that E. E t E d iff u(t)eu(d) Proof: The proof from le ft to rig h t is trivia l. No w suppose that u(t)eu(d). Then fo r some t', u(t) is u(t') and Et' Ed. But u(t) is u (t) only when t is t', for when t is not t' there is always a MQ-se t ei D wh e re t E T, a n d t ' OT,, w i t h th e re su lt th a t u(t)(e) is not 0, while u(t')(e) is. It follows then that Et Ed. We are not ready to prove The Model Lemma F o r every formula A and each d ED, if A E F(T The proof is by induction on the form of A. Cases for formulas having fo rms other than O B a re easy t o p ro vid e g ive n P. S., and E.. So we tu rn to th e case f o r formulas having the form OB. Suppose d E D and E I B E F(T Then (I) f o r all ced, if Rdc, then U B. Now le t d b e { A : D A E d I, and suppose fo r reductio that d. 1 set T o f terms foreign to c, and since the members o f d U { B} are all in F(T Now f o rm t wo in fin ite d isjo in t sets T T that d U { B} c e and e c F (T 1=1 El (9 T o do this, order Ti then let T of the ordering.

11 COMPLETENESS OF SOME QUANTIFIED MODAL LOGICS 163 of terms (namely T Bee. Since E )B e F (T By the hypothesis of the induction and B e F (T clude that not U, 1 3. So there is a member e o f D such that Rde and not 1 1,B, which contradicts (1). Ou r reductio is complete, and so we know that d 1 B. I t follows that either or there are formulas D A & A )n B. I n the first case D B, hence D B ed b y P., and in the second case it follows b y the principles o f M (wh ich is as strong as K) that ( D A, & & DA ) D DB. So d 1 DB, and by P., OBed. Now let e be any member of D and suppose that O B e d and Rde. Then Bee, and so B e F (T the induction and this last result to obtain U h that U ( 1. Theorem. MO is strongly complete. Proof. We show that any consistent set of formulas is MCIsatisfiable. Let I' be any consistent set of formulas in morphology L. Let L b e the morphology that results fro m adding to the terms o f L an infinite se t T o f terms foreign t o L. N o w divide T into two disjoint infinite sets T Lemma, there is an extension A of F such that A F ( T U TO. No w consider U that its Krip ke frame < D, R > is a member o f the class o f Kripke frames wh ich determines M, b y reviewing the appropriate portion of the completeness proof for M, since the definition given for R in U c Now there is a n in fin ite se t (namely T which are not in T Lemma, A e A if f U B y forming the model like U that its interpretation function is restricted to the terms o f L, we produce an M-model fo r L wh ich satisfies the set o f fo r- mulas o f A wh ich are written in L. Since F is a subset o f this set, F ust be MO-satisfiable in L. We have been somewhat detailed in our exposition o f this proof. Th a t is because we have ru n a considerable ris k o f failure in introducing saturated sets wh ich do not contain a ll

12 164 J A M E S W. GARSON the terms of our language. It was therefore important to show that the proof works in spite of the use of such improvershed sets, and so we paid particular attention to h o w mention o f the language plays a role in this proof. University of Notre Dame J a m e s W. Garson BIBLIOGRAPHY [1] A. BRESSAN, A G eneral Interpreted M o d a l Calc ulus, Y a le Univ ers it y Press (1972). [2] J. GARSON, Indefinite t opologic al logic, J ournal o f Philos ophic al Logic, vol. 2. (1973), pp [3] B. HANSSON and P. airdenfors, A guide t o intens ional semantics, i n Modality, Mo ra lit y a n d O t h e r Problems o f Sense a n d Reference, Lund (1973). [4] J. FlorrnaA, Existential and uniqueness presuppositions, in Philos ophic al Problems in Logic (ed. K. Lambert), Reidel (1970). 151 R. MONTAGUE, T h e p ro p e r t reat ment o f quantific ation i n englis h, i n Formal Philosophy (ed. R.H. Thomason) Yale Univ ers ity Press (1974), pp [6] R. THOMASON, Mo d a l lo g ic a n d metaphysics, i n Th e Logic al W a y o f Doing Things (ed. K. Lambert), Y a le Univ ers it y Press (1969).

GRADES OF MODALITY L. F. COBLE

GRADES OF MODALITY L. F. COBLE GRADES OF MODALITY L. F. COBLE I. Despite its title, this paper does not deal with what Quine discussed in his "Three Grades o f Modal Involvement" [3]. I t may, however, apply somewhat to the sort of

More information

CMPSCI 601: Tarski s Truth Definition Lecture 15. where

CMPSCI 601: Tarski s Truth Definition Lecture 15. where @ CMPSCI 601: Tarski s Truth Definition Lecture 15! "$#&%(') *+,-!".#/%0'!12 43 5 6 7 8:9 4; 9 9 < = 9 = or 5 6?>A@B!9 2 D for all C @B 9 CFE where ) CGE @B-HI LJKK MKK )HG if H ; C if H @ 1 > > > Fitch

More information

LEGAL REASONING A S A TYPE OF PRACTICAL REASONING. J. David NEWELL

LEGAL REASONING A S A TYPE OF PRACTICAL REASONING. J. David NEWELL LEGAL REASONING A S A TYPE OF PRACTICAL REASONING J. David NEWELL In this paper, I shall attempt to defend the vie w that legal reasoning is a type o f practical reasoning. M y defense w i l l p rima rily

More information

A L A BA M A L A W R E V IE W

A L A BA M A L A W R E V IE W A L A BA M A L A W R E V IE W Volume 52 Fall 2000 Number 1 B E F O R E D I S A B I L I T Y C I V I L R I G HT S : C I V I L W A R P E N S I O N S A N D TH E P O L I T I C S O F D I S A B I L I T Y I N

More information

Existence and Predication in Free Logics. Secretaria de Estado de Educação do Distrito Federal, Brasil

Existence and Predication in Free Logics. Secretaria de Estado de Educação do Distrito Federal, Brasil Studia Humana Volume 6:4 (2017), pp. 3 9 DOI: 10.1515/sh-2017-0023 Guilherme Kubiszeski Existence and Predication in Free Logics Secretaria de Estado de Educação do Distrito Federal, Brasil email: guilhermefk4@gmail.com

More information

A BEGRIFFSSCHRIFT FOR SENTENTIAL LOGIC. John EVENDEN 1. INTRODUCTION

A BEGRIFFSSCHRIFT FOR SENTENTIAL LOGIC. John EVENDEN 1. INTRODUCTION A BEGRIFFSSCHRIFT FOR SENTENTIAL LOGIC John EVENDEN 1. INTRODUCTION The title of this essay is probably a misnomer, but the aim is to achieve f o r sentential lo g ic something v e ry simila r t o Frege's

More information

Proving Completeness for Nested Sequent Calculi 1

Proving Completeness for Nested Sequent Calculi 1 Proving Completeness for Nested Sequent Calculi 1 Melvin Fitting abstract. Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there

More information

Williamson s Modal Logic as Metaphysics

Williamson s Modal Logic as Metaphysics Williamson s Modal Logic as Metaphysics Ted Sider Modality seminar 1. Methodology The title of this book may sound to some readers like Good as Evil, or perhaps Cabbages as Kings. If logic and metaphysics

More information

First-Order Logic. Chapter Overview Syntax

First-Order Logic. Chapter Overview Syntax Chapter 10 First-Order Logic 10.1 Overview First-Order Logic is the calculus one usually has in mind when using the word logic. It is expressive enough for all of mathematics, except for those concepts

More information

Modal and temporal logic

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

Informal Statement Calculus

Informal Statement Calculus FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example

More information

S4LP and Local Realizability

S4LP and Local Realizability S4LP and Local Realizability Melvin Fitting Lehman College CUNY 250 Bedford Park Boulevard West Bronx, NY 10548, USA melvin.fitting@lehman.cuny.edu Abstract. The logic S4LP combines the modal logic S4

More information

NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM

NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM Notre Dame Journal of Formal Logic Volume 41, Number 1, 2000 NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM HILARY PUTNAM Abstract This lecture, given at Beijing University in 1984, presents

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

Notes on Modal Logic

Notes on Modal Logic Notes on Modal Logic Notes for PHIL370 Eric Pacuit October 22, 2012 These short notes are intended to introduce some of the basic concepts of Modal Logic. The primary goal is to provide students in Philosophy

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

TR : Possible World Semantics for First Order LP

TR : Possible World Semantics for First Order LP City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2011 TR-2011010: Possible World Semantics for First Order LP Melvin Fitting Follow this and additional

More information

SKETCHY NOTES FOR WEEKS 7 AND 8

SKETCHY NOTES FOR WEEKS 7 AND 8 SKETCHY NOTES FOR WEEKS 7 AND 8 We are now ready to start work on the proof of the Completeness Theorem for first order logic. Before we start a couple of remarks are in order (1) When we studied propositional

More information

Notes on Modal Logic

Notes on Modal Logic Notes on Modal Logic Notes for Philosophy 151 Eric Pacuit January 25, 2009 These short notes are intended to supplement the lectures and text ntroduce some of the basic concepts of Modal Logic. The primary

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

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

All psychiatrists are doctors All doctors are college graduates All psychiatrists are college graduates

All psychiatrists are doctors All doctors are college graduates All psychiatrists are college graduates Predicate Logic In what we ve discussed thus far, we haven t addressed other kinds of valid inferences: those involving quantification and predication. For example: All philosophers are wise Socrates is

More information

Prefixed Tableaus and Nested Sequents

Prefixed Tableaus and Nested Sequents Prefixed Tableaus and Nested Sequents Melvin Fitting Dept. Mathematics and Computer Science Lehman College (CUNY), 250 Bedford Park Boulevard West Bronx, NY 10468-1589 e-mail: melvin.fitting@lehman.cuny.edu

More information

TABLEAU SYSTEM FOR LOGIC OF CATEGORIAL PROPOSITIONS AND DECIDABILITY

TABLEAU SYSTEM FOR LOGIC OF CATEGORIAL PROPOSITIONS AND DECIDABILITY Bulletin of the Section of Logic Volume 37:3/4 (2008), pp. 223 231 Tomasz Jarmużek TABLEAU SYSTEM FOR LOGIC OF CATEGORIAL PROPOSITIONS AND DECIDABILITY Abstract In the article we present an application

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

The predicate calculus is complete

The predicate calculus is complete The predicate calculus is complete Hans Halvorson The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c,

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

A NOTE ON COMPOSITIONALITY IN THE FIRST ORDER LANGUAGE

A NOTE ON COMPOSITIONALITY IN THE FIRST ORDER LANGUAGE Janusz Maciaszek Luis Villegas-Forero A NOTE ON COMPOSITIONALITY IN THE FIRST ORDER LANGUAGE Abstract The main objective of this paper is to present the syntax and semantic of First Order Language in a

More information

Introduction to Logic in Computer Science: Autumn 2006

Introduction to Logic in Computer Science: Autumn 2006 Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Today s class will be an introduction

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

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

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

Class 29 - November 3 Semantics for Predicate Logic

Class 29 - November 3 Semantics for Predicate Logic Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 29 - November 3 Semantics for Predicate Logic I. Proof Theory

More information

Notes for Math 601, Fall based on Introduction to Mathematical Logic by Elliott Mendelson Fifth edition, 2010, Chapman & Hall

Notes for Math 601, Fall based on Introduction to Mathematical Logic by Elliott Mendelson Fifth edition, 2010, Chapman & Hall Notes for Math 601, Fall 2010 based on Introduction to Mathematical Logic by Elliott Mendelson Fifth edition, 2010, Chapman & Hall All first-order languages contain the variables: v 0, v 1, v 2,... the

More information

Peano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now

Peano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano

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

Truthmaker Maximalism defended again. Eduardo Barrio and Gonzalo Rodriguez-Pereyra

Truthmaker Maximalism defended again. Eduardo Barrio and Gonzalo Rodriguez-Pereyra 1 Truthmaker Maximalism defended again 1 Eduardo Barrio and Gonzalo Rodriguez-Pereyra 1. Truthmaker Maximalism is the thesis that every truth has a truthmaker. Milne (2005) attempts to refute it using

More information

Philosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc.

Philosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc. Philosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc. Modal operators are non-truth-functional; the truth-value of α at a world is not determined by α s s

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

Canonical models for normal logics (Completeness via canonicity)

Canonical models for normal logics (Completeness via canonicity) 499 Modal and Temporal Logic Canonical models for normal logics (Completeness via canonicity) Marek Sergot Department of Computing Imperial College, London Autumn 2008 Further reading: B.F. Chellas, Modal

More information

Syntax Semantics Tableau Completeness Free Logic The Adequacy of First-Order Logic. Predicate Logic. Daniel Bonevac.

Syntax Semantics Tableau Completeness Free Logic The Adequacy of First-Order Logic. Predicate Logic. Daniel Bonevac. March 18, 2013 Aristotle s theory of syllogisms, the first real logical theory, took predicates expressions that are not true or false in themselves, but true or false of objects as its basic units of

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

Philosophy 244: #14 Existence and Identity

Philosophy 244: #14 Existence and Identity Philosophy 244: #14 Existence and Identity Existence Predicates The problem we ve been having is that (a) we want to allow models that invalidate the CBF ( xα x α), (b) these will have to be models in

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

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

Majority Logic. Introduction

Majority Logic. Introduction Majority Logic Eric Pacuit and Samer Salame Department of Computer Science Graduate Center, City University of New York 365 5th Avenue, New York 10016 epacuit@cs.gc.cuny.edu, ssalame@gc.cuny.edu Abstract

More information

Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January )

Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January ) Notes on Propositional and First-Order Logic (CPSC 229 Class Notes, January 23 30 2017) John Lasseter Revised February 14, 2017 The following notes are a record of the class sessions we ve devoted to the

More information

CS632 Notes on Relational Query Languages I

CS632 Notes on Relational Query Languages I CS632 Notes on Relational Query Languages I A. Demers 6 Feb 2003 1 Introduction Here we define relations, and introduce our notational conventions, which are taken almost directly from [AD93]. We begin

More information

A generalization of modal definability

A generalization of modal definability A generalization of modal definability Tin Perkov Polytechnic of Zagreb Abstract. Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models

More information

Lecture Notes: Axiomatic Semantics and Hoare-style Verification

Lecture Notes: Axiomatic Semantics and Hoare-style Verification Lecture Notes: Axiomatic Semantics and Hoare-style Verification 17-355/17-665/17-819O: Program Analysis (Spring 2018) Claire Le Goues and Jonathan Aldrich clegoues@cs.cmu.edu, aldrich@cs.cmu.edu It has

More information

Russell s logicism. Jeff Speaks. September 26, 2007

Russell s logicism. Jeff Speaks. September 26, 2007 Russell s logicism Jeff Speaks September 26, 2007 1 Russell s definition of number............................ 2 2 The idea of reducing one theory to another.................... 4 2.1 Axioms and theories.............................

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

PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms

PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION. The Peano axioms PEANO AXIOMS FOR THE NATURAL NUMBERS AND PROOFS BY INDUCTION The Peano axioms The following are the axioms for the natural numbers N. You might think of N as the set of integers {0, 1, 2,...}, but it turns

More information

The two-dimensionalism of The Conscious Mind

The two-dimensionalism of The Conscious Mind The two-dimensionalism of The Conscious Mind phil 93515 Jeff Speaks February 5, 2007 1 Primary and secondary intension........................ 1 2 Indexicality and intensions............................

More information

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

More information

There are infinitely many set variables, X 0, X 1,..., each of which is

There are infinitely many set variables, X 0, X 1,..., each of which is 4. Second Order Arithmetic and Reverse Mathematics 4.1. The Language of Second Order Arithmetic. We ve mentioned that Peano arithmetic is sufficient to carry out large portions of ordinary mathematics,

More information

On an Unsound Proof of the Existence of Possible Worlds

On an Unsound Proof of the Existence of Possible Worlds 598 Notre Dame Journal of Formal Logic Volume 30, Number 4, Fall 1989 On an Unsound Proof of the Existence of Possible Worlds CHRISTOPHER MENZEL* Abstract In this paper, an argument of Alvin Plantinga's

More information

THE SYNTAX AND SEMANTICS OF STANDARD QUANTIFICATION THEORY WITH IDENTITY (SQT)

THE SYNTAX AND SEMANTICS OF STANDARD QUANTIFICATION THEORY WITH IDENTITY (SQT) THE SYNTAX AND SEMANTICS OF STANDARD QUANTIFICATION THEORY WITH IDENTITY (SQT) The construction of this theory begins with the description of the syntax of the formal language of the theory, by first enumerating

More information

Expressiveness, decidability, and undecidability of Interval Temporal Logic

Expressiveness, decidability, and undecidability of Interval Temporal Logic University of Udine Department of Mathematics and Computer Science Expressiveness, decidability, and undecidability of Interval Temporal Logic ITL - Beyond the end of the light Ph.D. Defence Dario Della

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

Gödel s Completeness Theorem

Gödel s Completeness Theorem A.Miller M571 Spring 2002 Gödel s Completeness Theorem We only consider countable languages L for first order logic with equality which have only predicate symbols and constant symbols. We regard the symbols

More information

Mathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy

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

1. Model existence theorem.

1. Model existence theorem. We fix a first order logic F such that 1. Model existence theorem. C. We let S be the set of statements of F and we suppose Γ S. We let VFT be the set of variable free terms. For each s VFT we let [s]

More information

Meaning and Reference INTENSIONAL AND MODAL LOGIC. Intensional Logic. Frege: Predicators (general terms) have

Meaning and Reference INTENSIONAL AND MODAL LOGIC. Intensional Logic. Frege: Predicators (general terms) have INTENSIONAL AND MODAL LOGIC Meaning and Reference Why do we consider extensions to the standard logical language(s)? Requirements of knowledge representation / domain modelling Intensional expressions:

More information

Systems of modal logic

Systems of modal logic 499 Modal and Temporal Logic Systems of modal logic Marek Sergot Department of Computing Imperial College, London utumn 2008 Further reading: B.F. Chellas, Modal logic: an introduction. Cambridge University

More information

COMPUTER SCIENCE TEMPORAL LOGICS NEED THEIR CLOCKS

COMPUTER SCIENCE TEMPORAL LOGICS NEED THEIR CLOCKS Bulletin of the Section of Logic Volume 18/4 (1989), pp. 153 160 reedition 2006 [original edition, pp. 153 160] Ildikó Sain COMPUTER SCIENCE TEMPORAL LOGICS NEED THEIR CLOCKS In this paper we solve some

More information

McTaggart s Argument for the Unreality of Time:

McTaggart s Argument for the Unreality of Time: McTaggart s Argument for the Unreality of Time: A Temporal Logical Analysis Hunan Rostomyan In this paper I want to examine McTaggart s [1908] argument for the unreality of time. McTaggart starts with

More information

INTENSIONS MARCUS KRACHT

INTENSIONS MARCUS KRACHT INTENSIONS MARCUS KRACHT 1. The Way Things Are This note accompanies the introduction of Chapter 4 of the lecture notes. I shall provide some formal background and technology. Let a language L be given

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

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs

More information

Change, Change, Change: three approaches

Change, Change, Change: three approaches Change, Change, Change: three approaches Tom Costello Computer Science Department Stanford University Stanford, CA 94305 email: costelloqcs.stanford.edu Abstract We consider the frame problem, that is,

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

Relevant Logic. Daniel Bonevac. March 20, 2013

Relevant Logic. Daniel Bonevac. March 20, 2013 March 20, 2013 The earliest attempts to devise a relevance logic that avoided the problem of explosion centered on the conditional. FDE, however, has no conditional operator, or a very weak one. If we

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

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

First-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms

First-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO

More information

Cut-Elimination and Quantification in Canonical Systems

Cut-Elimination and Quantification in Canonical Systems A. Zamansky A. Avron Cut-Elimination and Quantification in Canonical Systems Abstract. Canonical propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules

More information

First-order resolution for CTL

First-order resolution for CTL First-order resolution for Lan Zhang, Ullrich Hustadt and Clare Dixon Department of Computer Science, University of Liverpool Liverpool, L69 3BX, UK {Lan.Zhang, U.Hustadt, CLDixon}@liverpool.ac.uk Abstract

More information

CS411 Notes 3 Induction and Recursion

CS411 Notes 3 Induction and Recursion CS411 Notes 3 Induction and Recursion A. Demers 5 Feb 2001 These notes present inductive techniques for defining sets and subsets, for defining functions over sets, and for proving that a property holds

More information

Maximal Introspection of Agents

Maximal Introspection of Agents Electronic Notes in Theoretical Computer Science 70 No. 5 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 16 pages Maximal Introspection of Agents Thomas 1 Informatics and Mathematical Modelling

More information

Lecture Notes 1 Basic Concepts of Mathematics MATH 352

Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,

More information

Lecture 13: Soundness, Completeness and Compactness

Lecture 13: Soundness, Completeness and Compactness Discrete Mathematics (II) Spring 2017 Lecture 13: Soundness, Completeness and Compactness Lecturer: Yi Li 1 Overview In this lecture, we will prvoe the soundness and completeness of tableau proof system,

More information

A SEQUENT SYSTEM OF THE LOGIC R FOR ROSSER SENTENCES 2. Abstract

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

A Little Deductive Logic

A Little Deductive Logic A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that

More information

Intuitionistic Hybrid Logic

Intuitionistic Hybrid Logic Intuitionistic Hybrid Logic Torben Braüner a,1 Valeria de Paiva b,2 a Department of omputer Science Roskilde University P.O. Box 260 DK-4000 Roskilde, Denmark torben@ruc.dk b PAR 3333 oyote Hill Road Palo

More information

CSE 20 DISCRETE MATH. Winter

CSE 20 DISCRETE MATH. Winter CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition

More information

CSE 20 DISCRETE MATH. Fall

CSE 20 DISCRETE MATH. Fall CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Distinguish between a theorem, an axiom, lemma, a corollary, and a conjecture. Recognize direct proofs

More information

List of errors in and suggested modifications for First-Order Modal Logic Melvin Fitting and Richard L. Mendelsohn August 11, 2013

List of errors in and suggested modifications for First-Order Modal Logic Melvin Fitting and Richard L. Mendelsohn August 11, 2013 List of errors in and suggested modifications for First-Order Modal Logic Melvin Fitting and Richard L. Mendelsohn August 11, 2013 James W. Garson has answered a question we raised, in a paper that is

More information

7 RC Simulates RA. Lemma: For every RA expression E(A 1... A k ) there exists a DRC formula F with F V (F ) = {A 1,..., A k } and

7 RC Simulates RA. Lemma: For every RA expression E(A 1... A k ) there exists a DRC formula F with F V (F ) = {A 1,..., A k } and 7 RC Simulates RA. We now show that DRC (and hence TRC) is at least as expressive as RA. That is, given an RA expression E that mentions at most C, there is an equivalent DRC expression E that mentions

More information

Herbrand Theorem, Equality, and Compactness

Herbrand Theorem, Equality, and Compactness CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order

More information

LTCS Report. A finite basis for the set of EL-implications holding in a finite model

LTCS Report. A finite basis for the set of EL-implications holding in a finite model Dresden University of Technology Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report A finite basis for the set of EL-implications holding in a finite model Franz Baader, Felix

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

Today s topics. Introduction to Set Theory ( 1.6) Naïve set theory. Basic notations for sets

Today s topics. Introduction to Set Theory ( 1.6) Naïve set theory. Basic notations for sets Today s topics Introduction to Set Theory ( 1.6) Sets Definitions Operations Proving Set Identities Reading: Sections 1.6-1.7 Upcoming Functions A set is a new type of structure, representing an unordered

More information

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

Generalized Quantifiers Logical and Linguistic Aspects

Generalized Quantifiers Logical and Linguistic Aspects Generalized Quantifiers Logical and Linguistic Aspects Lecture 1: Formal Semantics and Generalized Quantifiers Dag Westerståhl University of Gothenburg SELLC 2010 Institute for Logic and Cognition, Sun

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

Syntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.

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

1 Completeness Theorem for First Order Logic

1 Completeness Theorem for First Order Logic 1 Completeness Theorem for First Order Logic There are many proofs of the Completeness Theorem for First Order Logic. We follow here a version of Henkin s proof, as presented in the Handbook of Mathematical

More information

Yanjing Wang: An epistemic logic of knowing what

Yanjing Wang: An epistemic logic of knowing what An epistemic logic of knowing what Yanjing Wang TBA workshop, Lorentz center, Aug. 18 2015 Background: beyond knowing that A logic of knowing what Conclusions Why knowledge matters (in plans and protocols)

More information