DOCSLIB.ORG

Boxes and Diamonds: an Open Introduction to Modal Logic

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Boxes and Diamonds: an Open Introduction to Modal Logic Boxes and Diamonds An Open Introduction to Modal Logic F19 Boxes and Diamonds The Open Logic Project Instigator Richard Zach, University of Calgary Editorial Board Aldo Antonelli,y University of California, Davis Andrew Arana, Université de Lorraine Jeremy Avigad, Carnegie Mellon University Tim Button, University College London Walter Dean, University of Warwick Gillian Russell, Dianoia Institute of Philosophy Nicole Wyatt, University of Calgary Audrey Yap, University of Victoria Contributors Samara Burns, Columbia University Dana Hägg, University of Calgary Zesen Qian, Carnegie Mellon University Boxes and Diamonds An Open Introduction to Modal Logic Remixed by Richard Zach Fall 2019 The Open Logic Project would like to acknowledge the gener- ous support of the Taylor Institute of Teaching and Learning of the University of Calgary, and the Alberta Open Educational Re- sources (ABOER) Initiative, which is made possible through an investment from the Alberta government. Cover illustrations by Matthew Leadbeater, used under a Cre- ative Commons Attribution-NonCommercial 4.0 International Li- cense. Typeset in Baskervald X and Nimbus Sans by LATEX. This version of Boxes and Diamonds is revision ed40131 (2021-07- 11), with content generated from Open Logic Text revision a36bf42 (2021-09-21). Free download at: https://bd.openlogicproject.org/ Boxes and Diamonds by Richard Zach is licensed under a Creative Commons At- tribution 4.0 International License. It is based on The Open Logic Text by the Open Logic Project, used under a Cre- ative Commons Attribution 4.0 Interna- tional License. Contents Preface xi Introduction xii I Normal Modal Logics1 1 Syntax and Semantics2 1.1 Introduction..................... 2 1.2 The Language of Basic Modal Logic....... 4 1.3 Simultaneous Substitution............. 5 1.4 Relational Models.................. 7 1.5 Truth at a World .................. 8 1.6 Truth in a Model .................. 10 1.7 Validity........................ 10 1.8 Tautological Instances ............... 11 1.9 Schemas and Validity................ 14 1.10 Entailment...................... 16 Problems .......................... 18 2 Frame Definability 21 2.1 Introduction..................... 21 2.2 Properties of Accessibility Relations . 22 2.3 Frames........................ 25 2.4 Frame Definability ................. 26 v CONTENTS vi 2.5 First-order Definability............... 29 2.6 Equivalence Relations and S5 . 30 2.7 Second-order Definability ............. 33 Problems .......................... 36 3 Axiomatic Derivations 38 3.1 Introduction..................... 38 3.2 Normal Modal Logics ............... 40 3.3 Derivations and Modal Systems.......... 42 3.4 Proofs in K ..................... 44 3.5 Derived Rules.................... 46 3.6 More Proofs in K . 49 3.7 Dual Formulas.................... 50 3.8 Proofs in Modal Systems.............. 51 3.9 Soundness...................... 53 3.10 Showing Systems are Distinct ........... 54 3.11 Derivability from a Set of Formulas . 56 3.12 Properties of Derivability.............. 56 3.13 Consistency..................... 57 Problems .......................... 58 4 Completeness and Canonical Models 60 4.1 Introduction..................... 60 4.2 Complete O -Consistent Sets............ 62 4.3 Lindenbaum’s Lemma ............... 63 4.4 Modalities and Complete Consistent Sets . 65 4.5 Canonical Models.................. 68 4.6 The Truth Lemma ................. 68 4.7 Determination and Completeness for K . 69 4.8 Frame Completeness................ 70 Problems .......................... 74 5 Filtrations and Decidability 75 5.1 Introduction..................... 75 5.2 Preliminaries .................... 78 5.3 Filtrations...................... 79 CONTENTS vii 5.4 Examples of Filtrations............... 82 5.5 Filtrations are Finite ................ 84 5.6 K and S5 have the Finite Model Property . 85 5.7 S5 is Decidable................... 86 5.8 Filtrations and Properties of Accessibility . 87 5.9 Filtrations of Euclidean Models.......... 89 Problems .......................... 91 6 Modal Tableaux 93 6.1 Introduction..................... 93 6.2 Rules for K ..................... 94 6.3 Tableaux for K ................... 97 6.4 Soundness for K . 98 6.5 Rules for Other Accessibility Relations . 102 6.6 Soundness for Additional Rules . 103 6.7 Simple Tableaux for S5 . 106 6.8 Completeness for K . 107 6.9 Countermodels from Tableaux . 110 Problems ..........................113 II Intuitionistic Logic 115 7 Introduction 116 7.1 Constructive Reasoning . 116 7.2 Syntax of Intuitionistic Logic . 118 7.3 The Brouwer-Heyting-Kolmogorov Interpretation 119 7.4 Natural Deduction . 123 7.5 Axiomatic Derivations . 126 Problems ..........................128 8 Semantics 129 8.1 Introduction.....................129 8.2 Relational models..................130 8.3 Semantic Notions..................132 8.4 Topological Semantics . 133 CONTENTS viii Problems ..........................135 9 Soundness and Completeness 136 9.1 Soundness of Axiomatic Derivations . 136 9.2 Soundness of Natural Deduction . 137 9.3 Lindenbaum’s Lemma . 139 9.4 The Canonical Model . 141 9.5 The Truth Lemma . 142 9.6 The Completeness Theorem . 144 9.7 Decidability.....................144 Problems ..........................145 III Counterfactuals 146 10 Introduction 147 10.1 The Material Conditional . 147 10.2 Paradoxes of the Material Conditional . 149 10.3 The Strict Conditional . 150 10.4 Counterfactuals...................152 Problems ..........................153 11 Minimal Change Semantics 155 11.1 Introduction.....................155 11.2 Sphere Models....................157 11.3 Truth and Falsity of Counterfactuals . 159 11.4 Antecedent Strengthenng . 160 11.5 Transitivity .....................162 11.6 Contraposition ...................164 Problems ..........................164 IV Appendices 166 A Sets 167 A.1 Extensionality....................167 A.2 Subsets and Power Sets . 169 CONTENTS ix A.3 Some Important Sets . 170 A.4 Unions and Intersections . 172 A.5 Pairs, Tuples, Cartesian Products . 175 A.6 Russell’s Paradox..................177 Problems ..........................179 B Relations 180 B.1 Relations as Sets ..................180 B.2 Special Properties of Relations . 182 B.3 Equivalence Relations . 184 B.4 Orders........................185 B.5 Graphs........................188 B.6 Operations on Relations . 190 Problems ..........................191 C Syntax and Semantics 192 C.1 Introduction.....................192 C.2 Propositional Formulas . 194 C.3 Preliminaries ....................196 C.4 Valuations and Satisfaction . 198 C.5 Semantic Notions..................200 Problems ..........................201 D Axiomatic Derivations 202 D.1 Introduction.....................202 D.2 Axiomatic Derivations . 204 D.3 Rules and Derivations . 206 D.4 Axiom and Rules for the Propositional Connectives208 D.5 Examples of Derivations . 209 D.6 Proof-Theoretic Notions . 211 D.7 The Deduction Theorem . 213 D.8 Derivability and Consistency . 215 D.9 Derivability and the Propositional Connectives . 216 D.10 Soundness......................218 Problems ..........................219 CONTENTS x E Tableaux 220 E.1 Tableaux.......................220 E.2 Rules and Tableaux . 222 E.3 Propositional Rules . 223 E.4 Tableaux.......................224 E.5 Examples of Tableaux . 225 E.6 Proof-Theoretic Notions . 230 E.7 Derivability and Consistency . 233 E.8 Derivability and the Propositional Connectives . 235 E.9 Soundness......................238 Problems ..........................242 F The Completeness Theorem 243 F.1 Introduction.....................243 F.2 Outline of the Proof . 245 F.3 Complete Consistent Sets of Sentences . 246 F.4 Lindenbaum’s Lemma . 248 F.5 Construction of a Model . 249 F.6 The Completeness Theorem . 250 Problems ..........................251 About the Open Logic Project 252 Preface This is an introductory textbook on modal logic. I use it as the main text when I teach Philosophy 579.2 (Modal Logic) at the University of Calgary. It is based on material from the Open Logic Project. The main text assumes familiarity with some elementary set theory and the basics of (propositional) logic. This material is part of a prerequisite for my course, Logic II. The textbook for that course, Sets, Logic, Computation, is also based on the OLP, and so is available for free. The required material is included as appendices in this book, however. I assign these appendices for background reading whenever I teach the material. Part I is originally based in part on Aldo Antonelli’s lec- ture notes on “Classical Correspondence Theory for Basic Modal Logic,” which he contributed to the OLP before his untimely death in 2015. I heavily revised and expanded these notes, e.g., the material on frame definability and tableaux is new. xi Introduction Modal logics are extensions of classical logic by the operators □ (“box”) and ^ (“diamond”), which attach to formulas. Intu- itively, □ may be read as “necessarily” and ^ as “possibly,” so □p is “p is necessarily true” and ^p is “p is possibly true.” As necessity and possibility are fundamental metaphysical notions, modal logic is obviously of great philosophical interest. It allows the formalization of metaphysical principles such as “□p ! p” (if p is necessary, it is true) or “^p ! □^p” (if p is possible, it is necessarily possible). The operators □ and ^ are intensional. This means that whether □A or ^A holds does not just depend on whether A holds or doesn’t. An operator which is not intensional is extensional. Negation
Load more

