The Principle of Analyticity of Logic a Philosophical and Formal Perspective
Total Page:16
File Type:pdf, Size:1020Kb
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. -
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. -
Logically Impossible Worlds
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by PhilPapers Forthcoming in the Australasian Journal of Logic Logically Impossible Worlds Koji Tanaka School of Philosophy Research School of Social Sciences Australian National University [email protected] 1 Impossible Worlds If we think of a possible world as representing a way things can be, an impossible world represents a way in which things cannot be. The importance of impossible worlds has been discussed in recent literature.1 One reason for accepting impossi- ble worlds comes from counterfactual reasoning (Nolan (1997), Routley (1989)). Consider, for instance, the following counterfactual: if someone were to square a circle, she or he would be famous. This counterfactual has an impossible an- tecedent. One way to analyse such a counterfactual is to invoke an impossible world where someone does square a circle and evaluate the consequent at the world or a set of worlds that is or are the closest to that impossible world. But what exactly are impossible worlds? What does it mean to talk about ways in which things cannot be? There are several formulations of impossible worlds in the literature.2 Some characterise the impossibility of impossible worlds in terms of logic. There have been mainly three ways in which impossible worlds are characterised in logical terms. First, an impossible world is a world where A ^ :A is true for some A (Lycan (1994)). According to this view, an impossible world is a world where some contradiction obtains. Second, an impossible world is a world that is governed by some non-classical logic (Cresswell (1973)). -
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. -
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). -
The Transience of Possibility Reina Hayaki
Forthcoming in the European Journal of Analytic Philosophy (2006). The Transience of Possibility Reina Hayaki ABSTRACT. The standard view of metaphysical necessity is that it is truth in all possible worlds, and therefore that the correct modal logic for metaphysical necessity is S5, in models of which all worlds are accessible from each other. I argue that S5 cannot be the correct logic for metaphysical necessity because accessibility is not symmetric: there are possible worlds that are accessible from ours but from which our world is not accessible. There are (or could be) some individuals who, if they had not existed, could not have existed. Once the possibility of such individuals is lost, it is gone forever. 1. Truth in all possible worlds? It is now widely (though not universally) accepted that metaphysical necessity is to be distinguished from logical necessity. A proposition is logically necessary if it is a theorem of logic. The notion of logical necessity is not without its problems. When we say “a theorem of logic”, which logic is appropriate for this definition? Should we use mere first-order logic, or something more powerful? (Are axioms of second-order logic logically necessary truths?) What if the relevant logic is not complete, so that some true sentences are not theorems? Are all mathematical truths logically necessary? Or, given the apparent failure of efforts to reduce mathematics to logic, should we say that some 1 mathematical propositions are not logically necessary but perhaps “mathematically necessary”, relative to a particular system of mathematics? How should we adjudicate wrangling between adherents of mutually incompatible logics, such as classical and non- classical logics? Regardless of how we answer these questions, the notion of logical necessity is at heart a syntactic one. -
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. -
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.................... -
Analyticity, Necessity and Belief Aspects of Two-Dimensional Semantics
!"# #$%"" &'( ( )#"% * +, %- ( * %. ( %/* %0 * ( +, %. % +, % %0 ( 1 2 % ( %/ %+ ( ( %/ ( %/ ( ( 1 ( ( ( % "# 344%%4 253333 #6#787 /0.' 9'# 86' 8" /0.' 9'# 86' (#"8'# Analyticity, Necessity and Belief Aspects of two-dimensional semantics Eric Johannesson c Eric Johannesson, Stockholm 2017 ISBN print 978-91-7649-776-0 ISBN PDF 978-91-7649-777-7 Printed by Universitetsservice US-AB, Stockholm 2017 Distributor: Department of Philosophy, Stockholm University Cover photo: the water at Petite Terre, Guadeloupe 2016 Contents Acknowledgments v 1 Introduction 1 2 Modal logic 7 2.1Introduction.......................... 7 2.2Basicmodallogic....................... 13 2.3Non-denotingterms..................... 21 2.4Chaptersummary...................... 23 3 Two-dimensionalism 25 3.1Introduction.......................... 25 3.2Basictemporallogic..................... 27 3.3 Adding the now operator.................. 29 3.4Addingtheactualityoperator................ 32 3.5 Descriptivism ......................... 34 3.6Theanalytic/syntheticdistinction............. 40 3.7 Descriptivist 2D-semantics .................. 42 3.8 Causal descriptivism ..................... 49 3.9Meta-semantictwo-dimensionalism............. 50 3.10Epistemictwo-dimensionalism................ 54 -
Sylvan's Bottle and Other Problems
Australasian Journal of Logic Sylvan’s Bottle and other problems Diane Proudfoot University of Canterbury New Zealand Abstract According to Richard Routley, a comprehensive theory of fiction is impossible, since almost anything is in principle imaginable. In my view, Routley is right: for any purported logic of fiction, there will be actual or imaginable fictions that successfully counterexample the logic. Using the example of ‘impossible’ fictions, I test this claim against theories proposed by Routley’s Meinongian contemporaries and also by Routley himself (for what he called ‘esoteric’ works of fiction) and his 21st century heirs. I argue that the phenomenon of impossible fictions challenges even today’s modal Meinongians. 1 Routley’s rules for the semantics of fiction According to Richard Routley, ‘any properly comprehensive theory of objects ... is obliged to supply a theory of fictions’ (1980, p. 538). Nevertheless, fictions, he said, ‘provide a severe testing ground for logical and semantical theories’ and ‘have regularly revealed serious weaknesses in each new theory proposed’ (ibid., p. 537). The severity of the test is due to certain characteristics of fiction noted by Routley, which I shall formulate as a set of three rules: R1. ‘[T]he author of a work of fiction can try to set down whatever he imagines; and the free range of imagination is virtually unlimited.’ ‘[An author has the] freedom to create whatever he will within the bounds of his art’ (Routley 1979, pp. 6, 8) R2. ‘[T]here are fictional worlds in which any given logical truth (or theorem) fails to hold or is violated.’ (ibid., p. -
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. -
Logically Impossible Worlds
Australasian Journal of Logic Logically Impossible Worlds Koji Tanaka School of Philosophy Research School of Social Sciences Australian National University [email protected] 1 Impossible Worlds If we think of a possible world as representing a way things can be, an impossible world represents a way in which things cannot be. The importance of impossible worlds has been discussed in recent literature.1 One reason for accepting impossi- ble worlds comes from counterfactual reasoning (Nolan (1997), Routley (1989)). Consider, for instance, the following counterfactual: if someone were to square a circle, she or he would be famous. This counterfactual has an impossible an- tecedent. One way to analyse such a counterfactual is to invoke an impossible world where someone does square a circle and evaluate the consequent at the world or a set of worlds that is or are the closest to that impossible world. But what exactly are impossible worlds? What does it mean to talk about ways in which things cannot be? There are several formulations of impossible worlds in the literature.2 Some characterise the impossibility of impossible worlds in terms of logic. There have been mainly three ways in which impossible worlds are characterised in logical terms. First, an impossible world is a world where A ^ :A is true for some A (Lycan (1994)). According to this view, an impossible world is a world where some contradiction obtains. Second, an impossible world is a world that is governed by some non-classical logic (Cresswell (1973)). According to this second formulation, it is assumed that classical logic holds at the actual world, and a world is impossible if the laws of classical logic fail.