Modal logics and their semantics
|
|
- Karin Joseph
- 5 years ago
- Views:
Transcription
1 Modal logics and their semantics Joshua Sack Department of Mathematics and Statistics, California State University Long Beach California State University Dominguez Hills Feb 22, 2012
2 Relational structures Definition A finite relational structure is a pair (S,R), where S is a finite set R is a (binary) relation over S. related notions A relational structure is also known as a directed graph (graph theory) Kripke frame (modal logic) network (network theory) finite labelled transition system (computer science) automaton (computer science)
3 Logics that describe variations of graphs Two basic logics are First order logic first order logic describes a graph using quantifiers and relations. can provide a complete description of a finite graph the truths of the logic are generally undecidable (the answer to the question is φ true is some model/graph? cannot necessarily be answered in a finite number of time-steps). Modal logic modal logic describes properties of vertices in a graph using locally defined quantifiers can only express bisimulation equivalence classes of a graph (highly relevant in modeling computation) the logic is generally decidable
4 What is modal logic? Modal logic formulas ϕ are given by ϕ ::= p ϕ ϕ 1 ϕ 2 ϕ ϕ where p is an atomic proposition coming from a fixed set Φ is a formula representing falsity is negation is conjunction is necessity is possibility (disjunction) and (only if) are derived from and Example p p (related to transitivity)
5 Pointed models Whereas first-order logic describes properties of a model, modal logic describes properties of a pointed model Definition (Pointed Kripke model) A pointed Kripke model over a set Φ is a tuple ((S,R,V),s), where (S,R) is a directed graph (or Kripke frame ) V : Φ P(S) is a function assigning atomic propositions p Φ to subsets S. s S is the point The tuple (S,R,V) is called a Kripke model, and is a kind of directed vertex-labelled graph.
6 Semantics Truth is defined by a relation = between pointed models and formulas as follows: Remark M,s = p iff s V(p) M,s = (where = is the complement of =) M,s = ϕ iff M,s = ϕ M,s = ϕ ψ iff M,s = ϕ and M,s = ψ M,s = ϕ iff M,t = ϕ for all t {t srt} M,s = ϕ iff M,t = ϕ for some t {t srt}. Note: if {t srt} =, then M,s =, while M,s =
7 Example S = {s,t}, Φ = {p} s,p t, p t = s = p s = p s = p s = s =
8 Relationship to 1st order logic: Standard translation Definition (Standard translation) Let x be a first-order variable. The standard translation ST x mapping modal to first order formulas is defined as follows ST x (p) = Px (a predicate P for each proposition letter p.) ST x ( ) = x x (a symbol for inequality in 1st order lang.) ST x ( ϕ) = ST x (ϕ) ST x (ϕ ψ) = ST x (ϕ) ST x ψ ST x ( ϕ) = y(rxy ST y ϕ) ST x ( ϕ) = y(rxy ST y ϕ) Proposition For all M,s, and modal formulas ϕ, M,s = ϕ iff M = ST x (ϕ)[s].
9 Expressivity and Invariants s,p t,p For any modal formula, ϕ s = ϕ if and only if t = ϕ
10 Definition Bisimulation A bisimulation between models M = (S M,R M,V M ) and N = (S N,R N,V N ) is a relation Z S M S N obeying the constraint that if szt, then s V M (p) if and only if t V N (p) if sr M s then there exists t, such that tr N t and s Zt if tr N t then there exists s, such that sr M s and s Zt s Z t R R s t Z s Z t R R s t Z
11 Bisimulation example M s,p t,p A bisimulation between M and itself: the total Cartesian product Z = {(s,s),(s,t),(t,s),(t,t)}. N s,p t,p Largest bisimulation between N and itself: Z = {(s,s),(t,t)}. Largest bisimulation between M and N is Z =.
12 Relationship to 1st order logic: Bisimulation Let L be a first-order language with inequality unary predicates P from some set Φ, and a relation symbol R. Theorem (Van Benthem Characterization Theorem) A first-order formula α in L is invariant under bisimulation if and only if α = ST x (ϕ) for some modal formula ϕ. in other words, modal logic is the bisimulation invariant fragment of 1st order logic.
13 Definition (frame validity) Frame semantics A formula ϕ is valid in a pointed frame ((S,R),s), written (S,R),s = ϕ if and only if for all valuations V, (S,R,V),s = ϕ. A formula ϕ is valid in a frame (S,R), written (S,R) = ϕ if for all s S, (S,R),s = ϕ. Observation Modal logic with frame validity is a fragment monadic second order logic. This is because we quantify over valuations (subsets of the model). F,s = ϕ iff F = P 1... P n ST x (ϕ)[s] F = ϕ iff F = P 1... P n xst x (ϕ)
14 Definition (frame definability) Definability A modal formula ϕ defines a class of frames F if F = {F F = ϕ}. Examples F = p p iff F = xrxx (reflexivity) F = p p iff F = x y z(rxy Ryz Rxz) (transitivity) F = p p iff F = x y z(rxy Rxz Ryz) (Euclidean) But here is a modal formula that defines a class of frames that cannot be defined by a first-order logic formula: ( p p) p characterizes all frames where R is transitive and converse well-founded (there is no infinite path emanating from a point).
15 Goldblatt-Thomason Theorem Theorem A first order definable class of frames F is modally definable if and only if it is closed under each of the following: bounded morphic images generated subframes disjoint unions ultrafilter extensions. Definition (bounded morphic image) A bounded morphism from (S,R) to (S,R ) is a function f : S S, such that both of the following hold: srt implies f(s)r f(t) if f(s)r t, then there exists t, such that srt and t = f(t).
16 Goldblatt-Thomason Theorem Theorem A first order definable class of frames F is modally definable if and only if it is closed under each of the following: bounded morphic images generated subframes disjoint unions ultrafilter extensions. Definition (bounded morphic image) A bounded morphism from (S,R) to (S,R ) is a function f : S S, such that both of the following hold: srt implies f(s)r f(t) if f(s)r t, then there exists t, such that srt and t = f(t).
17 Generated submodel Definition (Generated submodel) (S,R) is a generated subframe of (S,R ) if S S, R R, and (s S and sr t) implies (t S and srt) Example a b e c d
18 Ultrafilter extensions Definition (Ultrafilter) An ultrafilter is a set F of sets in S, such that F and A F and A B implies B F (closed under superset) A,B F implies A B F (closed under finite intersection) A F or A c F (either a set or its complement is in F. Definition (Ultrafilter extension) Given a frame (S,R) its ultrafilter extension is the frame (S,R ), where S is the set of ultrafilters on S FR F if and only if {s s, srs, s X} F whenever X F.
19 Graded modal logic is given by Expressing the out-degree ϕ ::= p ϕ ϕ 1 ϕ 2 n ϕ n ϕ M,s = n ϕ if and only if for all distinct t 1,...,t n {t srt} for some i, M,t i = ϕ. M,s = n ϕ if and only if for some distinct t 1,...,t n {t srt} for all i, M,t i = ϕ. Note that n ϕ is equivalent to n ϕ ( n, n are duals) 1 ϕ is equivalent to ϕ 1 ϕ is equivalent to ϕ The out-degree is n can be expressed as n n+1.
20 Graded modal logic is given by Expressing the out-degree ϕ ::= p ϕ ϕ 1 ϕ 2 n ϕ n ϕ M,s = n ϕ if and only if for all distinct t 1,...,t n {t srt} for some i, M,t i = ϕ. M,s = n ϕ if and only if for some distinct t 1,...,t n {t srt} for all i, M,t i = ϕ. Note that n ϕ is equivalent to n ϕ ( n, n are duals) 1 ϕ is equivalent to ϕ 1 ϕ is equivalent to ϕ The out-degree is n can be expressed as n n+1.
21 Example M s,p t,p The formula 2 is false at s but true at t.
22 Additional property of graded modal logic Satisfiability of graded modal logic is decidable, The complexity of the satisfiability problem is PSPACE-complete (as is ordinary modal logic).
23 Weighted edges Weighted modal logic is given by ϕ ::= p ϕ ϕ 1 ϕ 2 a ϕ a ϕ Replace R with directed weighted edges R q with q Q. For t S, let P s (t) = q where sr q t For T S, let P s (T) = {t T q. sr qt} P s(t). Then M,s = a ϕ if and only if for all T S, such that P s (T) a, for some t T, M,t = ϕ. M,s = a ϕ if and only if for some T S, such that P s (T) a, for all t T, M,t = ϕ. If q = 1 always, then this is graded modal logic. If P s (S) = 1 always, then this is modal probability logic: a ϕ is read the probability of ϕ is at least a
24 Weighted edges Weighted modal logic is given by ϕ ::= p ϕ ϕ 1 ϕ 2 a ϕ a ϕ Replace R with directed weighted edges R q with q Q. For t S, let P s (t) = q where sr q t For T S, let P s (T) = {t T q. sr qt} P s(t). Then M,s = a ϕ if and only if for all T S, such that P s (T) a, for some t T, M,t = ϕ. M,s = a ϕ if and only if for some T S, such that P s (T) a, for all t T, M,t = ϕ. If q = 1 always, then this is graded modal logic. If P s (S) = 1 always, then this is modal probability logic: a ϕ is read the probability of ϕ is at least a
25 Probability logic example 1.6 s,p t, p.4 a ϕ is read the probability of (transitioning to a state where) ϕ is at least a. a ϕ is read the probability of (transitioning to a state where) ϕ is less than a. s =.4 p.4 p s =.6 p s =.4 1 p (higher-order probabilities)
26 Linear combinations in probability logic Additivity conditions are prevalent in probability: some probability logics make linear combinations explicit as terms t Here we can express additivity: ϕ ::= p ϕ ϕ 1 ϕ 2 t a t ::= ap(ϕ) t 1 +t 2 P(ϕ ψ)+p(ϕ ψ) P(ϕ) = 0 where t = 0 is an abbreviation for (t 0) ( t 0).
27 Linear combinations in probability logic Additivity conditions are prevalent in probability: some probability logics make linear combinations explicit as terms t Here we can express additivity: ϕ ::= p ϕ ϕ 1 ϕ 2 t a t ::= ap(ϕ) t 1 +t 2 P(ϕ ψ)+p(ϕ ψ) P(ϕ) = 0 where t = 0 is an abbreviation for (t 0) ( t 0).
28 Probability logic with linear combinations example 1.6 s,p t, p.4 s = P(p).4 P( p).4 s = P(p).6 s = P(P(p) 1).4 (higher-order probabilities) s = P(p) P( p).2 s = P(p)+P( p).2 The last two examples imply that P(p) P( p) =.2.
29 Decidability Satisfiability of modal probability logic is decidable, The complexity of the satisfiability problem is PSPACE-complete (as is ordinary and graded modal logics).
30 Topological semantics Replace the relation with a topology T. Topological model: (S,T,V) M,s = ϕ if and only if for some O T, such that s O for all t O, M,t = ϕ ϕ is true in the interior of the set {t t = ϕ} M,s = ϕ if and only if for all O T, such that s O for some t O, M,t = ϕ. ϕ is true in the closure of the set {t t = ϕ} Remark Note that the quantifier pattern here is the opposite of those used for weighted modal logic (including graded modal logic and modal probability logic).
31 Topological semantics Replace the relation with a topology T. Topological model: (S,T,V) M,s = ϕ if and only if for some O T, such that s O for all t O, M,t = ϕ ϕ is true in the interior of the set {t t = ϕ} M,s = ϕ if and only if for all O T, such that s O for some t O, M,t = ϕ. ϕ is true in the closure of the set {t t = ϕ} Remark Note that the quantifier pattern here is the opposite of those used for weighted modal logic (including graded modal logic and modal probability logic).
32 Neighborhood semantics Let a neighborhood model be M = (S,R,V) where R S P(S). Let N s = {T S srt}. M,s = ϕ if and only if {t S M,t = ϕ} N s. M,s = ϕ if and only if {t S M,t = ϕ} N s. If N s is upward closed (T T and T N s implies T N s ), then M,s = ϕ if and only if for some T N s for all t T, M,t = ϕ. M,s = ϕ if and only if for all T N s for some t T, M,t = ϕ. Remark In the case of topological semantics, N s includes every set with s in its interior.
33 Neighborhood semantics Let a neighborhood model be M = (S,R,V) where R S P(S). Let N s = {T S srt}. M,s = ϕ if and only if {t S M,t = ϕ} N s. M,s = ϕ if and only if {t S M,t = ϕ} N s. If N s is upward closed (T T and T N s implies T N s ), then M,s = ϕ if and only if for some T N s for all t T, M,t = ϕ. M,s = ϕ if and only if for all T N s for some t T, M,t = ϕ. Remark In the case of topological semantics, N s includes every set with s in its interior.
34 Neighborhood semantics Let a neighborhood model be M = (S,R,V) where R S P(S). Let N s = {T S srt}. M,s = ϕ if and only if {t S M,t = ϕ} N s. M,s = ϕ if and only if {t S M,t = ϕ} N s. If N s is upward closed (T T and T N s implies T N s ), then M,s = ϕ if and only if for some T N s for all t T, M,t = ϕ. M,s = ϕ if and only if for all T N s for some t T, M,t = ϕ. Remark In the case of topological semantics, N s includes every set with s in its interior.
35 Generalizations Generalization of weighted modal logic If N s consists of all sets whose weighted edges from s add to at least a, then ϕ in the neighborhood semantics is equivalent to a ϕ in the weighed modal logic semantics. Recall that weighed modal logic generalizes graded modal logic and modal probability logic. Recall furthermore that graded modal logic generalizes standard relational modal logic. Generalization of standard relational modal logic If N s consists of all supersets of the the {t srt}, then ϕ is the same in both the neighborhood semantics and in the standard relational model semantics.
36 Generalizations Generalization of weighted modal logic If N s consists of all sets whose weighted edges from s add to at least a, then ϕ in the neighborhood semantics is equivalent to a ϕ in the weighed modal logic semantics. Recall that weighed modal logic generalizes graded modal logic and modal probability logic. Recall furthermore that graded modal logic generalizes standard relational modal logic. Generalization of standard relational modal logic If N s consists of all supersets of the the {t srt}, then ϕ is the same in both the neighborhood semantics and in the standard relational model semantics.
37 THANK YOU!
A generalization of modal definability
A generalization of modal definability Tin Perkov Polytechnic of Zagreb Abstract. Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models
More informationExistential definability of modal frame classes
Existential definability of modal frame classes Tin Perkov Polytechnic of Zagreb, Croatia tin.perkov@tvz.hr Abstract. A class of Kripke frames is called modally definable if there is a set of modal formulas
More informationAbstract model theory for extensions of modal logic
Abstract model theory for extensions of modal logic Balder ten Cate Stanford, May 13, 2008 Largely based on joint work with Johan van Benthem and Jouko Väänänen Balder ten Cate Abstract model theory for
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 informationNeighborhood Semantics for Modal Logic Lecture 4
Neighborhood Semantics for Modal Logic Lecture 4 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 16, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 4 1 Plan for the
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 informationA Note on Graded Modal Logic
A Note on Graded Modal Logic Maarten de Rijke Studia Logica, vol. 64 (2000), pp. 271 283 Abstract We introduce a notion of bisimulation for graded modal logic. Using these bisimulations the model theory
More informationBisimulation for Neighbourhood Structures
Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam
More informationGeneralizing the Goldblatt-Thomason Theorem and Modal Definability
SUVI LEHTINEN Generalizing the Goldblatt-Thomason Theorem and Modal Definability ACADEMIC DISSERTATION To be presented, with the permission of the Faculty of Information Sciences of the University of Tampere,
More informationarxiv:math/ v1 [math.lo] 5 Mar 2007
Topological Semantics and Decidability Dmitry Sustretov arxiv:math/0703106v1 [math.lo] 5 Mar 2007 March 6, 2008 Abstract It is well-known that the basic modal logic of all topological spaces is S4. However,
More informationAnnals of Pure and Applied Logic
Annals of Pure and Applied Logic 163 (2012) 1928 1939 Contents lists available at SciVerse ScienceDirect Annals of Pure and Applied Logic www.elsevier.com/locate/apal Some characterization and preservation
More informationModal Logic: Exercises
Modal Logic: Exercises KRDB FUB stream course www.inf.unibz.it/ gennari/index.php?page=nl Lecturer: R. Gennari gennari@inf.unibz.it June 6, 2010 Ex. 36 Prove the following claim. Claim 1. Uniform substitution
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 informationAxiomatisation of Hybrid Logic
Imperial College London Department of Computing Axiomatisation of Hybrid Logic by Louis Paternault Submitted in partial fulfilment of the requirements for the MSc Degree in Advanced Computing of Imperial
More informationModal 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 informationExistential Second-Order Logic and Modal Logic with Quantified Accessibility Relations
Existential Second-Order Logic and Modal Logic with Quantified Accessibility Relations preprint Lauri Hella University of Tampere Antti Kuusisto University of Bremen Abstract This article investigates
More informationNeighborhood Semantics for Modal Logic Lecture 3
Neighborhood Semantics for Modal Logic Lecture 3 Eric Pacuit ILLC, Universiteit van Amsterdam staff.science.uva.nl/ epacuit August 15, 2007 Eric Pacuit: Neighborhood Semantics, Lecture 3 1 Plan for the
More information3. Only sequences that were formed by using finitely many applications of rules 1 and 2, are propositional formulas.
1 Chapter 1 Propositional Logic Mathematical logic studies correct thinking, correct deductions of statements from other statements. Let us make it more precise. A fundamental property of a statement is
More informationCOMBINING MODAL LOGICS
15 COMBINING MODAL LOGICS Agi Kurucz 1 Introduction............................................... 1 2 Fusion of modal logics.......................................... 4 2.1 Transfer results...........................................
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 informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
More informationGoldblatt-Thomason-style Theorems for Graded Modal Language
Goldblatt-Thomason-style Theorems for Graded Modal Language Katsuhiko Sano JSPS Research Fellow Department of Humanistic Informatics, Kyoto University, Japan ILLC, Universiteit van Amsterdam Minghui Ma
More informationACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)
ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) Steve Vickers CS Theory Group Birmingham 2. Theories and models Categorical approach to many-sorted
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 informationTopics in Subset Space Logic
Topics in Subset Space Logic MSc Thesis (Afstudeerscriptie) written by Can BAŞKENT (born July 18 th, 1981 in Istanbul, Turkey) under the supervision of Eric Pacuit, and submitted to the Board of Examiners
More informationFormal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University
Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Logical preliminaries Let L 0 be a language containing a complete set of Boolean connectives, including
More informationOverview. CS389L: Automated Logical Reasoning. Lecture 7: Validity Proofs and Properties of FOL. Motivation for semantic argument method
Overview CS389L: Automated Logical Reasoning Lecture 7: Validity Proofs and Properties of FOL Agenda for today: Semantic argument method for proving FOL validity Işıl Dillig Important properties of FOL
More informationThe logic of subset spaces, topologic and the local difference modality K
The logic of subset spaces, topologic and the local difference modality K Isabel Bevort July 18, 2013 Bachelor Thesis in Mathematics Supervisor: dr. Alexandru Baltag Korteweg-De Vries Instituut voor Wiskunde
More informationIntroduction. Foundations of Computing Science. Pallab Dasgupta Professor, Dept. of Computer Sc & Engg INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR
1 Introduction Foundations of Computing Science Pallab Dasgupta Professor, Dept. of Computer Sc & Engg 2 Comments on Alan Turing s Paper "On Computable Numbers, with an Application to the Entscheidungs
More informationOn the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic
On the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic Domenico Cantone and Marianna Nicolosi Asmundo Dipartimento di Matematica e Informatica Università
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 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 informationQualifying Exam Logic August 2005
Instructions: Qualifying Exam Logic August 2005 If you signed up for Computability Theory, do two E and two C problems. If you signed up for Model Theory, do two E and two M problems. If you signed up
More informationMonotonic Modal Logics
Monotonic Modal Logics Helle Hvid Hansen Master s thesis written under the supervision of Dr. Y. Venema October 15, 2003 University of Amsterdam Faculty of Science Institute for Logic, Language and Computation
More informationTemporal logics and explicit-state model checking. Pierre Wolper Université de Liège
Temporal logics and explicit-state model checking Pierre Wolper Université de Liège 1 Topics to be covered Introducing explicit-state model checking Finite automata on infinite words Temporal Logics and
More informationMajority Logic. Introduction
Majority Logic Eric Pacuit and Samer Salame Department of Computer Science Graduate Center, City University of New York 365 5th Avenue, New York 10016 epacuit@cs.gc.cuny.edu, ssalame@gc.cuny.edu Abstract
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 informationLogics above S4 and the Lebesgue measure algebra
Logics above S4 and the Lebesgue measure algebra Tamar Lando Abstract We study the measure semantics for propositional modal logics, in which formulas are interpreted in the Lebesgue measure algebra M,
More informationModal Logic XIII. Yanjing Wang
Modal Logic XIII Yanjing Wang Department of Philosophy, Peking University Apr 16th, 2015 Advanced Modal Logic (2015 Spring) 1 Frames Frames and validity Why do we study frames? Frames as tools for analysing
More informationAutomata Theory for Presburger Arithmetic Logic
Automata Theory for Presburger Arithmetic Logic References from Introduction to Automata Theory, Languages & Computation and Constraints in Computational Logic Theory & Application Presented by Masood
More informationINSTANTIAL NEIGHBOURHOOD LOGIC
INSTANTIAL NEIGHBOURHOOD LOGIC JOHAN VAN BENTHEM, NICK BEZHANISHVILI, SEBASTIAN ENQVIST, JUNHUA YU Abstract. This paper explores a new language of neighbourhood structures where existential information
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 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 informationLogics of Strong Noncontingency arxiv: v1 [cs.lo] 15 May 2015
Logics of Strong Noncontingency arxiv:1505.03950v1 [cs.lo] 15 May 2015 Jie Fan Abstract Inspired by Hintikka s treatment of question embedding verbs in [8] and the variations of noncontingency operator,
More informationAutomata, Logic and Games: Theory and Application
Automata, Logic and Games: Theory and Application 1. Büchi Automata and S1S Luke Ong University of Oxford TACL Summer School University of Salerno, 14-19 June 2015 Luke Ong Büchi Automata & S1S 14-19 June
More informationAxiomatizing hybrid logic using modal logic
Axiomatizing hybrid logic using modal logic Ian Hodkinson Department of Computing Imperial College London London SW7 2AZ United Kingdom imh@doc.ic.ac.uk Louis Paternault 4 rue de l hôpital 74800 La Roche
More informationOverview of Today s Lecture
Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 1 Overview of Today s Lecture Administrative Stuff HW #1 grades and solutions have been posted Please make sure to work through the solutions HW
More informationCompleteness for coalgebraic µ-calculus: part 2. Fatemeh Seifan (Joint work with Sebastian Enqvist and Yde Venema)
Completeness for coalgebraic µ-calculus: part 2 Fatemeh Seifan (Joint work with Sebastian Enqvist and Yde Venema) Overview Overview Completeness of Kozen s axiomatisation of the propositional µ-calculus
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 informationReasoning with Probabilities. Eric Pacuit Joshua Sack. Outline. Basic probability logic. Probabilistic Epistemic Logic.
Reasoning with July 28, 2009 Plan for the Course Day 1: Introduction and Background Day 2: s Day 3: Dynamic s Day 4: Reasoning with Day 5: Conclusions and General Issues Probability language Let Φ be a
More informationOn the bisimulation invariant fragment of monadic Σ 1 in the finite
On the bisimulation invariant fragment of monadic Σ 1 in the finite Anuj Dawar 1 and David Janin 2 1 University of Cambridge Computer Laboratory, Cambridge CB3 0FD, UK, anuj.dawar@cl.cam.ac.uk. 2 LaBRI,
More informationIntroduction to Model Theory
Introduction to Model Theory Charles Steinhorn, Vassar College Katrin Tent, University of Münster CIRM, January 8, 2018 The three lectures Introduction to basic model theory Focus on Definability More
More informationOverview of Today s Lecture
Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 1 Overview of Today s Lecture Administrative Stuff HW #1 grades and solutions have been posted Please make sure to work through the solutions HW
More informationPropositional and Predicate Logic - II
Propositional and Predicate Logic - II Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - II WS 2016/2017 1 / 16 Basic syntax Language Propositional logic
More informationKnowable as known after an announcement
RESEARCH REPORT IRIT/RR 2008-2 FR Knowable as known after an announcement Philippe Balbiani 1 Alexandru Baltag 2 Hans van Ditmarsch 1,3 Andreas Herzig 1 Tomohiro Hoshi 4 Tiago de Lima 5 1 Équipe LILAC
More informationFuzzy and Rough Sets Part I
Fuzzy and Rough Sets Part I Decision Systems Group Brigham and Women s Hospital, Harvard Medical School Harvard-MIT Division of Health Sciences and Technology Aim Present aspects of fuzzy and rough sets.
More informationIntroduction to Neighborhood Semantics for. Modal Logic. ILLC, University of Amsterdam. January 7, 2007
Introduction to Neighborhood Semantics for Modal Logic Eric Pacuit January 7, 2007 ILLC, University of Amsterdam staff.science.uva.nl/ epacuit epacuit@science.uva.nl Introduction 1. Motivation 2. Neighborhood
More informationTheoretical Foundations of the UML
Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.
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 informationModel Checking for Modal Intuitionistic Dependence Logic
1/71 Model Checking for Modal Intuitionistic Dependence Logic Fan Yang Department of Mathematics and Statistics University of Helsinki Logical Approaches to Barriers in Complexity II Cambridge, 26-30 March,
More informationRelational dual tableaux for interval temporal logics *
Relational dual tableaux for interval temporal logics * Davide Bresolin * Joanna Golińska-Pilarek ** Ewa Orłowska ** * Department of Mathematics and Computer Science University of Udine (Italy) bresolin@dimi.uniud.it
More informationSemantics of intuitionistic propositional logic
Semantics of intuitionistic propositional logic Erik Palmgren Department of Mathematics, Uppsala University Lecture Notes for Applied Logic, Fall 2009 1 Introduction Intuitionistic logic is a weakening
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationDecidability of Order-Based Modal Logics
Decidability of Order-Based Modal Logics Xavier Caicedo 1 Departamento de Matemáticas, Universidad de los Andes, Bogotá, Colombia George Metcalfe 2, Mathematical Institute, University of Bern, Switzerland
More informationWith Question/Answer Animations. Chapter 2
With Question/Answer Animations Chapter 2 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Sequences and Summations Types of
More informationTopos Theory. Lectures 17-20: The interpretation of logic in categories. Olivia Caramello. Topos Theory. Olivia Caramello.
logic s Lectures 17-20: logic in 2 / 40 logic s Interpreting first-order logic in In Logic, first-order s are a wide class of formal s used for talking about structures of any kind (where the restriction
More informationMODAL LOGIC: A SEMANTIC PERSPECTIVE
1 MODAL LOGIC: A SEMANTIC PERSPECTIVE Patrick Blackburn and Johan van Benthem 1 Introduction................................................... 2 2 Basic modal logic................................................
More informationCharacterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic Joseph Y. Halpern Computer Science Department Cornell University, U.S.A. e-mail: halpern@cs.cornell.edu Leandro Chaves Rêgo
More informationChapter 4: Classical Propositional Semantics
Chapter 4: Classical Propositional Semantics Language : L {,,, }. Classical Semantics assumptions: TWO VALUES: there are only two logical values: truth (T) and false (F), and EXTENSIONALITY: the logical
More informationDiscrete Mathematics. W. Ethan Duckworth. Fall 2017, Loyola University Maryland
Discrete Mathematics W. Ethan Duckworth Fall 2017, Loyola University Maryland Contents 1 Introduction 4 1.1 Statements......................................... 4 1.2 Constructing Direct Proofs................................
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
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 informationSection 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.
Section 2.2 Set Operations Propositional calculus and set theory are both instances of an algebraic system called a Boolean Algebra. The operators in set theory are defined in terms of the corresponding
More informationUNITARY UNIFICATION OF S5 MODAL LOGIC AND ITS EXTENSIONS
Bulletin of the Section of Logic Volume 32:1/2 (2003), pp. 19 26 Wojciech Dzik UNITARY UNIFICATION OF S5 MODAL LOGIC AND ITS EXTENSIONS Abstract It is shown that all extensions of S5 modal logic, both
More informationCoalgebraic Lindström Theorems
Coalgebraic Lindström Theorems Alexander Kurz University of Leicester, UK Yde Venema ILLC, Amsterdam, The Netherlands Abstract We study modal Lindström theorems from a coalgebraic perspective. We provide
More informationLogics of n-ary Contact
Sofia University St. Kliment Ohridski Faculty of Mathematics and Informatics Department of Mathematical Logic and Its Applications Master Thesis Logics of n-ary Contact Ivan Zheliazkov Nikolov M.Sc. Logics
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 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 informationSolutions to Sample Problems for Midterm
Solutions to Sample Problems for Midterm Problem 1. The dual of a proposition is defined for which contains only,,. It is For a compound proposition that only uses,, as operators, we obtained the dual
More informationModel Theory of XPath on Data Trees. Part II: Binary Bisimulation and Definability
Model Theory of XPath on Data Trees. Part II: Binary Bisimulation and Definability Sergio Abriola María Emilia Descotte Santiago Figueira University of Buenos Aires Abstract We study the expressive power
More informationCounter Automata and Classical Logics for Data Words
Counter Automata and Classical Logics for Data Words Amal Dev Manuel amal@imsc.res.in Institute of Mathematical Sciences, Taramani, Chennai, India. January 31, 2012 Data Words Definition (Data Words) A
More informationINF3170 Logikk Spring Homework #8 For Friday, March 18
INF3170 Logikk Spring 2011 Homework #8 For Friday, March 18 Problems 2 6 have to do with a more explicit proof of the restricted version of the completeness theorem: if = ϕ, then ϕ. Note that, other than
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 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 informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationVietoris bisimulations
Vietoris bisimulations N. Bezhanishvili, G. Fontaine and Y. Venema July 17, 2008 Abstract Building on the fact that descriptive frames are coalgebras for the Vietoris functor on the category of Stone spaces,
More informationLogics with Counting. Ian Pratt-Hartmann School of Computer Science University of Manchester Manchester M13 9PL, UK
Logics with Counting Ian Pratt-Hartmann School of Computer Science University of Manchester Manchester M13 9PL, UK 2 Chapter 1 Introduction It is well-known that first-order logic is able to express facts
More informationCombining Propositional Dynamic Logic with Formal Concept Analysis
Proc. CS&P '06 Combining Propositional Dynamic Logic with Formal Concept Analysis (extended abstract) N.V. Shilov, N.O. Garanina, and I.S. Anureev A.P. Ershov Institute of Informatics Systems, Lavren ev
More informationBasic Model Theory for Memory Logics
Basic Model Theory for Memory Logics Carlos Areces 1, Facundo Carreiro 2, Santiago Figueira 2,3 and Sergio Mera 2 1 INRIA Nancy Grand Est, Nancy, France areces@loria.fr 2 Dto. Computación, FCEN, Universidad
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 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 informationRecall that the expression x > 3 is not a proposition. Why?
Predicates and Quantifiers Predicates and Quantifiers 1 Recall that the expression x > 3 is not a proposition. Why? Notation: We will use the propositional function notation to denote the expression "
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 informationA Tableau Calculus for Minimal Modal Model Generation
M4M 2011 A Tableau Calculus for Minimal Modal Model Generation Fabio Papacchini 1 and Renate A. Schmidt 2 School of Computer Science, University of Manchester Abstract Model generation and minimal model
More informationQuantum Logic. Joshua Sack. January 19 20, Quantum Logic. Joshua Sack. Hilbert Spaces. Ortholattices and Frames 1/86
1/86 Ortho and January 19 20, 2015 2/86 and Quantum Theory Ortho and Hilbert spaces have been used for modeling quantum systems. This is largely because wave functions live in Hilbert spaces, and Hilbert
More informationSYNTACTIC CHARACTERISATIONS OF SEMANTIC PROPERTIES
Logical Methods in Computer Science Vol. 14(1:14)2018, pp. 1 51 https://lmcs.episciences.org/ Submitted Nov. 24, 2010 Published Feb. 06, 2018 SOME MODEL THEORY FOR THE MODAL µ-calculus: SYNTACTIC CHARACTERISATIONS
More informationSyntax and Semantics of Propositional Linear Temporal Logic
Syntax and Semantics of Propositional Linear Temporal Logic 1 Defining Logics L, M, = L - the language of the logic M - a class of models = - satisfaction relation M M, ϕ L: M = ϕ is read as M satisfies
More informationSyntax. Notation Throughout, and when not otherwise said, we assume a vocabulary V = C F P.
First-Order Logic Syntax The alphabet of a first-order language is organised into the following categories. Logical connectives:,,,,, and. Auxiliary symbols:.,,, ( and ). Variables: we assume a countable
More informationT Reactive Systems: Temporal Logic LTL
Tik-79.186 Reactive Systems 1 T-79.186 Reactive Systems: Temporal Logic LTL Spring 2005, Lecture 4 January 31, 2005 Tik-79.186 Reactive Systems 2 Temporal Logics Temporal logics are currently the most
More informationKnowable as known after an announcement Balbiani, P.; Baltag, A.; van Ditmarsch, H.P.; Herzig, A.; Hoshi, T.; de Lima, T.
UvA-DARE (Digital Academic Repository) Knowable as known after an announcement Balbiani, P.; Baltag, A.; van Ditmarsch, H.P.; Herzig, A.; Hoshi, T.; de Lima, T. Published in: Review of Symbolic Logic DOI:
More information