Recommended publications
  • The Modal Logic of Potential Infinity, with an Application to Free Choice
    The Modal Logic of Potential Infinity, With an Application to Free Choice Sequences Dissertation Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of The Ohio State University By Ethan Brauer, B.A. ∼6 6 Graduate Program in Philosophy The Ohio State University 2020 Dissertation Committee: Professor Stewart Shapiro, Co-adviser Professor Neil Tennant, Co-adviser Professor Chris Miller Professor Chris Pincock c Ethan Brauer, 2020 Abstract This dissertation is a study of potential infinity in mathematics and its contrast with actual infinity. Roughly, an actual infinity is a completed infinite totality. By contrast, a collection is potentially infinite when it is possible to expand it beyond any finite limit, despite not being a completed, actual infinite totality. The concept of potential infinity thus involves a notion of possibility. On this basis, recent progress has been made in giving an account of potential infinity using the resources of modal logic. Part I of this dissertation studies what the right modal logic is for reasoning about potential infinity. I begin Part I by rehearsing an argument|which is due to Linnebo and which I partially endorse|that the right modal logic is S4.2. Under this assumption, Linnebo has shown that a natural translation of non-modal first-order logic into modal first- order logic is sound and faithful. I argue that for the philosophical purposes at stake, the modal logic in question should be free and extend Linnebo's result to this setting. I then identify a limitation to the argument for S4.2 being the right modal logic for potential infinity.
    [Show full text]
  • DRAFT: Final Version in Journal of Philosophical Logic Paul Hovda
    Tensed mereology DRAFT: final version in Journal of Philosophical Logic Paul Hovda There are at least three main approaches to thinking about the way parthood logically interacts with time. Roughly: the eternalist perdurantist approach, on which the primary parthood relation is eternal and two-placed, and objects that persist persist by having temporal parts; the parameterist approach, on which the primary parthood relation is eternal and logically three-placed (x is part of y at t) and objects may or may not have temporal parts; and the tensed approach, on which the primary parthood relation is two-placed but (in many cases) temporary, in the sense that it may be that x is part of y, though x was not part of y. (These characterizations are brief; too brief, in fact, as our discussion will eventually show.) Orthogonally, there are different approaches to questions like Peter van Inwa- gen's \Special Composition Question" (SCQ): under what conditions do some objects compose something?1 (Let us, for the moment, work with an undefined notion of \compose;" we will get more precise later.) One central divide is be- tween those who answer the SCQ with \Under any conditions!" and those who disagree. In general, we can distinguish \plenitudinous" conceptions of compo- sition, that accept this answer, from \sparse" conceptions, that do not. (van Inwagen uses the term \universalist" where we use \plenitudinous.") A question closely related to the SCQ is: under what conditions do some objects compose more than one thing? We may distinguish “flat” conceptions of composition, on which the answer is \Under no conditions!" from others.
    [Show full text]
  • Branching Time
    24.244 Modal Logic, Fall 2009 Prof. Robert Stalnaker Lecture Notes 16: Branching Time Ordinary tense logic is a 'multi-modal logic', in which there are two (pairs of) modal operators: P/H and F/G. In the semantics, the accessibility relations, for past and future tenses, are interdefinable, so in effect there is only one accessibility relation in the semantics. However, P/H cannot be defined in terms of F/G. The expressive power of the language does not match the semantics in this case. But this is just a minimal multi-modal theory. The frame is a pair consisting of an accessibility relation and a set of points, representing moments of time. The two modal operators are defined on this one set. In the branching time theory, we have two different W's, in a way. We put together the basic tense logic, where the points are moments of time, with the modal logic, where they are possible worlds. But they're not independent of one another. In particular, unlike abstract modal semantics, where possible worlds are primitives, the possible worlds in the branching time theory are defined entities, and the accessibility relation is defined with respect to the structure of the possible worlds. In the pure, abstract theory, where possible worlds are primitives, to the extent that there is structure, the structure is defined in terms of the relation on these worlds. So the worlds themselves are points, the structure of the overall frame is given by the accessibility relation. In the branching time theory, the possible worlds are possible histories, which have a structure defined by a more basic frame, and the accessibility relation is defined in terms of that structure.
    [Show full text]
  • 29 Alethic Modal Logics and Semantics
    29 Alethic Modal Logics and Semantics GERHARD SCHURZ 1 Introduction The first axiomatic development of modal logic was untertaken by C. I. Lewis in 1912. Being anticipated by H. McCall in 1880, Lewis tried to cure logic from the ‘paradoxes’ of extensional (i.e. truthfunctional) implication … (cf. Hughes and Cresswell 1968: 215). He introduced the stronger notion of strict implication <, which can be defined with help of a necessity operator ᮀ (for ‘it is neessary that:’) as follows: A < B iff ᮀ(A … B); in words, A strictly implies B iff A necessarily implies B (A, B, . for arbitrary sen- tences). The new primitive sentential operator ᮀ is intensional (non-truthfunctional): the truth value of A does not determine the truth-value of ᮀA. To demonstrate this it suf- fices to find two particular sentences p, q which agree in their truth value without that ᮀp and ᮀq agree in their truth-value. For example, it p = ‘the sun is identical with itself,’ and q = ‘the sun has nine planets,’ then p and q are both true, ᮀp is true, but ᮀq is false. The dual of the necessity-operator is the possibility operator ‡ (for ‘it is possible that:’) defined as follows: ‡A iff ÿᮀÿA; in words, A is possible iff A’s negation is not necessary. Alternatively, one might introduce ‡ as new primitive operator (this was Lewis’ choice in 1918) and define ᮀA as ÿ‡ÿA and A < B as ÿ‡(A ŸÿB). Lewis’ work cumulated in Lewis and Langford (1932), where the five axiomatic systems S1–S5 were introduced.
    [Show full text]
  • Probabilistic Semantics for Modal Logic
    Probabilistic Semantics for Modal Logic By Tamar Ariela Lando A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Philosophy in the Graduate Division of the University of California, Berkeley Committee in Charge: Paolo Mancosu (Co-Chair) Barry Stroud (Co-Chair) Christos Papadimitriou Spring, 2012 Abstract Probabilistic Semantics for Modal Logic by Tamar Ariela Lando Doctor of Philosophy in Philosophy University of California, Berkeley Professor Paolo Mancosu & Professor Barry Stroud, Co-Chairs We develop a probabilistic semantics for modal logic, which was introduced in recent years by Dana Scott. This semantics is intimately related to an older, topological semantics for modal logic developed by Tarski in the 1940’s. Instead of interpreting modal languages in topological spaces, as Tarski did, we interpret them in the Lebesgue measure algebra, or algebra of measurable subsets of the real interval, [0, 1], modulo sets of measure zero. In the probabilistic semantics, each formula is assigned to some element of the algebra, and acquires a corresponding probability (or measure) value. A formula is satisfed in a model over the algebra if it is assigned to the top element in the algebra—or, equivalently, has probability 1. The dissertation focuses on questions of completeness. We show that the propo- sitional modal logic, S4, is sound and complete for the probabilistic semantics (formally, S4 is sound and complete for the Lebesgue measure algebra). We then show that we can extend this semantics to more complex, multi-modal languages. In particular, we prove that the dynamic topological logic, S4C, is sound and com- plete for the probabilistic semantics (formally, S4C is sound and complete for the Lebesgue measure algebra with O-operators).
    [Show full text]
  • Logic-Sensitivity of Aristotelian Diagrams in Non-Normal Modal Logics
    axioms Article Logic-Sensitivity of Aristotelian Diagrams in Non-Normal Modal Logics Lorenz Demey 1,2 1 Center for Logic and Philosophy of Science, KU Leuven, 3000 Leuven, Belgium; [email protected] 2 KU Leuven Institute for Artificial Intelligence, KU Leuven, 3000 Leuven, Belgium Abstract: Aristotelian diagrams, such as the square of opposition, are well-known in the context of normal modal logics (i.e., systems of modal logic which can be given a relational semantics in terms of Kripke models). This paper studies Aristotelian diagrams for non-normal systems of modal logic (based on neighborhood semantics, a topologically inspired generalization of relational semantics). In particular, we investigate the phenomenon of logic-sensitivity of Aristotelian diagrams. We distin- guish between four different types of logic-sensitivity, viz. with respect to (i) Aristotelian families, (ii) logical equivalence of formulas, (iii) contingency of formulas, and (iv) Boolean subfamilies of a given Aristotelian family. We provide concrete examples of Aristotelian diagrams that illustrate these four types of logic-sensitivity in the realm of normal modal logic. Next, we discuss more subtle examples of Aristotelian diagrams, which are not sensitive with respect to normal modal logics, but which nevertheless turn out to be highly logic-sensitive once we turn to non-normal systems of modal logic. Keywords: Aristotelian diagram; non-normal modal logic; square of opposition; logical geometry; neighborhood semantics; bitstring semantics MSC: 03B45; 03A05 Citation: Demey, L. Logic-Sensitivity of Aristotelian Diagrams in Non-Normal Modal Logics. Axioms 2021, 10, 128. https://doi.org/ 1. Introduction 10.3390/axioms10030128 Aristotelian diagrams, such as the so-called square of opposition, visualize a number Academic Editor: Radko Mesiar of formulas from some logical system, as well as certain logical relations holding between them.
    [Show full text]
  • 31 Deontic, Epistemic, and Temporal Modal Logics
    31 Deontic, Epistemic, and Temporal Modal Logics RISTO HILPINEN 1 Modal Concepts Modal logic is the logic of modal concepts and modal statements. Modal concepts (modalities) include the concepts of necessity, possibility, and related concepts. Modalities can be interpreted in different ways: for example, the possibility of a propo- sition or a state of affairs can be taken to mean that it is not ruled out by what is known (an epistemic interpretation) or believed (a doxastic interpretation), or that it is not ruled out by the accepted legal or moral requirements (a deontic interpretation), or that it has not always been or will not always be false (a temporal interpretation). These interpre- tations are sometimes contrasted with alethic modalities, which are thought to express the ways (‘modes’) in which a proposition can be true or false. For example, logical pos- sibility and physical (real or substantive) possibility are alethic modalities. The basic modal concepts are represented in systems of modal logic as propositional operators; thus they are regarded as syntactically analogous to the concept of negation and other propositional connectives. The main difference between modal operators and other connectives is that the former are not truth-functional; the truth-value (truth or falsity) of a modal sentence is not determined by the truth-values of its subsentences. The concept of possibility (‘it is possible that’ or ‘possibly’) is usually symbolized by ‡ and the concept of necessity (‘it is necessary that’ or ‘necessarily’) by ᮀ; thus the modal formula ‡p represents the sentence form ‘it is possible that p’ or ‘possibly p,’ and ᮀp should be read ‘it is necessary that p.’ Modal operators can be defined in terms of each other: ‘it is possible that p’ means the same as ‘it is not necessary that not-p’; thus ‡p can be regarded as an abbreviation of ÿᮀÿp, where ÿ is the sign of negation, and ᮀp is logically equivalent to ÿ‡ÿp.
    [Show full text]
  • Accepting a Logic, Accepting a Theory
    1 To appear in Romina Padró and Yale Weiss (eds.), Saul Kripke on Modal Logic. New York: Springer. Accepting a Logic, Accepting a Theory Timothy Williamson Abstract: This chapter responds to Saul Kripke’s critique of the idea of adopting an alternative logic. It defends an anti-exceptionalist view of logic, on which coming to accept a new logic is a special case of coming to accept a new scientific theory. The approach is illustrated in detail by debates on quantified modal logic. A distinction between folk logic and scientific logic is modelled on the distinction between folk physics and scientific physics. The importance of not confusing logic with metalogic in applying this distinction is emphasized. Defeasible inferential dispositions are shown to play a major role in theory acceptance in logic and mathematics as well as in natural and social science. Like beliefs, such dispositions are malleable in response to evidence, though not simply at will. Consideration is given to the Quinean objection that accepting an alternative logic involves changing the subject rather than denying the doctrine. The objection is shown to depend on neglect of the social dimension of meaning determination, akin to the descriptivism about proper names and natural kind terms criticized by Kripke and Putnam. Normal standards of interpretation indicate that disputes between classical and non-classical logicians are genuine disagreements. Keywords: Modal logic, intuitionistic logic, alternative logics, Kripke, Quine, Dummett, Putnam Author affiliation: Oxford University, U.K. Email: [email protected] 2 1. Introduction I first encountered Saul Kripke in my first term as an undergraduate at Oxford University, studying mathematics and philosophy, when he gave the 1973 John Locke Lectures (later published as Kripke 2013).
    [Show full text]
  • Modal Logic Programming Revisited
    Modal logic programming revisited Linh Anh Nguyen University of Warsaw Institute of Informatics ul. Banacha 2, 02-097 Warsaw (Poland) [email protected] ABSTRACT. We present optimizations for the modal logic programming system MProlog, in- cluding the standard form for resolution cycles, optimized sets of rules used as meta-clauses, optimizations for the version of MProlog without existential modal operators, as well as iter- ative deepening search and tabulation. Our SLD-resolution calculi for MProlog in a number of modal logics are still strongly complete when resolution cycles are in the standard form and optimized sets of rules are used. We also show that the labelling technique used in our direct ap- proach is relatively better than the Skolemization technique used in the translation approaches for modal logic programming. KEYWORDS: modal logic, logic programming, MProlog. DOI:10.3166/JANCL.19.167–181 c 2009 Lavoisier, Paris 1. Introduction Modal logic programming is the field that extends classical logic programming to deal with modalities. As modal logics can be used, among others, to reason about knowledge and belief, developing a good formalism for modal logic programs and an efficient computational procedure for it is desirable. The first work on extending logic programming with modal logic is (Fariñas del Cerro, 1986) on the implemented system Molog (Fariñas del Cerro et al., 1986). With Molog, the user can fix a modal logic and define or choose the rules to deal with modal operators. Molog can be viewed as a framework which can be instantiated with particular modal logics. As an extension of Molog, the Toulouse Inference Machine (Balbiani et al., 1991) together with an abstract machine model called TARSKI for implementation (Balbiani et al., 1992) makes it possible for a user to select clauses which cannot exactly unify with the current goal, but just resemble it in some way.
    [Show full text]
  • The Principle of Analyticity of Logic a Philosophical and Formal Perspective
    Scuola Normale Superiore Classe di Lettere e Filosofia Corso di Perfezionamento in Filosofia The Principle of Analyticity of Logic A Philosophical and Formal Perspective Thesis Advisors: Candidate: Prof. Marcello D'Agostino Costanza Larese Prof. Massimo Mugnai July 2019 2 Contents Introduction 4 Summary 8 I Historical and philosophical reconstruction 12 1 Kant and the foundations of the analytic-synthetic distinction 14 1.1 The Kantian analytic-synthetic distinction . 14 1.1.1 Criteria for analyticity . 16 1.1.2 Containment . 19 1.1.3 Clarification, identity and contradiction . 26 1.1.4 Syntheticity and intuition . 33 1.2 Kant's pure general logic . 35 1.2.1 The topics of pure general logic . 37 1.2.2 The conception of pure general logic . 41 1.3 The relationship between analyticity and logic . 46 1.3.1 Logic as an instrument . 46 1.3.2 The status of logic . 47 2 Bolzano and the syntheticity of logic 54 2.1 Bolzano's analytic-synthetic distinction . 54 2.1.1 Preliminary notions: the method of substitution, validity, derivability . 54 2.1.2 Bolzano's conception of analyticity . 57 2.1.3 The notion of logical analyticity . 62 2.1.4 Language independence and synonymy . 65 2.1.5 Criticisms against Kant's analysis and analytic-synthetic dis- tinction . 66 2.2 The science of logic . 70 2.2.1 Grounding, deductive sciences and synthetic a priori .... 70 3 CONTENTS 4 2.2.2 Bolzano's thesis that logic is synthetic . 74 2.3 An evaluation . 76 2.3.1 A contradiction in Bolzano's system? The pragmatics of analyticity .
    [Show full text]
  • Modality in Medieval Philosophy Stephen Read
    Modality in Medieval Philosophy Stephen Read The Metaphysics of Modality The synchronic conception of possibility and necessity as describing simultaneous alternatives is closely associated with Leibniz and the notion of possible worlds.1 The notion seems never to have been noticed in the ancient world, but is found in Arabic discussions, notably in al-Ghazali in the late eleventh century, and in the Latin west from the twelfth century onwards, elaborated in particular by Scotus. In Aristotle, the prevailing conception was what (Hintikka 1973: 103) called the “statistical model of modality”: what is possible is what sometimes happens.2 So what never occurs is impossible and what always occurs is necessary. Aristotle expresses this temporal idea of the possible in a famous passage in De Caelo I 12 (283b15 ff.), and in Metaphysics Θ4 (1047b4-5): It is evident that it cannot be true to say that this is possible but nevertheless will not be. (Aristotle 2006: 5) However, Porphyry. in his Introduction (Isagoge) to Aristotle’s logic (which he took to be Plato’s), included the notion of inseparable accidents, giving the example of the blackness of crows and Ethiopians.3 Neither, he says, is necessarily black, since we can conceive of a white crow, even if all crows are actually black. Whether this idea is true to Aristotle is uncertain.4 Nonetheless, Aristotle seems to have held that once a possibility is 1 realized any alternatives disappear. So past and present are fixed and necessary, and what never happens is impossible. If the future alone is open—that is, unfixed and possible— then once there is no more future, nothing is possible.
    [Show full text]
  • Essence and Necessity, and the Aristotelian Modal Syllogistic: a Historical and Analytical Study Daniel James Vecchio Marquette University
    Marquette University e-Publications@Marquette Dissertations (2009 -) Dissertations, Theses, and Professional Projects Essence and Necessity, and the Aristotelian Modal Syllogistic: A Historical and Analytical Study Daniel James Vecchio Marquette University Recommended Citation Vecchio, Daniel James, "Essence and Necessity, and the Aristotelian Modal Syllogistic: A Historical and Analytical Study" (2016). Dissertations (2009 -). 686. http://epublications.marquette.edu/dissertations_mu/686 ESSENCE AND NECESSITY, AND THE ARISTOTELIAN MODAL SYLLOGISTIC: A HISTORICAL AND ANALYTICAL STUDY by Daniel James Vecchio, B.A., M.A. A Dissertation submitted to the Faculty of the Graduate School, Marquette University, in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Milwaukee, Wisconsin December 2016 ABSTRACT ESSENCE AND NECESSITY, AND THE ARISTOTELIAN MODAL SYLLOGISTIC: A HISTORICAL AND ANALYTICAL STUDY Daniel James Vecchio, B.A., M.A. Marquette University, 2016 The following is a critical and historical account of Aristotelian Essentialism informed by recent work on Aristotle’s modal syllogistic. The semantics of the modal syllogistic are interpreted in a way that is motivated by Aristotle, and also make his validity claims in the Prior Analytics consistent to a higher degree than previously developed interpretative models. In Chapter One, ancient and contemporary objections to the Aristotelian modal syllogistic are discussed. A resolution to apparent inconsistencies in Aristotle’s modal syllogistic is proposed and developed out of recent work by Patterson, Rini, and Malink. In particular, I argue that the semantics of negation is distinct in modal context from those of assertoric negative claims. Given my interpretive model of Aristotle’s semantics, in Chapter Two, I provide proofs for each of the mixed apodictic syllogisms, and propose a method of using Venn Diagrams to visualize the validity claims Aristotle makes in the Prior Analytics.
    [Show full text]