An Introduction to Modal Logic V

Similar documents
An Introduction to Modal Logic III

Modal Logic XX. Yanjing Wang

Modal Logic XXI. Yanjing Wang

Systems of modal logic

Tutorial Exercises 1 (mjs)

Relations to first order logic

Modal and temporal logic

Filtrations and Basic Proof Theory Notes for Lecture 5

Graph Theory and Modal Logic

Modal Probability Logic

Canonical models for normal logics (Completeness via canonicity)

overview overview proof system for basic modal logic proof systems advanced logic lecture 8 temporal logic using temporal frames

Basic Algebraic Logic

Modal logics: an introduction

Principles of Knowledge Representation and Reasoning

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw

09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor

.. Discrete Mathematics. Yi Li. June 9, Software School Fudan University. Yi Li (Fudan University) Discrete Mathematics June 9, / 15

Discrete Mathematics

On Hájek s Fuzzy Quantifiers Probably and Many

An Introduction to Modal Logic I

Modal Logic: Exercises

Monadic GMV -algebras

ON THESES WITHOUT ITERATED MODALITIES OF MODAL LOGICS BETWEEN C1 AND S5. PART 1

Logic: The Big Picture

CHAPTER 2. FIRST ORDER LOGIC

Mathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy

Foundations of Mathematics Worksheet 2

Socratic Proofs for Some Temporal Logics RESEARCH REPORT

Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic

Modal Logic. UIT2206: The Importance of Being Formal. Martin Henz. March 19, 2014

Propositional Dynamic Logic

Deductive Systems. Lecture - 3

Module 5 K and Equivalent Systems

CHAPTER 11. Introduction to Intuitionistic Logic

Propositional Logics and their Algebraic Equivalents

Gödel s Completeness Theorem

Model Theory of Modal Logic Lecture 5. Valentin Goranko Technical University of Denmark

An Introduction to Description Logic III

Justification logic - a short introduction

Neighborhood Semantics for Modal Logic Lecture 3

Terminating Minimal Model Generation Procedures for Propositional Modal Logics

02 Propositional Logic

Logical Closure Properties of Propositional Proof Systems

Introduction to Modal and Temporal Logic

cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018

127: Lecture notes HT18. Week 3. D.I. Semantic and proof-theoretic approaches to consequence (LfP 1.5)

1. Propositional Calculus

Today. Next week. Today (cont d) Motivation - Why Modal Logic? Introduction. Ariel Jarovsky and Eyal Altshuler 8/11/07, 15/11/07

1. Propositional Calculus

Boxes and Diamonds. An Open Introduction to Modal Logic

Consequence Relations of Modal Logic

A Logical Perspective on Mathematical Morphology

Přednáška 12. Důkazové kalkuly Kalkul Hilbertova typu. 11/29/2006 Hilbertův kalkul 1

Logics for Compact Hausdorff Spaces via de Vries Duality

Math 267a - Propositional Proof Complexity. Lecture #1: 14 January 2002

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson

An Introduction to Modal Logic. Ordinary logic studies the partition of sentences1 into two categories, true and false.

UNIVERSITY OF EAST ANGLIA. School of Mathematics UG End of Year Examination MATHEMATICAL LOGIC WITH ADVANCED TOPICS MTH-4D23

Formal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University

First-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms

On the Complexity of the Reflected Logic of Proofs

The Logic of Proofs, Semantically

An Introduction to Description Logics

Forcing in Lukasiewicz logic

The Modal Logic of Pure Provability

The logic of subset spaces, topologic and the local difference modality K

Majority Logic. Introduction

Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI

ON DEFINABILITY IN MULTIMODAL LOGIC

First-Order Modal Logic and the Barcan Formula

Madhavan Mukund Chennai Mathematical Institute

Notes on Modal Logic

PREFERENCE SEMANTICS FOR DEONTIC LOGIC PART I SIMPLE MODELS LOU GOBLE

Mathematical Logic. Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. Chiara Ghidini. FBK-IRST, Trento, Italy

The Mother of All Paradoxes

Interpretability Logic

The Axiomatic Translation Principle for Modal Logic

From Frame Properties to Hypersequent Rules in Modal Logics

Chapter 2 Core Theory

Propositional and Predicate Logic - V

Advanced Topics in LP and FP

Positive provability logic

Non-primitive recursive decidability of products of modal logics with expanding domains

A Journey through the Possible Worlds of Modal Logic Lecture 1: Introduction to modal logics

