GRADES OF MODALITY L. F. COBLE
|
|
- Simon Atkinson
- 6 years ago
- Views:
Transcription
1 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 'gradualism wit h regard to modal matters wh ich Goodman suggested ([2], p. 7) and which Quine further recommended ([5], p. 67). I shall develop here a notion o f modality according to wh ich propositions can be distinguished b y degrees o r grades o f necessity or possibility. Thus it will be possible to say of two necessarily true propositions that one is more necessary than the other, o r to say, simply, that one proposition is more o r less necessary. At this time I shall o n ly be concerned wit h the formal behavior o f these modalities; I shall n o t n o w discuss possible applications o f these notions o f necessity. Accordingly, after specifying the grammar I expect these modalities to follow, I will examine them from both syntactical and semantical points of view. The calculuses proposed will be shown to be consistent and complete with respect to their suggested semantics. I will o n ly be concerned here wit h the degrees o f modality in propositional logic; I expect no n e w problems to arise when the systems a re extended t o include quantifiers th a t d o n o t arise with any quantified modal logic. 2. Since we are investigating propositional logics, it will be presumed that they are cast in a language that meets the usual conditions fo r such systems; that it contains atomic formulas, p, q, r... etc., and the truth-functional connectives, conjunction (&) and negation (-7 ), obeying the usual grammatical rules. (Other truth-functional connectives, e.g. disjunction (v) a n d material implication (D) are to be defined in terms of conjunction and negation in the familiar ways.) I n addition, it is supposed that the language contains monadic modal operators, N
2 324 L. F. GOBLE is a we ll formed formula if and o n ly if A is. These operators represent th e different degrees o f necessity; a formula, N A, should be read as saying that A is necessary to, a t least, the degree j. This should be interpreted in such a wa y that the higher the degree, the stricter the necessity. Thus, fo r example, the necessity o f A is stronger when 1 \1 just N one can define possibility operators M is equivalent to 7 N With in this basic framework one can construct various languages, each containing a diferent number of modal operators N operator. I t might be, however, that one would prefer to distinguish t wo grades o f necessity, say, lo g ica l necessity and physical necessity (assuming that if a proposition is lo g ica lly necessary then it must also be physically necessary), wit h the former being the stricter of the two. Possibly one would want to introduce a th ird and weaker so rt o f 'practical necessity, for when one says, ordinarily, o f an event that it must occur. For o th e r purposes, i t mig h t b e appropriate t o h a ve st ill a greater number of distinct degrees of necessity. It is, of course, possible t o have a language wit h denumerably ma n y modal operators; indeed, the systems I describe below will be formulated in a way to allow for this case. A language o f the kin d ju st described w i l l be called 2 2 where k is the number o f operators fo r (different degrees of) necessity in the language. 3. Given a language 2 ' interpreted as degrees o f mo d a lity in as ascending order o f strictness, i t is f a irly clear what axioms and principles o f in - ference should govern these concepts. Accordingly, we define a calculus in 2 ' A.0 a set o f axioms wh ich wit h modus ponens generates the classical propositional calculus. A.1 N A.2 1\1,(AD B) N A.3 N
3 GRADES OF MODALITY R.1 mo d u s ponens: from A and A D B, to infer B. R.2 necessitation: if 1 A, then 1 N,A, for every i, A.I is introduced to express the ranking of the modalities according to degree, the higher the degree, the stricter the necessity. The other postulates and rules are a ll fa milia r fro m the standard modal logics. Obviously, each individual modality, N by itself behave like the necessity defined b y the system T o r M o f G6del-Feys-von Wrig h t. Hence, I w i l l ca ll th is system Tk, k being the number of modal operators in the language Y Additional postulates ma y be added to define systems co r- responding to S.4 and S.5. Thus, S.4 axiom schemata: A.4 N to Tk and S.5 A N to Tk. Other systems, corresponding to other standard modal logics, ma y be defined in corresponding ways, but I shall not be concerned with them here. It might be suggested that a stronger axiom than A.2 should be postulated f o r these systems. On e mig h t propose i n it s place: A.2' N This corresponds t o th e wid e ly accepted p rin cip le th a t th e conclusion of an inference (B) is at least as sure (necessary) as the weakest o f its premisses ( A and A DB). A.2 wo u ld then follow as a special case of A.2' when i = A.2 i s, however, already derivable in Tk, g ive n A.2 and A.I. Thus, suppose that j <i, so that A.2' appears as N D N A DNB. By A.1 I NJADB) D N ( A ( a princ iple t o the effect that if a formula, A, is an ax iom, then so is N an ax iom f or ev ery i, I I n proofs of lat er theorems it w i l l often be convenient t o t hing o f t he systems formulated i n t his way, w i t h modus ponens as the sole rule of inference.
4 326 L. F. GOBLE by transitivity. Similarly, if i< j, so that A.2' is N DNB ; N is equivalent to N A D N N But, b y the same token, i f A.2 b e postulated as an axiom, not only is A.2 derivable as a special case, but A.1 is redundant, given R.2. Thus suppose that j ; N then an instance o f A.2'. Since 1 ADA, N Hence, N obtained from Tk (SAk, S.5k) b y replacing A.I and A.2 b y A.2' is equivalent to Tk (SA0 S - 4. I n another paper [ l a general semantical theory fo r the standard modal logics in the manner o f Kripke's semantics, but in such a wa y that it was n o t necessary t o assume among th e p rimitive s o f th e semantics a relation, R, of relative possibility between possible worlds. Those methods w i l l n o w be extended to provide an interpretation f o r th e different modalities N ' In [I] I suggested that we conceive a possible world, w defined by the ordered pair < P,, 13,>, where 13, is a complete and consistent set of formulas (in tu itive ly, the atomic formulas in B truths of w plete, set of formulas included in B 'fundamental postulates' governing w in P Since we n o w wish to distinguish grades o f necessity, we must distinguish grades amongst the fundamental postulates. Thus, for a world, w we should have different sets of formulas, P is 'fundamental to, at least, the degree 2'. We should then define evaluation rules f o r formulas in such a wa y that i f an atomic formula, p, belongs to P least, the degree i (i.e., N Let us put this more precisely. A normal world, w ordered set, a
5 GRADES OF MODALITY (1 s a t i s f y i n g these conditions: (i) th a t as there a re k many distinct modal operators N many sets Pi nin is a consistent set o f formulas (i.e. there is no formula in.r,, such that both it and its denial belong to Pi,,,); (iii) mo re - over, that P,,, is a complete set (i.e. f o r every formula in..rk either it o r its denial belongs to ro t); r, thus plays the role played b y 13, in the account o f [ l and pi, in :T included in 1 ) Given this notion of a 'possible wo rld i t is n o w possible to define models b y which formulas can be evaluated. A s in i l l let a model, t, be a pair <wo, W >, where W is a set o f worlds as defined above and wo e W. For each model, (t. = <WO, W >, let the evaluation function, (N, wh ich maps pairs o f formulas, A, a n d possible worlds, w t o tru th values, b e defined a s follows: (a) I f A is an atomic formula, cp, (A, w A ei)% Suppose than qi i s defined f o r formulas B and C and a ll worlds w, in W. (b) ((AB & C, w,) = T i f a n d o n ly i f %(B, w,) = T a n d cp, (C, w (c)cp,(---713, w,) = T if and only if cp,(b, w To determine truth values fo r necessitative formulas, NB, we define relations between the possible wo rld s in W, different relations being used in the evaluation o f different modalities. Following the pattern o f [1], l e t u s define relations W follows: w, Ri We ca n then g ive a comprehensive definition o f (p formulas of the sort N (d) cp,(n in W such that w, Ri
6 328 L. F. GOBLE The clause (d) above defines a T-ish necessity, as w i l l be shown; notice that a ll the relations W necessarily transitive or symmetric. If an S.4 necessity is to be obtained, relations Ri which are transitive as we ll as reflexive must be defined. For an S.5 necessity relations which are symmetric, transitive and reflexive are required. These conditions a r e m e t b y R W, m r if and only if Pi, P i, for every j such that i j 1 k. w i- P (Notice that the Ri in the R i should be modified b y replacing 'Ri and 'Ri cases as one, letting 'cp' and correlatively ' N except as otherwise mentioned. Th e definitions o f ' Ri 103' m a y seem u n d u ly complex. Ho we ve r, i t i s necessary to introduce talk of the sets Pi to insure the va lid ity of A.1 as well as A.4 and A.5. Notice that the analogous condition fo r RI every i s already met since Pi cr,(a, w go on to say that A is true on 1.t(=<w since wo is supposed to be the actual world (for 14 Finally let us say that A is va lid if and only if A is true on every model pt. These formulations a re ambiguous, depending o n wh ich re lations RI are used in clause (d) o f the definition o f (p. To be accurate, we should speak of a formula's being T valid, o r S. 5 R 5. We are n o w in a position t o establish consistency and completeness theorems f o r the calculuses defined in section 3 relative to the semantics just given. Theorem 1. I f A i s provable i n Tk (SAk, S 5k), th e n A i s Tk (S.4 I leave the proof of this to the reader; it is easily shown that
7 GRADES OF MODALITY all the axioms are valid and that the rules preserve this property. Theorem 2. If A is Tk (S.4 T k ( S A " S. 5 This ma y be established along the lines given in [1] utilizing a Henkin-type argument. W e observe f irst t h a t some quite general results hold for these systems: Lemma Ï. I f X is any system containing the classical propositional calculus, and i f 7A is n o t provable in X, then the system X obtained from X by the addition of A as an axiom is consistent (i.e there is no formula B such that both B and 7B are provable in X'). Lemma 2. If X is any consistent system containing Tk (S.4k, S.5 consistent extension of X in which A is not provable. We can now show that any non-theorem of these systems is falsifiable, which gives us Theorem 2. Let K be a n y consistent extension of Tk (S.4k, S 5k) in which both R.1 and R.2 are admissible, and le t L, M, N, e t c. be complete and consistent extensions o f K (lemma 2). Fo r a n y such syste m M, le t th e wo rld determined b y M, w < I n provable in M, and each P i such that 1 m M is consistent, and To will be one set P i moreover, if i j, then P each w of section 4. Let us speak of a model determined by K,! I pair < w complete and consistent extensions o f K, and w determined by L, any complete and consistent extension o f K. Given IL
8 330 L. F. GOBLE Lemma 3. For all w Proof is by induction on B. (a) If B is an atomic formula, then m tion that the lemma holds for formulas C and D. (b) I f B = C&D, M T (inductive hypothesis) i f f cp, sistency of M), so c r hence, cr, wm) = T, then (r,,, (c, wm) T, so n o t H m then H 3 1 Let N be any complete and consistent extension of K such that w SO Crp,K W N ) = T inductive hypothesis). Hence, t r T. Suppose that (NI( (NC, w the system all of whose axioms are the formulas, A, such that H m N a consistent extension of K, for if H KA, H b ility of R.2 in K, so H and consistent extension, NI*, in which C is not provable (lemma 2). w then P i Ri A 1 ) i H H so, th e n H m Now, given that q),,, wo rld w T. But b y the inductive hypothesis, this implies that 1 contrary t o th e specification o f N. Consequently, w e mu st conclude that H Theorem 2 n o w follows immediately. For, i f a formula, A, is not provable in Tk (S.4k, So5k), there is a system L such that L is a complete and consistent extension o f Tk (So4k, S.5k) and
9 GRADES OF MODALITY A is not provable in L (lemma 2). Let the model la be < w where W is the set of all worlds determined b y complete and consistent extensions o f Tk (S.4k, S.5k) a n d w determined b y the aforementioned L. B y lemma 3, (pp, (A, wl) T if f 1 - falsified by this [t. Therefore, if A is Tk (S.4k, S. 5 be provable in T 6. Thus far we have constructed equivalent syntactical and semantical frameworks in which true propositions can be distinguished according t o th e degrees o f th e ir necessity. W e could say that A is more necessary than B if A's greatest degree of necessity is greater than the greatest necessity o f B. Th a t is to say, A is more necessary than B when N A and N true and i j and there is no m such that m i and N true. Nevertheless, n o t a ll (true) propositions belong t o th e spectrum of necessity. There remains a gulf between those propositions wh ich a necessary to some degree, and those tru e but contingent propositions wh ich are in no wise necessary. It wo u ld be desirable to arrange a ll (true) propositions along a single continuum of degrees of necessity. Along these lines it would seen natural to introduce into the language of these systems another operator, No, wh ich should satisfy the principle.a.3' A N o A. This postulate wo u ld replace A.3 in Tk (S Lik, S 5k), it s being understood that a ll the other postulates o f the system wo u ld now apply to No as we ll as the other operators fo r necessity. Since N0A would be equivalent to A, we could then say that any true proposition was necessary to, a t least, the degree O. This is not to say very much, to be sure; it does not commit one to saying that contingent propositions a re necessary in a n y orthodox sense, but it does allow one to locate them with in the spectrum of modality. From the semantical point o f vie w presented in section 4, one would like to introduce a relation, W Wm R
10 332 L. F. GOBLE (similarly fo r re form N This w i l l not do, however. The a xio m A.3 i s not va lid b y this account. Those instances o f A.3' in wh ich A contains no well formed parts of the form N N the fo rmu la N (wo, w Pl show that (f ( N T and w this 1.1), b u t cp,, ( N T as W A.3' falls in cases like this because distinct worlds w, and w differ i n some fundamental postulates, P 'truth operator' says, in effect, wh e n evaluating formulas N in w, look at A only in the world w,. IV as given above does not n a rro w one's visio n enough; i t allows one to shift one's view to some other w. Accordingly, le t us instead stipulate that w, w if and only if w A.3' is va lid on this account, as are a ll the other axioms fo r N. The proof o f semantic completeness is unaffected b y this addition to the semantics for TL. Thus in the proof of lemma 3, case (d) (2nd part) in wh ich B might have the fo rm NoC, we observe that for the systems M, N, and N* described, if C P i, (i?-0), then 1 m and 1 i?-0. Similarly, P It is unfortunate that in the semantics fo r Tk as enriched b y N be defined significantly d iffe re n tly than th e o th e r relations Perhaps one would expect this, however, as one notices that in Tk N And there's A.3' itself. R. must also be given special handling in the semantics for SA R
11 GRADES OF MODALITY For S.5 the relations Ri other relations: 7. A t the opening of this paper I suggested that the account of modalities given here might have some application to the modal 'gradualism o f Goodman, Qu in e and others. I should now like to caution that suggestion somewhat. I believe some progress has been made here in developing the idea of a spectrum of modal degrees; we can explicate how one proposition, p, is more necessary than another, q, in terms o f p's possessing a higher degree of necessity than q. Moreover, one could say simp ly that a proposition, p, is mo re o r less necessary according as the degree of necessity on p is more o r less high. Nevertheless, I doubt that the critics of modal logic would find these notions much more congenial than they found the more fa milia r ideas o f (absolute) necessity and its correlative, analyticity. For arguments simila r to those wrought against strict necessity and analyticity might be turned against the present graded modalities. Thus, it might be argued against the absolute necessity as formalized b y the fa milia r modal logics, th a t no clear sense can be made of this concept since there are no useful criteria which unequivocally locate propositions some as 'fundamental postulates' and so as necessary, others as true but contigent (as described in [1]). This problem need not arise with in the present framework. A ll that is required is that one be able to say of a proposition, p, that it is more fundamental than another, q, or that p is more central to one's conceptual framework than q. p should then be located in a set Pi and q in Pi where i j. It does n o t matter if this grants some degree o f necessity to statements like 'there have been black dogs' as well as to those like '2 + 2 = 4', though one wo u ld expect i t t o be a lesser degree. Some sort of relative centrality of propositions in conceptual frameworks d o e s b e lo n g w i t h i n t h e p ict u re sketched b y Quine in, e.g. [41. Nevertheless, it is not clear that the behavioral crit e ria wh ich Qu in e wo u ld a llo w t o determine h o w
12 334 L. F. GOBLE central o r h o w fundamental a statement is, wo u ld define the linear order among classes o f statements which is required by the present semantical account. I f not, th e n th e th e o ry o f grades o f modality proposed here wo u ld not provide a true explication of that sort of gradualism. University of Wisconsin L. F. GOBLE REFERENCES [ ] GOBLE, L. F., " A Simplified Semantics f o r Modal Logic," forthc oming. [2] GOODMAN, N., "O n Likeness of Meaning," Analy s is, 10 (1949), pp [3] QUINE, W. V. O., "Three Grades o f Modal Inv olv ement," i n Th e Way s of Paradox, New York, 1966, pp [4] QUINE, W. V. O., " Two Dogmas of Empiric is m," in From a Logic al Point of View, New York, 1961, pp [5] QUINE, W. V. O., Word and Object, Cambridge, Mass., 1960.
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 informationTR : Binding Modalities
City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2012 TR-2012011: Binding Modalities Sergei N. Artemov Tatiana Yavorskaya (Sidon) Follow this and
More informationPropositional Logic: Syntax
4 Propositional Logic: Syntax Reading: Metalogic Part II, 22-26 Contents 4.1 The System PS: Syntax....................... 49 4.1.1 Axioms and Rules of Inference................ 49 4.1.2 Definitions.................................
More informationRelational 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 informationPREFERENCE SEMANTICS FOR DEONTIC LOGIC PART I SIMPLE MODELS LOU GOBLE
Logique & Analyse 183 184 (2003), 383 418 PREFERENCE SEMANTICS FOR DEONTIC LOGIC PART I SIMPLE MODELS LOU GOBLE Abstract This paper presents determination results for some deontic logics with respect to
More informationDraft 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 informationLogic 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 informationApplied 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 informationADMISSIBILITY OF ACKERMANN S RULE δ IN RELEVANT LOGICS
Logic and Logical Philosophy Volume 22 (2013), 411 427 DOI: 10.12775/LLP.2013.018 Gemma Robles ADMISSIBILITY OF ACKERMANN S RULE δ IN RELEVANT LOGICS Abstract. It is proved that Ackermann s rule δ is admissible
More informationProving 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 informationMarie Duží
Marie Duží marie.duzi@vsb.cz 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: 1. a language 2. a set of axioms 3. a set of deduction rules ad 1. The definition of a language
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationIntelligent Systems. Propositional Logic. Dieter Fensel and Dumitru Roman. Copyright 2008 STI INNSBRUCK
Intelligent Systems Propositional Logic Dieter Fensel and Dumitru Roman www.sti-innsbruck.at Copyright 2008 STI INNSBRUCK www.sti-innsbruck.at Where are we? # Title 1 Introduction 2 Propositional Logic
More informationBETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR
Bulletin of the Section of Logic Volume 38:3/4 (2009), pp. 123 133 Kordula Świȩtorzecka BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR Abstract In the presented text we shall focus on some specific
More informationCOMPLETENESS O F SOME QUANTIFIED MO DA L LOGICS. James W. GARSON
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
More informationOn the Complexity of the Reflected Logic of Proofs
On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,
More informationModal and temporal logic
Modal and temporal logic N. Bezhanishvili I. Hodkinson C. Kupke Imperial College London 1 / 83 Overview Part II 1 Soundness and completeness. Canonical models. 3 lectures. 2 Finite model property. Filtrations.
More informationExpressive Power, Mood, and Actuality
Expressive Power, Mood, and Actuality Rohan French Abstract In Wehmeier (2004) we are presented with the subjunctive modal language, a way of dealing with the expressive inadequacy of modal logic by marking
More informationArtificial Intelligence. Propositional Logic. Copyright 2011 Dieter Fensel and Florian Fischer
Artificial Intelligence Propositional Logic Copyright 2011 Dieter Fensel and Florian Fischer 1 Where are we? # Title 1 Introduction 2 Propositional Logic 3 Predicate Logic 4 Reasoning 5 Search Methods
More informationModule 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 informationPřednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1
Přednáška 12 Důkazové kalkuly Kalkul Hilbertova typu 11/29/2006 Hilbertův kalkul 1 Formal systems, Proof calculi A proof calculus (of a theory) is given by: A. a language B. a set of axioms C. a set of
More informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More informationFirst-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 informationChapter 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 informationTHE ITE RA TION O F DE O NTI C MO DA L I TI E S L. F. GOBLE
THE ITE RA TION O F DE O NTI C MO DA L I TI E S L. F. GOBLE In contrast to investigations in alethic modal logic, in the construction of systems of deontic logic little attention has been paid to the iteration
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationPropositional Logic Truth-functionality Definitions Soundness Completeness Inferences. Modal Logic. Daniel Bonevac.
January 22, 2013 Modal logic is, among other things, the logic of possibility and necessity. Its history goes back at least to Aristotle s discussion of modal syllogisms in the Prior Analytics. But modern
More informationA 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 informationSystems 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 informationDisplay calculi in non-classical logics
Display calculi in non-classical logics Revantha Ramanayake Vienna University of Technology (TU Wien) Prague seminar of substructural logics March 28 29, 2014 Revantha Ramanayake (TU Wien) Display calculi
More informationS4LP 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 informationKRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
More informationProof-theoretic semantics, self-contradiction and the format of deductive reasoning
St. Andrews, 19.11.2011 p. 1 To appear as an article in: L. Tranchini (ed.), Anti-Realistic Notions of Truth, Special issue of Topoi vol. 31 no. 1, 2012 Proof-theoretic semantics, self-contradiction and
More informationThe 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 informationModal Sentential Logic I
Modal Sentential Logic I G J Mattey July 20, 2001 1 Syntax of MSL Modal Sentential Logic (MSL) is a formal language which is an extension of Sentential Logic (SL) All expressions of SL are expressions
More informationCompleteness 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 informationEach 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 informationChapter 2. Assertions. An Introduction to Separation Logic c 2011 John C. Reynolds February 3, 2011
Chapter 2 An Introduction to Separation Logic c 2011 John C. Reynolds February 3, 2011 Assertions In this chapter, we give a more detailed exposition of the assertions of separation logic: their meaning,
More information4 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 informationTR : 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 informationClassical 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 informationGeneral methods in proof theory for modal logic - Lecture 1
General methods in proof theory for modal logic - Lecture 1 Björn Lellmann and Revantha Ramanayake TU Wien Tutorial co-located with TABLEAUX 2017, FroCoS 2017 and ITP 2017 September 24, 2017. Brasilia.
More informationChapter 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 informationDe 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 informationGlossary of Logical Terms
Math 304 Spring 2007 Glossary of Logical Terms The following glossary briefly describes some of the major technical logical terms used in this course. The glossary should be read through at the beginning
More informationPart II On the Equivalence of Scientific Theories
Published in Philosophy of Science, 1960, 27, 359 365. Studies in the Empiricist Theory of Scientific Meaning Part II On the Equivalence of Scientific Theories Abstract Drawing upon the Carnapian explication
More informationNONSTANDARD 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 informationMeaning 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 informationOn relational interpretation of multi-modal categorial logics
Gerhard Jäger 1 On relational interpretation of multi-modal categorial logics Gerhard Jäger Gerhard.Jaeger@let.uu.nl Utrecht Institute of Linguistics (OTS) September 27, 2001 Gerhard Jäger 2 1 Outline
More informationTHE SEMANTICS OF MINIMA L INTUITIONISM G.N. GEORGACARAKOS. Introduction
THE SEMANTICS OF MINIMA L INTUITIONISM G.N. GEORGACARAKOS Introduction There has existed some controversy in the history o f intuitionism concerning the tenth axiom o f Heyting's famous formalization o
More informationMathematics 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 informationNeale and the slingshot Fabrice Correia
a Neale and the slingshot Fabrice Correia 'Slingshot arguments' is a label for a class of arguments which includes Church's argument to the effect that if sentences designate propositions, then there are
More informationResults as of 30 September 2018
rt Results as of 30 September 2018 F r e e t r a n s l a t ion f r o m t h e o r ig ina l in S p a n is h. I n t h e e v e n t o f d i s c r e p a n c y, t h e Sp a n i s h - la n g u a g e v e r s ion
More information22c:145 Artificial Intelligence
22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not
More informationHypersequent 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 informationDeontic Logic and Meta-Ethics
Deontic Logic and Meta-Ethics Deontic Logic as been a field in which quite apart from the questions of antinomies "paradoxes" have played a decisive roles, since the field has been invented. These paradoxes
More informationThe Logical Contingency of Identity Hanoch Ben-Yami
The Logical Contingency of Identity Hanoch Ben-Yami ABSTRACT. I show that intuitive and logical considerations do not justify introducing Leibniz s Law of the Indiscernibility of Identicals in more than
More informationA 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 informationA SEQUENT SYSTEM OF THE LOGIC R FOR ROSSER SENTENCES 2. Abstract
Bulletin of the Section of Logic Volume 33/1 (2004), pp. 11 21 Katsumi Sasaki 1 Shigeo Ohama A SEQUENT SYSTEM OF THE LOGIC R FOR ROSSER SENTENCES 2 Abstract To discuss Rosser sentences, Guaspari and Solovay
More informationLEGAL 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 informationProof 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 informationWilliamson 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 informationPropositional Logic Arguments (5A) Young W. Lim 11/8/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationFoundations of Mathematics MATH 220 FALL 2017 Lecture Notes
Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes These notes form a brief summary of what has been covered during the lectures. All the definitions must be memorized and understood. Statements
More information09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor
Martin Henz and Aquinas Hobor October 14, 2010 Generated on Thursday 14 th October, 2010, 11:40 1 Review of Modal Logic 2 3 4 Motivation Syntax and Semantics Valid Formulas wrt Modalities Correspondence
More informationREL EVANT DERIVABIL ITY A ND CLASSICAL DERIVABILITY IN FITCH-STYLE AND AXIOMATIC FORMULATIONS OF RELEVANT LOGICS
REL EVANT DERIVABIL ITY A ND CLASSICAL DERIVABILITY IN FITCH-STYLE AND AXIOMATIC FORMULATIONS OF RELEVANT LOGICS Diderik BATENS and Jean Paul VAN BENDEGEM I. I t is well-known that Alan Ross Anderson and
More informationTHE LOGICAL CONTINGENCY OF IDENTITY. HANOCH BEN-YAMI Central European University ABSTRACT
EuJAP Vol. 14, No. 2, 2018 1 LEIBNIZ, G. W. 161.2 THE LOGICAL CONTINGENCY OF IDENTITY HANOCH BEN-YAMI Central European University Original scientific article Received: 23/03/2018 Accepted: 04/07/2018 ABSTRACT
More informationTutorial Exercises 1 (mjs)
499 Modal and Temporal Logic Autumn 2008 Tutorial Exercises 1 (mjs) 1. Suppose that Σ is closed under RM. SOLUTIONS Suppose first that Σ contains C. A derivation of K: 1. Σ (A (A B) ) B PL 2. Σ (A (A B)
More informationNotes on Quantum Logic
Notes on Quantum Logic Version 1.0 David B. Malament Department of Logic and Philosophy of Science University of California, Irvine dmalamen@uci.edu Contents 1 Formal (sentential) quantum logic 2 2 The
More informationThe Modal Logic of Pure Provability
The Modal Logic of Pure Provability Samuel R. Buss Department of Mathematics University of California, San Diego July 11, 2002 Abstract We introduce a propositional modal logic PP of pure provability in
More informationLecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem
Lecture 11: Gödel s Second Incompleteness Theorem, and Tarski s Theorem Valentine Kabanets October 27, 2016 1 Gödel s Second Incompleteness Theorem 1.1 Consistency We say that a proof system P is consistent
More informationEquivalents of Mingle and Positive Paradox
Eric Schechter Equivalents of Mingle and Positive Paradox Abstract. Relevant logic is a proper subset of classical logic. It does not include among itstheoremsanyof positive paradox A (B A) mingle A (A
More informationModal Logic XX. Yanjing Wang
Modal Logic XX Yanjing Wang Department of Philosophy, Peking University May 6th, 2016 Advanced Modal Logic (2016 Spring) 1 Completeness A traditional view of Logic A logic Λ is a collection of formulas
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationIntroduction 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 informationFormal 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 informationSOCRATES DID IT BEFORE GÖDEL
Logic and Logical Philosophy Volume 20 (2011), 205 214 DOI: 10.12775/LLP.2011.011 Josef Wolfgang Degen SOCRATES DID IT BEFORE GÖDEL Abstract. We translate Socrates famous saying I know that I know nothing
More informationTR : 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 informationPartial Collapses of the Σ 1 Complexity Hierarchy in Models for Fragments of Bounded Arithmetic
Partial Collapses of the Σ 1 Complexity Hierarchy in Models for Fragments of Bounded Arithmetic Zofia Adamowicz Institute of Mathematics, Polish Academy of Sciences Śniadeckich 8, 00-950 Warszawa, Poland
More informationA REGULAR SEQUENT CALCULUS FOR QUANTUM LOGIC IN WHICH A AND v ARE DUAL N.J. CUTLAND GIBBINS
A REGULAR SEQUENT CALCULUS FOR QUANTUM LOGIC IN WHICH A AND v ARE DUAL N.J. CUTLAND GIBBINS Introduction In the paper[ Nishimura (1980)1 the author develops sequent calculi GO and GOM f o r orthologic
More informationLogic, Human Logic, and Propositional Logic. Human Logic. Fragments of Information. Conclusions. Foundations of Semantics LING 130 James Pustejovsky
Logic, Human Logic, and Propositional Logic Foundations of Semantics LING 3 James Pustejovsky Human Logic Thanks to Michael Genesereth of Stanford for use of some slides Fragments of Information Conclusions
More informationFormal (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 informationEpistemic Modals and Informational Consequence
Epistemic Modals and Informational Consequence [This is a penultimate draft. Please quote only from the published version. The paper is already available through Online First at http://www.springerlink.com/content/0039-7857]
More informationMaximal 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 informationInfinite Truth-Functional Logic
28 Notre Dame Journal of Formal Logic Volume 29, Number 1, Winter 1988 Infinite Truth-Functional Logic THEODORE HAILPERIN What we cannot speak about [in K o or fewer propositions] we must pass over in
More informationOverview 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 informationInducing syntactic cut-elimination for indexed nested sequents
Inducing syntactic cut-elimination for indexed nested sequents Revantha Ramanayake Technische Universität Wien (Austria) IJCAR 2016 June 28, 2016 Revantha Ramanayake (TU Wien) Inducing syntactic cut-elimination
More informationLanguage of Propositional Logic
Logic A logic has: 1. An alphabet that contains all the symbols of the language of the logic. 2. A syntax giving the rules that define the well formed expressions of the language of the logic (often called
More informationPropositional 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 informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
More informationChapter 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 informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationPropositional Logic Arguments (5A) Young W. Lim 11/29/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationKazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R +
REPORTS ON MATHEMATICAL LOGIC 40 (2006), 3 13 Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R + A b s t r a c t. In this paper it is proved that the interval
More informationPropositional 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 informationExogenous Semantics Approach to Enriching Logics
Exogenous Semantics Approach to Enriching Logics Paulo Mateus, Amílcar Sernadas, and Cristina Sernadas Abstract. The exogenous semantics approach to enriching a logic consists in defining each model in
More informationReferences A CONSTRUCTIVE INTRODUCTION TO FIRST ORDER LOGIC. The Starting Point. Goals of foundational programmes for logic:
A CONSTRUCTIVE INTRODUCTION TO FIRST ORDER LOGIC Goals of foundational programmes for logic: Supply an operational semantic basis for extant logic calculi (ex post) Rational reconstruction of the practice
More informationLING 501, Fall 2004: Laws of logic and the definitions of the connectives
LING 501, Fall 2004: Laws of logic and the definitions of the connectives Modified October 24, adding a test yourself section at the end. Modified October 21, correcting errors noted in class on October
More informationAN INTRODUCTION TO SEPARATION LOGIC. 2. Assertions
AN INTRODUCTION TO SEPARATION LOGIC 2. Assertions John C. Reynolds Carnegie Mellon University January 7, 2011 c 2011 John C. Reynolds Pure Assertions An assertion p is pure iff, for all stores s and all
More information