DOCSLIB.ORG

Introduction to Modal Logics (Lecture Notes: Summer Term 2011)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Introduction to Modal Logics (Lecture Notes: Summer Term 2011) Introduction to Modal Logics (Draft) Stefan Wolfl¨ July 22, 2015 2 Contents 1 From Propositional to Modal Logic5 1.1 Propositional logic................................5 1.2 A simple modal logic...............................7 2 Modal Language, Frames, and Models 13 2.1 Relational structures............................... 13 2.2 Modal languages................................. 16 2.3 Relational models and satisfaction........................ 19 2.4 Constructing models............................... 24 2.5 Translating modal logic into first-order logic................... 27 2.6 Consequence relation and compactness...................... 29 2.7 Expressiveness.................................. 31 3 Normal Modal Logics, Frame Classes, and Definability 39 3.1 Normal modal logics............................... 39 3.2 Kripke frames and definability.......................... 41 3.3 Proving theorems................................. 45 3.4 Soundness and completeness........................... 48 3.5 Canonical frames, definability, and compactness................. 53 3.6 The modal logic S4 ................................ 56 3.7 The modal logic S5 ................................ 58 3.8 The modal logic KL ............................... 60 4 Decidability and Complexity 65 4.1 Finite Model Property............................... 65 4.2 Filtration..................................... 68 4.3 Complexity.................................... 70 5 Decision Procedures 81 5.1 A tableaux procedure for K(m) .......................... 81 5.2 Tableaux procedures for other modal logics................... 87 5.3 Optimization techniques............................. 89 3 4 1 From Propositional to Modal Logic 1.1 Propositional logic Let P be a set of propositional variables. The language LPL(P) has the following list of symbols as alphabet: variables from P, the logical symbols ?, >, :, !, ^, _, $, and brackets. The set of LPL(P)-formulae, then, is defined as the smallest set of words over this alphabet that contains ?, >, each p 2 P, and is closed under the formation rule: If j and y are formulae, then so are :j, (j ^y), (j _y), and (j !y). We may express this in an abbreviated manner as: j ::= ? j > j p j :j j (j ^ j0) j (j _ j0) j (j ! j0) j (j $ j0) — where p ranges over P. Propositional variables are also referred to as atomic formulae. LPL(P) will also denote the set of LPL(P)-formulae, and for abbreviation we will use the nota- tions LPL, L(P), or simply L if this is understood from the context. The semantics of propositional logic is defined in terms of truth assignments. A truth assign- ment is simply a function V : P ! f0;1g, i.e., V assigns to each atomic formula a truth value 0 (“false”) or 1 (“true”). Given a truth assignment V, the satisfaction relation is then defined as follows: V 6j= ? V j= > V j= p () V(p) = 1 V j= :j () V 6j= j V j= j ^ y () V j= j and V j= y V j= j _ y () V j= j or V j= y V j= j ! y () V 6j= j or V j= y V j= j $ y () V j= j iff V j= y Definition 1.1. An LPL-formula j is satisfiable if there exists a truth assignment V such that V j= j. It is valid if for each truth assignment V, it holds V j= j and contingent if it is neither valid nor unsatisfiable. Two formulae j and y are (logically) equivalent (or: PL-equivalent) if they are satisfied in the same sets of truth assignments. Given a set of LPL-formulae, S, a formulae j, and a truth assignment V, we write: V j= S if V satisfies each j 2 S, and S j= j if for each truth assignment V with V j= S, it holds that V j= j. j is then said to be a PL- consequence of S. We remark that most of these concepts also make sense if we restrict them to classes of truth assignments: Let C be a class of truth assignments (on the same set of propositional variables P). Then j is called C -satisfiable if j is satisfied in some V chosen from C , C -valid if j is satisfied in each V in C , etc. From these definitions, it is clear that for all formulae j and y, (j ^y) is equivalent to :(j ! :y) and (j _ y) equivalent to (:j ! y), etc. That is, one can drop, for example, ^, _, $, 5 >, and ? from the alphabet and instead use them as abbreviations in the meta-language: (j ^ y) := :(j !:y) (j _ y) := (:j ! y) (j $ y) := ((j ! y) ^ (y ! j)) > := (p0 ! p0) ? := :> where p0 is a fixed chosen propositional variable in P. A complete system of truth-functional connectives is any set of truth-functional connectives in which each truth-functional connective of arbitrary arity is definable. Examples include the systems f:;!g, f:;^g, f:;_g, and f?;!g. In what follows we will often switch between different such complete systems as appropriate in the respective context. Most of the times, however, we will stick to the system f:;!g. 0 0 0 For truth assignments V and V , we say that V and V coincide on Q ⊆ P (and write V =Q V ) if for each q 2 Q, V(q) = V 0(q). Lemma 1.1 (Coincidence Lemma). Let V and V 0 be truth assignments that coincide on Q ⊆ P. Then for each formula j in which only propositional variables from Q occur, it holds: 0 V j= j () V j= j: C Definition 1.2. A substitution is a map s : P ! LPL. Each substitution can be extended to a s function · : LPL ! LPL via the following recursive definition: ps := s(p) (:j)s := :js (j ! y)s := js ! ys ::: If a substitution s simply “replaces” each occurrence of variable p by a formula j, we simply s write y[p=j] instead of y . Analogously, we will use the notation y[p1=j1;:::; pk=jk] to indicate that the variables p1;:::; pn are simultaneously replaced by j1;:::;jn, respectively. Lemma 1.2 (Substitution Lemma). Let s be a substitution and V be a truth assignment. Define V s by V s (p) = 1 if and only if V j= s(p) for p 2 P. Then for each formula j, s s V j= j () V j= j : C Lemma 1.3 (Interpolation Theorem). For any LPL-formulae j and y with j j= y, there exists an LPL-formula c such that (a) in c only such propositional variables occur that occur in both j and y, and (b) it holds j j= c and c j= y. C In the situation of the lemma the formula c is called an interpolant of j and y. Actually, the proof requires that one of the symbols ? and/or > are in the language LPL. Otherwise, the claim only holds true for j j= y, where at least one propositional variable occurs in both j and y. 6 Definition 1.3. The degree of an LPL-formula j, degj, is the number of logical connectives occurring in j. The length of j is the number of alphabet symbols occurring j. Note that both notions depend on the chosen system of truth-functional connectives. Remark 1.1. It is an NP-complete problem (referred to as SAT) to decide for a given LPL- formula j whether it is satisfiable. The problem is also NP-complete if satisfiability is to be checked for propositional formulae in conjunctive normal form (CNF). A formula is in CNF if it is a conjunction of disjunctions of literals (a literal is a negated or unnegated atomic formula), i.e., the formula has the form n mi ^ _ li ji ; (CNF) i=1 ji where li ji is of the form p or :p for some propositional variable p. Accordingly, the problem to decide whether a given formula is valid is co-NP-complete. 1.2 A simple modal logic In what follows we will introduce a very simple “modal logic”. Again let P be a set of atomic propositions (or propositional variables). The language L(P) has the following list of sym- bols as alphabet: propositions of P, the logical symbols :, !, and , and brackets. The set of L(P)-formulae, then, is defined as follows: 0 j ::= p j :j j (j ! j ) j j — where p ranges over P. L(P) will also denote the set of L(P)-formulae, and for abbrevi- ation we will use the notations L, L(P), or simply L if this is understood. On the basis of the connectives of L(P), we can define: ♦j := ::j (j ! y) := (j ! y) Definition 1.4. A valuation model is a non-trivial family V = fVsgs2S of truth assignments of L (“non-trivial” means that S is a non-empty set). The elements of S are referred to as states (or possible worlds). V can be thought of as a function (called P-valuation on S) V : S ! 2P, i.e., it assigns to each state s in S a (possibly empty) set of propositional variables (namely those that are true in Vs). Given a valuation model V, we define a satisfaction relation as follows: V j=s p () p 2 V(s) V j=s :j () V 6j=s j V j=s j ! y () V 6j=s j or V j=s y 0 V j=s j () V j=s0 j; for each s 2 S By this definition and the definition of ♦, the truth condition for ♦j is then given by: V j=s ♦j () V j=s ::j () V 6j=s :j 0 () V 6j=s0 :j; for some s 2 S 0 () V j=s0 j; for some s 2 S 7 s1 :p, q, r, :s p, p, q, q, r, :r, :s :s s0 s2 Figure 1.1: An example of a valuation model Definition 1.5.
Load more