Outline. 1 Background and Aim. 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion

Propositional Logic Language

De Jongh s characterization of intuitionistic propositional calculus

Lecture Notes on Classical Modal Logic

Subminimal Negation. Almudena Colacito, Dick de Jongh and Ana Lucia Vargas. March 30, 2016


Logics for Belief as Maximally Plausible Possibility

A NEW VERSION OF AN OLD MODAL INCOMPLETENESS THEOREM

Modal Logics. Most applications of modal logic require a refined version of basic modal logic.

Introduction to Logic

MODAL SATISIFIABILITY IN A CONSTRAINT LOGIC ENVIRONMENT LYNETTE STEVENSON. Submitted in fulfillment of the requirements for the degree of

Axiomatizing hybrid logic using modal logic

PHIL 50 - Introduction to Logic

Semantical study of intuitionistic modal logics

Semantics for Propositional Logic

Transcription:

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 Marco Cerami (UPOL) Modal Logic V 7.11.2013 1 / 20

Introduction Introduction we have proved that the minimal normal modal logic K is complete with respect to the class of all Kripke frames; we can do the same with some particular axiomatic extensions of K; in this case we consider particular classes of frames; these axiomatic extensions have usually been already considered in the literature before of being studied in the framework of Kripke semantics; the classes of frames are defined by particular properties of the accessibility relation; by means of the methods of canonical models, it is possible to prove a correspondence between axiomatic extensions and classes of frames. Marco Cerami (UPOL) Modal Logic V 7.11.2013 2 / 20

Introduction Axiomatic Extensions of K Axiomatic Extensions of K Marco Cerami (UPOL) Modal Logic V 7.11.2013 3 / 20

Introduction Axiomatic Extensions of K The Logic K Definition A normal modal logic Λ is a set of formulas containing: all classical tautologies (in the modal language), (p q) ( p q) (axiom (K)), p p, p p, and is closed under: (MP) Modus Ponens: if ϕ Λ and ϕ ψ Λ, then ψ Λ, (US) Uniform Substitution: if ϕ Λ, then ψ Λ, where ψ is obtained from ϕ by replacing propositional variables by arbitrary formulas, (G) Generalization: if ϕ Λ, then ϕ Λ. Marco Cerami (UPOL) Modal Logic V 7.11.2013 4 / 20

Introduction Axiomatic Extensions of K Axiomatic Extensions: axioms (4) p p (T) (B) (D) (E) (M) (G) (L) p p p p p p p p p p p p ( p p) p Marco Cerami (UPOL) Modal Logic V 7.11.2013 5 / 20

Introduction Axiomatic Extensions of K Axiomatic Extensions: logics T KT K4 K4 S4 KT 4 B KTB S5 KT 4B or KT 4E GL KL D KD D4 KD4 Marco Cerami (UPOL) Modal Logic V 7.11.2013 6 / 20

Introduction Classes of Frames Classes of Frames Marco Cerami (UPOL) Modal Logic V 7.11.2013 7 / 20

Kripke frames Introduction Classes of Frames A Kripke frame is a structure F = W, R, where: W is a non-empty set of elements, often called possible worlds, R W W is a binary relation on W, called the accessibility relation of W. d e f g h i c b a Marco Cerami (UPOL) Modal Logic V 7.11.2013 8 / 20

Classes of frames Introduction Classes of Frames R is reflexive ( x)r(x, x) R is symmetric ( x y)(r(x, y) R(y, x)) R is transitive ( x y z)(r(x, y) R(y, z) R(x, z)) R is euclidean ( x y z)(r(x, y) R(x, z) R(y, z)) R is serial ( x y)r(x, y) R is a partial function ( x y z)(r(x, y) R(x, z) y = z) R is a function R is a function and is serial R is dense ( x y)(r(x, y) ( z)(r(x, z) R(z, y))) R is Noetherian there are no infinite ascending R-chains Marco Cerami (UPOL) Modal Logic V 7.11.2013 9 / 20

Frame Completeness and Canonical Frames Marco Cerami (UPOL) Modal Logic V 7.11.2013 10 / 20

