A Journey through the Possible Worlds of Modal Logic Lecture 1: Introduction to modal logics
|
|
- Cameron Beasley
- 6 years ago
- Views:
Transcription
1 A Journey through the Possible Worlds of Modal Logic Lecture 1: Introduction to modal logics Valentin Goranko Department of Philosophy, Stockholm University ESSLLI 2016, Bolzano, August 22, 2016
2 Outline Brief history of modal logic Variety of modalities and modal logics. Basic generic modal logic: syntax and possible worlds semantics. Truth and validity of modal formulae. Some important modal principles. Modal logics defined semantically and deductively. Relationships between modal logic and classical logic.
3 Modal logic: some pre-historical remarks Aristotle: Modes of truth. Necessary and possible truths. It is possible for A to hold of some B, A necessarily holds of every B. The problem of assigning truth to future contingencies. Sea-battle tomorrow argument. Megarian School. Diodorus Cronus and Philo of Megara: early versions of propositional logic. Considered the four modalities: possibility, impossibility, necessity and non-necessity as as modal properties of propositions. Diodorus defined possible as what is or will ever be and necessary as what is and will always be. The Diodorean conditional: precursor of the strict implication. Diodorus rejected future contingents. Master Argument Stoic School. Chrysippus: the 2nd greatest ancient logician, after Aristotle. Founder of propositional logic. Also, founder of non-classical logics, incl. modal, tense, epistemic, etc.
4 Modal logic: from medieval times to early 1900s Medieval (modal) logic: mostly about theological issues, but some interesting ideas, too. E.g., Willem of Ockham. Leibniz: A necessary truth is truth in all possible worlds H. MacColl 1897: causal and general implications. Certain, impossible and variable statements.
5 Early history of modal logic C.I. Lewis, 1912: problems with the material implication: A false proposition implies any proposition, e.g., If 2+2=5 then the Moon is made of cheese. A true proposition follows from any proposition, e.g. If the Sun is made of ice then the Sun is hot. Lewis proposal: to add a strict implication A B := (A B), where means possibly true. Equivalently: A B (A B), where X := X means X is necessarily true. Lewis, : introduced 5 systems of modal logic, S1 S5, purporting to capture the properties of the strict implication.
6 Some side remarks on the material implication Other problems with the classical (material) implication: Irrelevance/non-causality: If the Sun is hot, then 2+2=4. Material vs causal implication. E.g. monotonicity applies to the former but not to the latter: If I put sugar in my tea, then it will taste good. If I put sugar and I put petrol in my tea then it will taste good. Lead respectively to relevant logics and non-monotonic logics.
7 Early history of modal logic, continued K. Gödel, 1933: separates propositional and modal axioms. Interpretation of Brower-Heyting s intuitionistic logic into S4. Necessity as provability. S4 as a logic of provability. G. von Wright, 1951: An Essay in Modal Logic: alethic, epistemic and deontic modal logics. E. Lemmon 1957: alternative axiomatizations of Lewis systems. J. Lukasiewicz, J. Dugundji, J. McKinsey, etc., s: Algebraic approaches. Characteristic matrices and algebras. Decidability of S2 S4. A. Tarski and B. Jónsson, : representation theorem for Boolean algebras with operators. No modal logic mentioned!
8 Modal logic: origins of possible worlds semantics Leibniz: possible worlds. Wittgenstein: possible states of affairs. R. Carnap, 1940s. Meaning and Necessity. State descriptions. Logical truth (L-truth) as holding in all state descriptions. Denoted A. R. Barcan, R. Carnap, 1940s: Modalities and Quantification. Quantified modal logics. Quine: interpretation problem for quantified modal logic. J. Hintikka, S. Kanger, R. Montague, A. Prior, late 1950s: accessibility relations between possible worlds. See Ballarin s SEP article on the Modern Origins of Modal Logic and Lindström & Segerberg s HBML chapter on the logical and metaphysical interpretations of the alethic modalities.
9 The beginning of modern modal logic: Kripke semantics S. Kripke, early 1960s: Semantical Analysis of Modal Logic I, II puts together all important ingredients of the possible worlds (aka, relational) semantics, characterises semantically and proves completeness and decidability of a wide range of important modal logics, relates possible worlds and algebraic semantics, proves completeness and undecidability of quantified S5.
10 The golden era of modal logic: 1960s 1960s-1980s: an explosion of model-theoretic and proof-theoretic studies, completeness and expressiveness results in modal logic. 1980s : modal logic gradually changes focus and expands its scope: hybrid, multi-modal, multi-dimensional, multi-agent etc. extended modal logics. ML becomes increasingly popular as a versatile and universal suitably expressive and computationally well-behaved logical framework for knowledge representation and reasoning in various areas of Philosophy, Mathematics, Linguistics, Artificial Intelligence and Computer Science. See the SEP article on Modal Logic and the other supplementary readings on the course webpage.
11 Modes of truth and meanings of the modal operators Basic modal operators: and. Meaning: In alethic logic: ϕ: ϕ is necessarily true ; ϕ: ϕ is possibly true ; In temporal logic: ϕ: ϕ will always be true, ϕ: ϕ will become true sometime in the future, In logic of beliefs: ϕ: the agent believes ϕ ; ϕ: the agent does not disbelieve ϕ, i.e. ϕ is consistent with the agent s beliefs ; In logic of knowledge: ϕ: the agent knows that ϕ ; ϕ: ϕ is consistent with the agent s knowledge ; In deontic logic: ϕ: ϕ is obligatory ; ϕ: ϕ is permitted ; In logic of (non-deterministic) programs: ϕ: ϕ will be true after every execution of the program, ϕ: ϕ will be true after some execution of the program.
12 Variety of modal reasoning and logics. Necessary and possible truths. Alethic logics. Truths over time. Temporal reasoning. Temporal logics. Reasoning about knowledge. Epistemic logics. Reasoning about beliefs. Doxastic logics. Reasoning about obligations and permissions. Deontic logics. Reasoning about spatial relations. Spatial logics. Reasoning about ontologies. Description logics. Reasoning about provability in a formal theory (e.g. in Peano Arithmetic). Provability logics. Reasoning about program executions. Logics of programs. Specification of transition systems. Logics of computations. Reasoning about many agents and their knowledge, beliefs, goals, actions, strategies, etc. Logics of multiagent systems.
13 Necessary and possible truths. Alethic modal logics ϕ ϕ: What is necessarily true is not possibly not true. ϕ ϕ: What is possibly true is not necessarily not true. Iterating: ϕ: ϕ is necessarily possibly true. ϕ: ϕ is possibly necessarily true. etc.
14 The basic propositional modal logic ML: syntax Language of ML: logical connectives,,, and a unary modal operator, and a set of atomic propositions AP = {p 0, p 1,...}. Formulae: Definable propositional connectives: := ; ϕ ψ := ( ϕ ψ); ϕ ψ := (ϕ ψ); ϕ ψ := (ϕ ψ) (ψ ϕ). ϕ = p ϕ (ϕ ϕ) ϕ is defined as the dual operator of : ϕ = ϕ.
15 Some important modal principles K: T: D: B: 4: 5: (p q) ( p q) p p p p p p p p p p Church-Rosser: p p McKinsey : Gödel Löb: p p ( p p) p
16 Semantic structures for modal logic: frames and models Kripke frame: a pair (W, R), where: W is a non-empty set of possible worlds, R W 2 is an accessibility relation between possible worlds. Kripke model over a frame T : a pair (T, V ) where V : AP P(W ) is a valuation assigning to every atomic proposition the set of possible worlds where it is true. Sometimes, instead of valuations, Kripke models are defined in terms of labelling functions: L : W P(AP), where L(s) comprises the atomic propositions true in the possible world s.
17 Kripke model: example s 2 {p,q} s 3 {p} s 1 {q} s 6 {p,q} s 4 {q} s 5 {} The valuation: V (p) = {s 2, s 3, s 6 }, V (q) = {s 1, s 2, s 4, s 6 }.
18 Kripke semantics of modal logic Truth of a formula ϕ at a possible world u in a Kripke model M = (W, R, V ), denoted M, u = ϕ, is defined as follows: M, u = p iff u V (p); M, u = ; M, u = ϕ iff M, u = ϕ; M, u = ϕ 1 ϕ 2 iff M, u = ϕ 1 and M, u = ϕ 2 ; M, u = ϕ iff M, w = ϕ for every w W such that Ruw. Respectively, M, u = ϕ iff M, w = ϕ for some w W such that Ruw. An important feature of modal logic: the notion of truth is local, i.e., at a state of a model. However, modal formulae cannot refer explicitly to possible worlds.
19 Truth of modal formulae: exercises s 1 {q} s 2 {p,q} s 4 {q} M s 3 {p} s 5 {} s 6 {p,q} Check the following: M, s 1? = q p. Yes. M, s 1? = q. No. M, s 1? = q. Yes. M, s 2? = (q q). Yes: take s 6. M, s 2? = (p q). No. M, s 3? = ( q p). Yes; M, s 4? = (q p q). No. M, s 6? = ( q (p q)). Yes.
20 Validity and satisfiability of modal formulae A modal formula ϕ is: valid in a model M, denoted M = ϕ, if it is true in every world of M valid at a possible world u in a frame T, denoted T, u = ϕ, if it is true in u in every model on T valid in a frame T, denoted T = ϕ, if it is valid on every model on T valid, denoted = ϕ, if it is valid in every model (or frame). satisfiable, if it is true in some possible world of some model, i.e., if its negation is not valid. A proposition ϕ is contingent (in a possible world) if ϕ ϕ holds (true in that possible world); ϕ is analytic (in a possible world) if ϕ ϕ holds (true in that possible world).
21 Does the strict implication solve the problems of the material implication? Local logical consequence in modal logic: ϕ 1,... ϕ n = ψ iff for every model M and u M, if M, u = ϕ i for each i = 1,... n then M, u = ψ. Do the following hold for the strict implication A B (A B)? 1. ϕ, ϕ ψ = ψ 2. ϕ = ϕ ψ 3. ψ = ϕ ψ 4. ϕ = ϕ ψ 5. ψ = ϕ ψ
22 Exercise: time and necessity Consider the following postulates: What is true of the past is necessarily true. The impossible cannot follow from the possible. There is something which is possible, but is neither true now nor will ever be true. Are these consistent together?
23 Addendum: Extension of a formula The extension of a formula ϕ in a Kripke model M = (W, R, V ) is the set of states in M satisfying the formula: ϕ M := {s M, s = ϕ}. The extension of a formula ϕ M can be computed inductively on the construction of ϕ: M = ; p M = V (p) ϕ M = W \ ϕ M ; ϕ 1 ϕ 2 M = ϕ 1 M ϕ 2 M ; ϕ M = {s R(s) ϕ M }.
24 Addendum: Model checking of modal formulae Model checking is a procedure checking whether a given model satisfies given property, usually specified in some logical language. Model checking may, or may not, be algorithmically decidable, depending on the logical formalism and the class of models under consideration. The main model checking problems for modal logic are: 1. Local model checking: given a Kripke model M, a state u M and a modal formula ϕ, determine whether M, u = ϕ; 2. Global model checking: given a Kripke model M and a modal formula ϕ, determine the set ϕ M.
25 Global model checking of modal formulae: exercises M Compute the following: s 2 {p,q} s 3 {p} p M = {s 1, s 2, s 6 }. p p M = {s 2, s 6 }. s 1 {q} s 6 {p,q} (p p) M = {s 1, s 2, s 5 }. s 4 {q} s 5 {} q (p p) M = {s 1, s 2, s 4, s 5, s 6 }. ( p q) M =?
26 Addendum: an algorithm for global model checking of modal formulae Global model checking algorithm for ML: given a (finite) Kripke model M and a formula θ, compute the extensions ϕ M for all subformulae ϕ of θ recursively, by labelling all possible worlds with those subformulae of θ that are true in those worlds, as follows: The labelling of atomic propositions is given by the valuation. The propositional cases are routine. ϕ consists of all states which have all their successors in ϕ, i.e. labelled by ϕ. This simple algorithm is very efficient: it works in linear time, both in the length of the formula and in the size of the model.
27 Addendum: Standard translation of modal logic to first-order logic L 0 : a FO language with =, a binary predicate R, and individual variables VAR = {x 0, x 1,...}. L 1 : a FO language extending L 0 with a set of unary predicates {P 0, P 1,...}, corresponding to the atomic propositions p 0, p 1,... The formulae of ML are translated into L 1 by the following standard translation, where the individual variable x is a parameter: ST(p i ; x) := P i x, for every p i AP, ST( φ; x) := ST(φ; x), ST(φ 1 φ 2 ; x) := ST(φ 1 ; x) ST(φ 2 ; x), ST( φ; x) := y(rxy ST(φ; y)), where y is the first variable in VAR not used yet in the translation of ST (φ; x). Respectively, we obtain: ST(φ 1 φ 2 ; x) ST(φ 1 ; x) ST(φ 2 ; x) ST(φ 1 φ 2 ; x) ST(φ 1 ; x) ST(φ 2 ; x)
28 Standard translation of modal formulae: some examples ST( p p; x 0 ) = x 1 (Rx 0 x 1 Px 1 ) Px 0 or, after renaming, just y(rx 0 y Py) Px 0 ) ST( p; x 0 ) = x 1 (Rx 0 x 1 x 2 (Rx 1 x 2 x 3 (Rx 2 x 3 Px 3 ))) or, ignoring the concrete variables: ST( p; x) = y(rxy z(ryz u(rzu Pu))), NB: It suffices to alternate only two variables, e.g. x and y. Note that the formula above is equivalent to y(rxy x(ryx y(rxy Py))). ST( p 1 p 2 ; x) = x 1 (Rxx 1 x 2 (Rx 1 x 2 P 1 x 2 )) x 3 (Rxx 3 P 2 x 3 ) equivalent to y(rxy x(ryx P 1 x)) y(rxy P 2 y). (The formula above re-uses only 2 variables.)
29 Now, for every Kripke model M, w M and ϕ ML: M, w = ϕ iff M, w = FO ST(ϕ; x)[x := w], Accordingly, M = ϕ iff M = FO xst(ϕ; x). Then, validity of a modal formula in a frame translates into: T = ϕ iff T = P 1... P k xst(ϕ; x). where P 1,..., P k are the unary predicates occurring in ϕ. Thus, modal logic can be used as a language to specify properties of Kripke models, and to specify properties of Kripke frames. In terms of validity in Kripke models, ML is a fragment of the first-order language L 1, while in terms of validity in Kripke frames, it is a fragment of universal monadic second order logic over L 0.
30 Validity of modal formulae in Kripke frames Checking validity of a modal formula ϕ in a frame T requires checking validity of ϕ in all Kripke models based on T, i.e., for all possible valuations of the atomic propositions occurring in ϕ. T : s 2 s 3 Check the following: T, s 1? = p p. Yes. T, s 1? = p p. No. s 1 T, s 1? = p p. Yes. T, s 1? = p p. Yes. s 4 s 5 T, s 1? = ( p p). No. T? = p p. No. T? = p p. Yes. T? = (p q) ( p q). Yes.
31 Addendum: Some important properties of binary relations A binary relation R X 2 is called: reflexive if it satisfies x xrx. irreflexive if it satisfies x xrx. serial if it satisfies x y xry. functional if it satisfies x!y xry, where!y means there exists a unique y. symmetric if it satisfies x y(xry yrx). asymmetric if it satisfies x y(xry yrx). antisymmetric if it satisfies x y(xry yrx x = y). connected if it satisfies x y(xry yrx). transitive if it satisfies x y z((xry yrz) xrz). equivalence relation if it is reflexive, symmetric, and transitive. euclidean if it satisfies x y z((xry xrz) yrz). pre-order, (or quasi-order) if it is reflexive and transitive. partial order, if it is reflexive, transitive, and antisymmetric. linear order, (or total order) if it is a connected partial order.
32 Some relational properties of Kripke frames definable by modal formulae Claim For every Kripke frame T = (W, R) the following holds: T = p p iff the relation R is reflexive. T = p p iff the relation R is serial. Exercise: find a simpler modal formula that defines seriality. T = p p iff T = p p iff the relation R is symmetric. T = p p iff T = p p iff the relation R is transitive. T = p p iff T = p p iff the relation R is euclidean.
33 Addendum: On the correspondence between modal logic and first-order logic on Kripke frames Not every modal formula defines a first-order property on Kripke frames. Example: for every Kripke frame T = (W, R) the following holds: T = ( p p) p iff the relation R is transitive and has no infinite increasing chains. (NB. The latter property is not definable in FOL.) On the other hand, not every first-order definable property is definable by a modal formula. For instance, the properties of irreflexivity, asymmetry, and connectiveness are not modally definable. The correspondence between modal logic and first-order logic has been studied in depth. See Handbook of Modal Logic for further details and references.
34 Modal logics defined semantically Many important modal logics can be defined by restricting the class of Kripke frames in which modal formulae are interpreted, and defining the logic to capture the valid formulae in that class of frames. For instance, such are the logics: The logic K of all Kripke frames. The logic D of all serial Kripke frames. The logic T of all reflexive Kripke frames. The logic B of all symmetric Kripke frames. The logic K4 of all transitive Kripke frames. The logic S4 of all reflexive and transitive Kripke frames. The logic S5 of all reflexive, transitive, and symmetric Kripke frames, i.e. all equivalence relations.
35 Some valid modal formulae Every modal instance of a propositional tautology, i.e., every formula obtained by uniform substitution of modal formulae for propositional variables in a propositional tautology. For instance: p p; ( p q) q, etc. K: (p q) ( p q); (p q) ( p q). (p q) ( p q). ϕ, for every valid modal formula ϕ. E.g., ( p p), ( p p), etc.
36 The basic modal logic K as a deductive system A (modal) logic can alternatively be defined as a deductive system, e.g. as an axiomatic system. For instance, an axiomatic system for the modal logic K can be defined by extending an axiomatic system H for classical propositional logic with the axiom K : (p q) ( p q) and the Necessitation rule: ϕ ϕ It turns out (Kripke, 1963) that this axiomatic system is sound and complete with respect to validity in all Kripke frames.
37 Modal logics defined deductively Many (but not all!) modal logics can be defined syntactically, as deductive systems, by extending K with additional axioms defining the respective class of Kripke frames. T = K + p p; D = K + p p; B = K + p p; K4 = K + p p; S4 = T4 = K4 + p p; S5 = BS4 = S4 + p p. Each of these has been proved (most of them already by Kripke, 1963) sound and complete for the respective class of Kripke frames that defines the logic semantically. See some references on the course webpage.
38 Addendum: A few words on deduction in modal logic Many more sound and complete axiomatic systems have been developed for modal logics, including those mentioned earlier. However, such axiomatic systems are not suitable for practical deduction. Likewise, tableau-based systems of deduction have been developed for a wide range of modal logics, by adding specific rules of inference capturing their specific semantic properties. Such systems are practically useful, but often not easy to design. Also, systems of natural deduction and sequent calculi for various modal logics have been constructed. Alternatively, resolution-based systems of deduction have been developed, typically based on standard translation from modal logic to FOL. They only work well for some modal logics.
39 Exercises 1. For each of the formulae T, B, D, 4, 5 listed in the slides decide which of the meanings of the following interpretation of the modal operator should be considered a valid principle. Necessity Knowledge Belief Truth always in the future Truth always in the past 2. Consider the following definition: Knowledge is justified true belief. Do you agree with it or not? Why?
Modal logics: an introduction
Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Non-classical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and
More informationModel Theory of Modal Logic Lecture 1: A brief introduction to modal logic. Valentin Goranko Technical University of Denmark
Model Theory of Modal Logic Lecture 1: A brief introduction to modal logic Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, 25 January, 2010
More informationPrinciples of Knowledge Representation and Reasoning
Principles of Knowledge Representation and Reasoning Modal Logics Bernhard Nebel, Malte Helmert and Stefan Wölfl Albert-Ludwigs-Universität Freiburg May 2 & 6, 2008 Nebel, Helmert, Wölfl (Uni Freiburg)
More informationAn Introduction to Modal Logic I
An Introduction to Modal Logic I Introduction and Historical remarks Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 10 th 2013 Marco
More informationFrom Syllogism to Common Sense
From Syllogism to Common Sense Mehul Bhatt Oliver Kutz Thomas Schneider Department of Computer Science & Research Center on Spatial Cognition (SFB/TR 8) University of Bremen Normal Modal Logic K r i p
More informationModal Logic. UIT2206: The Importance of Being Formal. Martin Henz. March 19, 2014
Modal Logic UIT2206: The Importance of Being Formal Martin Henz March 19, 2014 1 Motivation The source of meaning of formulas in the previous chapters were models. Once a particular model is chosen, say
More informationModel Theory of Modal Logic Lecture 5. Valentin Goranko Technical University of Denmark
Model Theory of Modal Logic Lecture 5 Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, January 29, 2010 Model Theory of Modal Logic Lecture
More informationNotes on Modal Logic
Notes on Modal Logic Notes for Philosophy 151 Eric Pacuit January 25, 2009 These short notes are intended to supplement the lectures and text ntroduce some of the basic concepts of Modal Logic. The primary
More informationFinal Exam (100 points)
Final Exam (100 points) Honor Code: Each question is worth 10 points. There is one bonus question worth 5 points. In contrast to the homework assignments, you may not collaborate on this final exam. You
More informationNotes on Modal Logic
Notes on Modal Logic Notes for PHIL370 Eric Pacuit October 22, 2012 These short notes are intended to introduce some of the basic concepts of Modal Logic. The primary goal is to provide students in Philosophy
More 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 informationMathematical Logics Modal Logic: Introduction*
Mathematical Logics Modal Logic: Introduction* Fausto Giunchiglia and Mattia Fumagallli University of Trento *Originally by Luciano Serafini and Chiara Ghidini Modified by Fausto Giunchiglia and Mattia
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 informationModal Logic. Introductory Lecture. Eric Pacuit. University of Maryland, College Park ai.stanford.edu/ epacuit. January 31, 2012.
Modal Logic Introductory Lecture Eric Pacuit University of Maryland, College Park ai.stanford.edu/ epacuit January 31, 2012 Modal Logic 1/45 Setting the Stage Modern Modal Logic began with C.I. Lewis dissatisfaction
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 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 informationcse541 LOGIC FOR COMPUTER SCIENCE
cse541 LOGIC FOR COMPUTER SCIENCE Professor Anita Wasilewska Spring 2015 LECTURE 2 Chapter 2 Introduction to Classical Propositional Logic PART 1: Classical Propositional Model Assumptions PART 2: Syntax
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 informationModel Theory of Modal Logic Lecture 4. Valentin Goranko Technical University of Denmark
Model Theory of Modal Logic Lecture 4 Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, January 28, 2010 Model Theory of Modal Logic Lecture
More informationThe Curry-Howard Isomorphism
The Curry-Howard Isomorphism Software Formal Verification Maria João Frade Departmento de Informática Universidade do Minho 2008/2009 Maria João Frade (DI-UM) The Curry-Howard Isomorphism MFES 2008/09
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 information03 Review of First-Order Logic
CAS 734 Winter 2014 03 Review of First-Order Logic William M. Farmer Department of Computing and Software McMaster University 18 January 2014 What is First-Order Logic? First-order logic is the study of
More informationToday. Next week. Today (cont d) Motivation - Why Modal Logic? Introduction. Ariel Jarovsky and Eyal Altshuler 8/11/07, 15/11/07
Today Introduction Motivation- Why Modal logic? Modal logic- Syntax riel Jarovsky and Eyal ltshuler 8/11/07, 15/11/07 Modal logic- Semantics (Possible Worlds Semantics): Theory Examples Today (cont d)
More informationFirst-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig
First-Order Logic First-Order Theories Roopsha Samanta Partly based on slides by Aaron Bradley and Isil Dillig Roadmap Review: propositional logic Syntax and semantics of first-order logic (FOL) Semantic
More informationKripke 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
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 informationcse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018
cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics
More informationAn Introduction to Modal Logic V
An Introduction to Modal Logic V Axiomatic Extensions and Classes of Frames Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 7 th 2013
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 informationNonclassical logics (Nichtklassische Logiken)
Nonclassical logics (Nichtklassische Logiken) VU 185.249 (lecture + exercises) http://www.logic.at/lvas/ncl/ Chris Fermüller Technische Universität Wien www.logic.at/people/chrisf/ chrisf@logic.at Winter
More informationFirst Order Logic (FOL) 1 znj/dm2017
First Order Logic (FOL) 1 http://lcs.ios.ac.cn/ znj/dm2017 Naijun Zhan March 19, 2017 1 Special thanks to Profs Hanpin Wang (PKU) and Lijun Zhang (ISCAS) for their courtesy of the slides on this course.
More informationBoxes and Diamonds. An Open Introduction to Modal Logic
Boxes and Diamonds An Open Introduction to Modal Logic Winter 2018 Boxes and Diamonds The Open Logic Project Instigator Richard Zach, University of Calgary Editorial Board Aldo Antonelli, University of
More informationAn Invitation to Modal Logic: Lecture 1
An Invitation to Modal Logic: Lecture 1 Philosophy 150 Eric Pacuit Stanford University November 26, 2007 Eric Pacuit: Invitation to Modal Logic, Philosophy 150 1 Setting the Stage Much of this course has
More informationOn Axiomatic Rejection for the Description Logic ALC
On Axiomatic Rejection for the Description Logic ALC Hans Tompits Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group Joint work with Gerald Berger Context The
More informationChapter 2: Introduction to Propositional Logic
Chapter 2: Introduction to Propositional Logic PART ONE: History and Motivation Origins: Stoic school of philosophy (3rd century B.C.), with the most eminent representative was Chryssipus. Modern Origins:
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
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 informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationPropositional Logic: Syntax
Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic
More informationFormalizing knowledge-how
Formalizing knowledge-how Tszyuen Lau & Yanjing Wang Department of Philosophy, Peking University Beijing Normal University November 29, 2014 1 Beyond knowing that 2 Knowledge-how vs. Knowledge-that 3 Our
More informationFirst-Order Modal Logic and the Barcan Formula
First-Order Modal Logic and the Barcan Formula Eric Pacuit Stanford University ai.stanford.edu/ epacuit March 10, 2009 Eric Pacuit: The Barcan Formula, 1 Plan 1. Background Neighborhood Semantics for Propositional
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 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 informationMODEL THEORY OF MODAL LOGIC
5 MODEL THEORY OF MODAL LOGIC Valentin Goranko and Martin Otto 1 Semantics of modal logic........................................ 4 1.1 Modal languages.......................................... 4 1.2 Kripke
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 informationPREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2
PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2 Neil D. Jones DIKU 2005 14 September, 2005 Some slides today new, some based on logic 2004 (Nils Andersen) OUTLINE,
More informationExamples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:
Logic: The Big Picture Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and
More informationSemantical study of intuitionistic modal logics
Semantical study of intuitionistic modal logics Department of Intelligence Science and Technology Graduate School of Informatics Kyoto University Kensuke KOJIMA January 16, 2012 Abstract We investigate
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 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 informationCHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC
CHAPTER 2 INTRODUCTION TO CLASSICAL PROPOSITIONAL LOGIC 1 Motivation and History The origins of the classical propositional logic, classical propositional calculus, as it was, and still often is called,
More informationCHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS
CHAPTER 4 CLASSICAL PROPOSITIONAL SEMANTICS 1 Language There are several propositional languages that are routinely called classical propositional logic languages. It is due to the functional dependency
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationLecture 7. Logic. Section1: Statement Logic.
Ling 726: Mathematical Linguistics, Logic, Section : Statement Logic V. Borschev and B. Partee, October 5, 26 p. Lecture 7. Logic. Section: Statement Logic.. Statement Logic..... Goals..... Syntax of Statement
More informationON THESES WITHOUT ITERATED MODALITIES OF MODAL LOGICS BETWEEN C1 AND S5. PART 1
Bulletin of the Section of Logic Volume 46:1/2 (2017), pp. 111 133 http://dx.doi.org/10.18778/0138-0680.46.1.2.09 Andrzej Pietruszczak ON THESES WITHOUT ITERATED MODALITIES OF MODAL LOGICS BETWEEN C1 AND
More informationTableau-based decision procedures for the logics of subinterval structures over dense orderings
Tableau-based decision procedures for the logics of subinterval structures over dense orderings Davide Bresolin 1, Valentin Goranko 2, Angelo Montanari 3, and Pietro Sala 3 1 Department of Computer Science,
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
More informationModal Logic XVI. Yanjing Wang
Modal Logic XVI Yanjing Wang Department of Philosophy, Peking University April 27th, 2017 Advanced Modal Logic (2017 Spring) 1 Sahlqvist Formulas (cont.) φ POS: a summary φ = p (e.g., p p) φ =... p (e.g.,
More informationMODAL LOGIC AND PHILOSOPHY
21 MODAL LOGIC AND PHILOSOPHY Sten Lindström and Krister Segerberg 1 Alethic modal logic........................................... 1154 1.1 The search for the intended interpretation............................
More informationLogic. Propositional Logic: Syntax. Wffs
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationIntroduction to Metalogic
Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional
More informationLogic: The Big Picture
Logic: The Big Picture A typical logic is described in terms of syntax: what are the legitimate formulas semantics: under what circumstances is a formula true proof theory/ axiomatization: rules for proving
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 informationThe Lambek-Grishin calculus for unary connectives
The Lambek-Grishin calculus for unary connectives Anna Chernilovskaya Utrecht Institute of Linguistics OTS, Utrecht University, the Netherlands anna.chernilovskaya@let.uu.nl Introduction In traditional
More 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 informationAlgebraizing Hybrid Logic. Evangelos Tzanis University of Amsterdam Institute of Logic, Language and Computation
Algebraizing Hybrid Logic Evangelos Tzanis University of Amsterdam Institute of Logic, Language and Computation etzanis@science.uva.nl May 1, 2005 2 Contents 1 Introduction 5 1.1 A guide to this thesis..........................
More informationPeano Arithmetic. CSC 438F/2404F Notes (S. Cook) Fall, Goals Now
CSC 438F/2404F Notes (S. Cook) Fall, 2008 Peano Arithmetic Goals Now 1) We will introduce a standard set of axioms for the language L A. The theory generated by these axioms is denoted PA and called Peano
More informationLogic and Probability Lecture 3: Beyond Boolean Logic
Logic and Probability Lecture 3: Beyond Boolean Logic Wesley Holliday & Thomas Icard UC Berkeley & Stanford August 13, 2014 ESSLLI, Tübingen Wesley Holliday & Thomas Icard: Logic and Probability, Lecture
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 informationIntroduction to Logic
Introduction to Logic 1 What is Logic? The word logic comes from the Greek logos, which can be translated as reason. Logic as a discipline is about studying the fundamental principles of how to reason
More informationRelations to first order logic
An Introduction to Description Logic IV Relations to first order logic Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014 Marco
More informationPositive provability logic
Positive provability logic Lev Beklemishev Steklov Mathematical Institute Russian Academy of Sciences, Moscow November 12, 2013 Strictly positive modal formulas The language of modal logic extends that
More informationNeighborhood Semantics for Modal Logic Lecture 5
Neighborhood Semantics for Modal Logic Lecture 5 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 17, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 5 1 Plan for the
More informationCS206 Lecture 21. Modal Logic. Plan for Lecture 21. Possible World Semantics
CS206 Lecture 21 Modal Logic G. Sivakumar Computer Science Department IIT Bombay siva@iitb.ac.in http://www.cse.iitb.ac.in/ siva Page 1 of 17 Thu, Mar 13, 2003 Plan for Lecture 21 Modal Logic Possible
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 informationTRUTH TELLERS. Volker Halbach. Scandinavian Logic Symposium. Tampere
TRUTH TELLERS Volker Halbach Scandinavian Logic Symposium Tampere 25th August 2014 I m wrote two papers with Albert Visser on this and related topics: Self-Reference in Arithmetic, http://www.phil.uu.nl/preprints/lgps/number/316
More informationAbstract In this paper, we introduce the logic of a control action S4F and the logic of a continuous control action S4C on the state space of a dynami
Modal Logics and Topological Semantics for Hybrid Systems Mathematical Sciences Institute Technical Report 97-05 S. N. Artemov, J. M. Davoren y and A. Nerode z Mathematical Sciences Institute Cornell University
More informationWHAT IS THE CORRECT LOGIC OF NECESSITY, ACTUALITY AND APRIORITY?
THE REVIEW OF SYMBOLIC LOGIC Volume 7, Number 3, September 2014 WHAT IS THE CORRECT LOGIC OF NECESSITY, ACTUALITY AND APRIORITY? PETER FRITZ University of Oxford Abstract. This paper is concerned with
More informationMonodic fragments of first-order temporal logics
Outline of talk Most propositional temporal logics are decidable. But the decision problem in predicate (first-order) temporal logics has seemed near-hopeless. Monodic fragments of first-order temporal
More informationLogic Part I: Classical Logic and Its Semantics
Logic Part I: Classical Logic and Its Semantics Max Schäfer Formosan Summer School on Logic, Language, and Computation 2007 July 2, 2007 1 / 51 Principles of Classical Logic classical logic seeks to model
More informationYanjing Wang: An epistemic logic of knowing what
An epistemic logic of knowing what Yanjing Wang TBA workshop, Lorentz center, Aug. 18 2015 Background: beyond knowing that A logic of knowing what Conclusions Why knowledge matters (in plans and protocols)
More 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 informationLecture Notes on Classical Modal Logic
Lecture Notes on Classical Modal Logic 15-816: Modal Logic André Platzer Lecture 5 January 26, 2010 1 Introduction to This Lecture The goal of this lecture is to develop a starting point for classical
More informationPhilosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc.
Philosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc. Modal operators are non-truth-functional; the truth-value of α at a world is not determined by α s s
More informationthe logic of provability
A bird s eye view on the logic of provability Rineke Verbrugge, Institute of Artificial Intelligence, University of Groningen Annual Meet on Logic and its Applications, Calcutta Logic Circle, Kolkata,
More informationEquational Logic and Term Rewriting: Lecture I
Why so many logics? You all know classical propositional logic. Why would we want anything more? Equational Logic and Term Rewriting: Lecture I One reason is that we might want to change some basic logical
More informationCHAPTER 2. FIRST ORDER LOGIC
CHAPTER 2. FIRST ORDER LOGIC 1. Introduction First order logic is a much richer system than sentential logic. Its interpretations include the usual structures of mathematics, and its sentences enable us
More informationDeveloping Modal Tableaux and Resolution Methods via First-Order Resolution
Developing Modal Tableaux and Resolution Methods via First-Order Resolution Renate Schmidt University of Manchester Reference: Advances in Modal Logic, Vol. 6 (2006) Modal logic: Background Established
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More informationAn Introduction to Modal Logic III
An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami
More informationLogic. Propositional Logic: Syntax
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
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 informationTo every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied.
Modal Logic (2) There appeared to be a correspondence between the validity of Φ Φ and the property that the accessibility relation R is reflexive. The connection between them is that both relied on the
More informationThis paper is also taken by Combined Studies Students. Optional Subject (i): Set Theory and Further Logic
UNIVERSITY OF LONDON BA EXAMINATION for Internal Students This paper is also taken by Combined Studies Students PHILOSOPHY Optional Subject (i): Set Theory and Further Logic Answer THREE questions, at
More informationThe semantics of propositional logic
The semantics of propositional logic Readings: Sections 1.3 and 1.4 of Huth and Ryan. In this module, we will nail down the formal definition of a logical formula, and describe the semantics of propositional
More informationRelations. Carl Pollard. October 11, Department of Linguistics Ohio State University
Department of Linguistics Ohio State University October 11, 2011 (Intuitive Idea) Intuitively, a relation is the kind of thing that either holds or doesn t hold between certain things. Examples: Being
More informationInformal Statement Calculus
FOUNDATIONS OF MATHEMATICS Branches of Logic 1. Theory of Computations (i.e. Recursion Theory). 2. Proof Theory. 3. Model Theory. 4. Set Theory. Informal Statement Calculus STATEMENTS AND CONNECTIVES Example
More informationMONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC
Bulletin of the Section of Logic Volume 45:3/4 (2016), pp. 143 153 http://dx.doi.org/10.18778/0138-0680.45.3.4.01 Anna Glenszczyk MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC Abstract We investigate
More information