Recommended publications
  • 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]
  • 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....................
    [Show full text]
  • Kripke Completeness Revisited
    Kripke completeness revisited Sara Negri Department of Philosophy, P.O. Box 9, 00014 University of Helsinki, Finland. e-mail: sara.negri@helsinki.fi Abstract The evolution of completeness proofs for modal logic with respect to the possible world semantics is studied starting from an analysis of Kripke’s original proofs from 1959 and 1963. The critical reviews by Bayart and Kaplan and the emergence of Henkin-style completeness proofs are detailed. It is shown how the use of a labelled sequent system permits a direct and uniform completeness proof for a wide variety of modal logics that is close to Kripke’s original arguments but without the drawbacks of Kripke’s or Henkin-style completeness proofs. Introduction The question about the ultimate attribution for what is commonly called Kripke semantics has been exhaustively discussed in the literature, recently in two surveys (Copeland 2002 and Goldblatt 2005) where the rˆoleof the precursors of Kripke semantics is documented in detail. All the anticipations of Kripke’s semantics have been given ample credit, to the extent that very often the neutral terminology of “relational semantics” is preferred. The following quote nicely summarizes one representative standpoint in the debate: As mathematics progresses, notions that were obscure and perplexing become clear and straightforward, sometimes even achieving the status of “obvious.” Then hindsight can make us all wise after the event. But we are separated from the past by our knowledge of the present, which may draw us into “seeing” more than was really there at the time. (Goldblatt 2005, section 4.2) We are not going to treat this issue here, nor discuss the parallel development of the related algebraic semantics for modal logic (Jonsson and Tarski 1951), but instead concentrate on one particular and crucial aspect in the history of possible worlds semantics, namely the evolution of completeness proofs for modal logic with respect to Kripke semantics.
    [Show full text]
  • First-Order Modal Logic, Most Decidedly, Is Not Just Propositional Modal Logic Plus Classical Quantifier Machinery
    SYNTHESE LIBRARY MELVIN FITTING AND RICHARD L. MENDELSOHN STUDIES IN EPISTEMOLOGY. Lehman College and the Graduate Cente" CUNY, New York. U.s.A. LOGIC. METHODOLOGY. AND PHILOSOPHY OF SCIENCE '0 Managing Editor: FIRST-ORDER JAAKKO HINTlKKA. Boston University MODAL LOGIC Editors: DIRK VAN DALEN. University of Utrecht. The Netherlands DONALD DAVIDSON. University of California. Berkeley THEO A.F. KUIPERS. University ofGroningen. The Netherlands PATRICK SUPPES. Stanford University. California JAN WOLENSKI. Jagiellonian University. Krak6w. Poland VOLUME 277 KLUWER ACADEMIC PUBLISHERS DORDRECHT I BOSTON I LONDON A C.J.P. Catalogue record for this book is available from the Library of Congress. ISBN 0-7923-5335-8 (PB) ISBN 0-7923-5334-X (HB) To Marsha, Robin, and losh, with love PubHshed by Kluwer Academic Publishers, RLM P.D. Box 17,3300 AA Dordrecht, The Netherlands. To Roma, who knows what I mean MP Sold and distributed in North, Central and South America by Kluwer Academic Publishers. 101 Philip Drive, NorweII, MA 02061, U.S.A. In all other countries, sold and distributed by KJuwer Academij; Publishers, P.D. Box 322, 3300 AH Dordrecht, The Netherlands. Printed on acid-free paper An Rights Reserved © 1998 KJuwer Academic Publishers No part of the material protected by this copyright notice may be reproduced or utilized in any fonn or by any means, electronic or mechanical, including photocopying, recording or by any information storage and retrieval system, without written permission from the copyright owner Printed in the Netherlands. CONTENTS
    [Show full text]
  • A Note on Strictly Positive Logics and Word Rewriting Systems
    A note on strictly positive logics and word rewriting systems Lev Beklemishev∗ August 21, 2018 Abstract We establish a natural translation from word rewriting systems to strictly positive polymodal logics. Thereby, the latter can be considered as a generalization of the former. As a corollary we obtain examples of undecidable strictly positive normal modal logics. The translation has its counterpart on the level of proofs: we formulate a natural deep inference proof system for strictly positive logics generalizing derivations in word rewriting systems. We also formulate some open questions related to the theory of modal companions of superintuitionistic logics that was initiated by L.L. Maksimova and V.V. Rybakov. In this note we study the fragment of polymodal logic consisting of impli- cations of the form A → B, where A and B are formulas built-up from ⊤ and propositional variables using just ∧ and the diamond modalities. We call such formulas A and B strictly positive and will often omit the word ‘strictly.’ The interest towards such weak logics independently emerged within two different disciplines: provability logic and description logic (see [8, 5, 1]). In both cases, it was observed that the strictly positive language combines sim- plicity and efficiency while retaining a substantial amount of expressive power of modal logic. Thus, strictly positive fragments of many standard modal logics arXiv:1509.00666v2 [math.LO] 18 Feb 2016 are polytime decidable. The positive fragment of the (Kripke incomplete) poly- modal provability logic GLP is both polytime decidable and complete w.r.t. a natural class of finite Kripke frames [5].
    [Show full text]
  • Deductive Systems in Traditional and Modern Logic
    Deductive Systems in Traditional and Modern Logic • Urszula Wybraniec-Skardowska and Alex Citkin Deductive Systems in Traditional and Modern Logic Edited by Urszula Wybraniec-Skardowska and Alex Citkin Printed Edition of the Special Issue Published in Axioms www.mdpi.com/journal/axioms Deductive Systems in Traditional and Modern Logic Deductive Systems in Traditional and Modern Logic Editors Alex Citkin Urszula Wybraniec-Skardowska MDPI • Basel • Beijing • Wuhan • Barcelona • Belgrade • Manchester • Tokyo • Cluj • Tianjin Editors Alex Citkin Urszula Wybraniec-Skardowska Metropolitan Telecommunications Cardinal Stefan Wyszynski´ USA University in Warsaw, Department of Philosophy Poland Editorial Office MDPI St. Alban-Anlage 66 4052 Basel, Switzerland This is a reprint of articles from the Special Issue published online in the open access journal Axioms (ISSN 2075-1680) (available at: http://www.mdpi.com/journal/axioms/special issues/deductive systems). For citation purposes, cite each article independently as indicated on the article page online and as indicated below: LastName, A.A.; LastName, B.B.; LastName, C.C. Article Title. Journal Name Year, Article Number, Page Range. ISBN 978-3-03943-358-2 (Pbk) ISBN 978-3-03943-359-9 (PDF) c 2020 by the authors. Articles in this book are Open Access and distributed under the Creative Commons Attribution (CC BY) license, which allows users to download, copy and build upon published articles, as long as the author and publisher are properly credited, which ensures maximum dissemination and a wider impact of our publications. The book as a whole is distributed by MDPI under the terms and conditions of the Creative Commons license CC BY-NC-ND.
    [Show full text]
  • March 29 – April 07, 2013 Rio De Janeiro, Brazil
    Handbook of the 4th World Congress and School on Universal Logic March 29 { April 07, 2013 Rio de Janeiro, Brazil UNILOG'2013 www.uni-log.org ECEME { Escola de Comando e Estado-Maior do Ex´ercito Rio de Janeiro { Brasil Edited by Jean-Yves B´eziau,Arthur Buchsbaum and Alexandre Costa-Leite Revised by Alvaro Altair Contents 1 Organizers of UNILOG'13 5 1.1 Scientific Committee . 5 1.2 Organizing Committee . 5 1.3 Supporting Organizers . 6 2 Aim of the event 6 3 4th World School on Universal Logic 8 3.1 Aim of the School . 8 3.2 Tutorials . 9 3.2.1 Why Study Logic? . 9 3.2.2 How to get your Logic Article or Book published in English 9 3.2.3 Non-Deterministic Semantics . 10 3.2.4 Logic for the Blind as a Stimulus for the Design of Inno- vative Teaching Materials . 13 3.2.5 Hybrid Logics . 16 3.2.6 Psychology of Reasoning . 17 3.2.7 Truth-Values . 19 3.2.8 The Origin of Indian Logic and Indian Syllogism . 23 3.2.9 Logical Forms . 25 3.2.10 An Introduction to Arabic Logic . 26 3.2.11 Quantum Cognition . 28 3.2.12 Towards a General Theory of Classifications . 29 3.2.13 Connecting Logics . 31 3.2.14 Relativity of Mathematical Concepts . 32 3.2.15 Undecidability and Incompleteness are Everywhere . 33 3.2.16 Logic, Algebra and Implication . 34 3.2.17 Hypersequents and Applications . 36 3.2.18 Introduction to Modern Metamathematics . 37 3.2.19 Erotetic Logics .
    [Show full text]
  • Simplified Kripke-Style Semantics for Some Normal Modal Logics
    Andrzej Pietruszczak Simplified Kripke-Style Mateusz Klonowski Semantics for Some Normal Yaroslav Petrukhin Modal Logics Abstract. Pietruszczak (Bull Sect Log 38(3/4):163–171, 2009. https://doi.org/10.12775/ LLP.2009.013) proved that the normal logics K45, KB4 (= KB5), KD45 are determined by suitable classes of simplified Kripke frames of the form W, A,whereA ⊆ W .In this paper, we extend this result. Firstly, we show that a modal logic is determined by a class composed of simplified frames if and only if it is a normal extension of K45. Furthermore, a modal logic is a normal extension of K45 (resp. KD45; KB4; S5) if and only if it is determined by a set consisting of finite simplified frames (resp. such frames with A = ∅; such frames with A = W or A = ∅; such frames with A = W ). Secondly, for all normal extensions of K45, KB4, KD45 and S5, in particular for extensions obtained by adding the so-called “verum” axiom, Segerberg’s formulas and/or their T-versions, we prove certain versions of Nagle’s Fact (J Symbol Log 46(2):319–328, 1981. https://doi. org/10.2307/2273624) (which concerned normal extensions of K5). Thirdly, we show that these extensions are determined by certain classes of finite simplified frames generated by finite subsets of the set N of natural numbers. In the case of extensions with Segerberg’s formulas and/or their T-versions these classes are generated by certain finite subsets of N. Keywords: Simplified Kripke-style semantics, Semi-universal frames, Normal modal logics. Introduction Semi-universal frames introduced in [5] for some normal logics are Kripke frames of the form W, R,whereW is a non-empty set of possible worlds and R is an accessibility relation such that R = W × A, for some subset A of W (so A is a set of common alternatives for all worlds).1 Instead of semi- universal frames we can use simplified frames of the form W, A,whereW and A are as above.
    [Show full text]
  • Hilbert-Style Presentations of Two Logics Associated to Tetravalent Modal Algebras
    Hilbert-style Presentations of Two Logics Associated to Tetravalent Modal Algebras Marcelo E. Coniglio a Mart´ınFigallo b aCLE and Department of Philosophy. State University of Campinas. Campinas, Brazil bDepartamento de Matem´atica. Universidad Nacional del Sur. Bah´ıaBlanca, Argentina Abstract We analyze the variety of A. Monteiro's tetravalent modal algebras under the perspective of two logic systems naturally associated to it. Taking profit of the contrapositive implication introduced by A. Figallo and P. Landini, sound and complete Hilbert-style calculi for these logics are presented. 1 Introduction and Preliminaries The class TMA of tetravalent modal algebras was first considered by Anto- nio Monteiro, and mainly studied by I. Loureiro, A.V. Figallo, A. Ziliani and P. Landini. Later on, J.M. Font and M. Rius were interested in the logics arising from the algebraic and lattice-theoretical aspects of these algebras. They introduced a sequent calculus (for one of these logics) whose associated propositional logic coincides with the one defined by the matrix formed by the four-element TMA and one of its two prime filters, and to which we refer as Tetravalent Modal Logic (T ML). Independently, in [4] it was introduced a Hilbert-style propositional calculus for other logic associated to the variety TMA called T MLN (see Section 7). This calculus belongs to the class of standard systems of implicative extensional propositional calculi, but it has the disadvantage of having two implications and so many axioms. This paper retakes the question of studying the logical aspects of TMAs. By considering the contrapositive implication introduced by A.
    [Show full text]
  • Mathematical Modal Logic: a View of Its Evolution
    MATHEMATICAL MODAL LOGIC: A VIEW OF ITS EVOLUTION Robert Goldblatt . there is no one fundamental logical no- tion of necessity, nor consequently of possi- bility. If this conclusion is valid, the subject of modality ought to be banished from logic, since propositions are simply true or false . [Russell, 1905] 1 INTRODUCTION Modal logic was originally conceived as the logic of necessary and possible truths. It is now viewed more broadly as the study of many linguistic constructions that qualify the truth conditions of statements, including statements concerning knowl- edge, belief, temporal discourse, and ethics. Most recently, modal symbolism and model theory have been put to use in computer science, to formalise reasoning about the way programs behave and to express dynamical properties of transi- tions between states. Over a period of three decades or so from the early 1930’s there evolved two kinds of mathematical semantics for modal logic. Algebraic semantics interprets modal connectives as operators on Boolean algebras. Relational semantics uses relational structures, often called Kripke models, whose elements are thought of variously as being possible worlds, moments of time, evidential situations, or states of a computer. The two approaches are intimately related: the subsets of a re- lational structure form a modal algebra (Boolean algebra with operators), while conversely any modal algebra can be embedded into an algebra of subsets of a relational structure via extensions of Stone’s Boolean representation theory. Tech- niques from both kinds of semantics have been used to explore the nature of modal logic and to clarify its relationship to other formalisms, particularly first and sec- ond order monadic predicate logic.
    [Show full text]
  • Intuitionistic Non-Normal Modal Logics: a General Framework Tiziano Dalmonte, Charles Grellois, Nicola Olivetti
    Intuitionistic non-normal modal logics: A general framework Tiziano Dalmonte, Charles Grellois, Nicola Olivetti To cite this version: Tiziano Dalmonte, Charles Grellois, Nicola Olivetti. Intuitionistic non-normal modal logics: A general framework. Journal of Philosophical Logic, Springer Verlag, 2020. hal-02439704 HAL Id: hal-02439704 https://hal.archives-ouvertes.fr/hal-02439704 Submitted on 14 Jan 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Intuitionistic non-normal modal logics: A general framework∗ Tiziano Dalmonte, Charles Grellois, Nicola Olivetti Aix Marseille Univ, Université de Toulon, CNRS, LIS, Marseille, France Abstract We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possi- bility. We then consider the more important case of bimodal logics, which contain both modal operators. In this case we define several interactions between Necessity and Possibility of increasing strength, although weaker than duality. For all logics we provide both a Hilbert axiomatisation and a cut-free sequent calculus, on its basis we also prove their decidability. We then give a semantic characterisation of our logics in terms of neigh- bourhood models.
    [Show full text]
  • Structures for Epistemic Logic
    Structures for Epistemic Logic Nick Bezhanishvili and Wiebe van der Hoek Abstract In this paper we overview the main structures of epistemic and doxas- tic logic. We start by discussing the most celebrated models for epistemic logic, i.e., epistemic Kripke structures. These structures provide a very intuitive interpre- tation of the accessibility relation, based on the notion of information. This also naturally extends to the multi-agent case. Based on Kripke models, we then look at systems that add a temporal or a computational component, and those that pro- vide a ‘grounded’ semantics for knowledge. We also pay special attention to ‘non- standard semantics’ for knowledge and belief, i.e., semantics that are not based on an underlying relation on the sets of states. In particular, we discuss here neighbour- hood semantics and topological semantics. In all of these approaches, we can clearly point at streams of results that are inspired by work by Johan van Benthem. We are extremely pleased and honoured to be part of this book dedicated to his work and influences. Key words: Epistemic logic, doxastic logic, relational structures, neighbourhood models, topological semantics 1 Introduction Epistemic modal logic in a narrow sense studies and formalises reasoning about knowledge. In a wider sense, it gives a formal account of the informational attitude that agents may have, and covers notions like knowledge, belief, uncertainty, and hence incomplete or partial information. As is so often the case in modal logic, Nick Bezhanishvili Department of Philosophy, Utrecht University, e-mail: [email protected] Wiebe van der Hoek Department of Computer Science, University of Liverpool, e-mail: [email protected] 1 2 Nick Bezhanishvili and Wiebe van der Hoek such formalised notions become really interesting when studied in a broader con- text.
    [Show full text]