Frame Completeness We say that a formula ϕ is a (local) consequence in a class of frames F of a set of formulas Σ if for every point w of every model M on every frame F F it happens that in symbols: M, w Σ M, w ϕ Σ F ϕ For any normal modal logic Λ, we say that it is sound with respect to a class of frames F if, for any set of formulas Σ ϕ: Σ Λ ϕ Σ F ϕ For any normal modal logic Λ, we say that it is (strongly) complete with respect to a class of frames F if, for any set of formulas Σ ϕ: Σ F ϕ Σ Λ ϕ Marco Cerami (UPOL) Modal Logic V 7.11.2013 11 / 20

Remarks the soundness proof consists in proving that the axiom that extends K is sound in the class of frames considered; about completeness, consider that: Σ F ϕ Σ Λ ϕ if and only if Σ Λ ϕ Σ F ϕ So, we have to find a frame F F such that F Σ but F ϕ, under the assumption that ϕ is not deducible from Σ; if Λ is complete with respect to its canonical frame F Λ, it is enough to prove that F Λ F. Marco Cerami (UPOL) Modal Logic V 7.11.2013 12 / 20

T and the class of reflexive frames Example I: the logic T and the class of reflexive frames Marco Cerami (UPOL) Modal Logic V 7.11.2013 13 / 20

T and the class of reflexive frames T and the class of reflexive frames T is the axiomatic extension of K by means of axiom: (T ) : p p About soundness: we have already proved that the duality axioms and (K) are sound in every frame; in the same way we have proved that deductive rules (MP), (US) and (G) preserve the truth in every frame; we only need to prove that (T ) is sound in every reflexive frame. About completeness: we need to build a reflexive frame which, under the supposition that Σ T ϕ, satisfies Σ but not ϕ; we only need to prove that the canonical frame FT is reflexive. Marco Cerami (UPOL) Modal Logic V 7.11.2013 14 / 20

Soundness T and the class of reflexive frames Let F = W, R be a frame and assume that R is reflexive, let M = W, R, V be any model on F and w W, suppose that M, w p, hence ( v)(r(w, v) V (p, v)), then p is true in every point v such that R(w, v), since R is reflexive, we have that R(w, w), then p is true at point w, so, p p is true at w. Marco Cerami (UPOL) Modal Logic V 7.11.2013 15 / 20

T and the class of reflexive frames Completeness Assume that p p is a valid formula of Λ, then p p, for every maximally Λ-consistent set, hence p p is true at every point of the canonical frame F Λ = W Λ, R Λ ; let W Λ and let ϕ, by (MP), we have that ϕ, by definition of R Λ, we have that R(, ) iff {ψ : ψ } hence R(, ), so, F Λ = W Λ, R Λ is reflexive. Marco Cerami (UPOL) Modal Logic V 7.11.2013 16 / 20

K4 and the class of transitive frames Example II: the logic K4 and the class of transitive frames Marco Cerami (UPOL) Modal Logic V 7.11.2013 17 / 20

K4 and the class of transitive frames K4 and the class of transitive frames K4 is the axiomatic extension of K by means of axiom: (4) : p p About soundness: we have already proved that the duality axioms and (K) are sound in every frame; in the same way we have proved that deductive rules (MP), (US) and (G) preserve the truth in every frame; we only need to prove that (4) is sound in every transitive frame. About completeness: we need to build a transitive frame which, under the supposition that Σ T ϕ, satisfies Σ but not ϕ; we only need to prove that the canonical frame F4 is transitive. Marco Cerami (UPOL) Modal Logic V 7.11.2013 18 / 20

K4 and the class of transitive frames Soundness Let F = W, R be a frame and assume that R is transitive, let M = W, R, V be any model on F and w W, suppose that M, w p, hence ( v)(r(w, v) V (p, v)), then p is true in every point x such that R(w, x), let v, u W be any points such that R(w, v) and R(v, u), by transitivity we have that R(w, u) hence p is true at point u, then p is true at point v, therefore p is true at point w, so, p p is true at w. Marco Cerami (UPOL) Modal Logic V 7.11.2013 19 / 20

Completeness K4 and the class of transitive frames Assume that p p is a valid formula of Λ, then p p, for every maximally Λ-consistent set, hence p p is true at every point of the canonical frame F Λ = W Λ, R Λ ; let,, W Λ be such that R Λ (, ) and R Λ (, ), if ϕ, by (MP), we have that ϕ, by definition of R Λ, we have that R(, Γ) iff {ψ : ψ } Γ hence ϕ and ϕ, therefore R Λ (, ), so, F Λ = W Λ, R Λ is transitive. Marco Cerami (UPOL) Modal Logic V 7.11.2013 20 / 20