An Introduction to Modal Logic V
|
|
- Vivien Skinner
- 5 years ago
- Views:
Transcription
1 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 / 20
2 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 / 20
3 Introduction Axiomatic Extensions of K Axiomatic Extensions of K Marco Cerami (UPOL) Modal Logic V / 20
4 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 / 20
5 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 / 20
6 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 / 20
7 Introduction Classes of Frames Classes of Frames Marco Cerami (UPOL) Modal Logic V / 20
8 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 / 20
9 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 / 20
10 Frame Completeness and Canonical Frames Marco Cerami (UPOL) Modal Logic V / 20
11 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 / 20
12 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 / 20
13 T and the class of reflexive frames Example I: the logic T and the class of reflexive frames Marco Cerami (UPOL) Modal Logic V / 20
14 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 / 20
15 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 / 20
16 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 / 20
17 K4 and the class of transitive frames Example II: the logic K4 and the class of transitive frames Marco Cerami (UPOL) Modal Logic V / 20
18 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 / 20
19 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 / 20
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 / 20
An 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 informationModal Logic XX. Yanjing Wang
Modal Logic XX Yanjing Wang Department of Philosophy, Peking University May 6th, 2016 Advanced Modal Logic (2016 Spring) 1 Completeness A traditional view of Logic A logic Λ is a collection of formulas
More informationModal Logic XXI. Yanjing Wang
Modal Logic XXI Yanjing Wang Department of Philosophy, Peking University May 17th, 2017 Advanced Modal Logic (2017 Spring) 1 Completeness via Canonicity Soundness and completeness Definition (Soundness)
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 informationTutorial Exercises 1 (mjs)
499 Modal and Temporal Logic Autumn 2008 Tutorial Exercises 1 (mjs) 1. Suppose that Σ is closed under RM. SOLUTIONS Suppose first that Σ contains C. A derivation of K: 1. Σ (A (A B) ) B PL 2. Σ (A (A B)
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 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 informationFiltrations and Basic Proof Theory Notes for Lecture 5
Filtrations and Basic Proof Theory Notes for Lecture 5 Eric Pacuit March 13, 2012 1 Filtration Let M = W, R, V be a Kripke model. Suppose that Σ is a set of formulas closed under subformulas. We write
More informationGraph Theory and Modal Logic
Osaka University of Economics and Law (OUEL) Aug. 5, 2013 BLAST 2013 at Chapman University Contents of this Talk Contents of this Talk 1. Graphs = Kripke frames. Contents of this Talk 1. Graphs = Kripke
More informationModal Probability Logic
Modal Probability Logic ESSLLI 2014 - Logic and Probability Wes Holliday and Thomas Icard Berkeley and Stanford August 14, 2014 Wes Holliday and Thomas Icard: Modal Probability 1 References M. Fattorosi-Barnaba
More informationCanonical models for normal logics (Completeness via canonicity)
499 Modal and Temporal Logic Canonical models for normal logics (Completeness via canonicity) Marek Sergot Department of Computing Imperial College, London Autumn 2008 Further reading: B.F. Chellas, Modal
More informationoverview overview proof system for basic modal logic proof systems advanced logic lecture 8 temporal logic using temporal frames
overview advanced logic 2018 02 28 lecture 8 proof systems temporal logic using temporal frames overview proof system for basic modal logic extension: φ if φ is a tautology from prop1 proof systems temporal
More informationBasic Algebraic Logic
ELTE 2013. September Today Past 1 Universal Algebra 1 Algebra 2 Transforming Algebras... Past 1 Homomorphism 2 Subalgebras 3 Direct products 3 Varieties 1 Algebraic Model Theory 1 Term Algebras 2 Meanings
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 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 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 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 information.. Discrete Mathematics. Yi Li. June 9, Software School Fudan University. Yi Li (Fudan University) Discrete Mathematics June 9, / 15
Discrete Mathematics Yi Li Software School Fudan University June 9, 2013 Yi Li (Fudan University) Discrete Mathematics June 9, 2013 1 / 15 Review Soundness and Completeness Theorem Compactness Theorem
More informationDiscrete Mathematics
Discrete Mathematics Yi Li Software School Fudan University June 12, 2017 Yi Li (Fudan University) Discrete Mathematics June 12, 2017 1 / 16 Review Soundness and Completeness Theorem Compactness Theorem
More informationOn Hájek s Fuzzy Quantifiers Probably and Many
On Hájek s Fuzzy Quantifiers Probably and Many Petr Cintula Institute of Computer Science Academy of Sciences of the Czech Republic Lukasiewicz logic L Connectives: implication and falsum (we set ϕ = ϕ
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 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 informationMonadic GMV -algebras
Department of Algebra and Geometry Faculty of Sciences Palacký University of Olomouc Czech Republic TANCL 07, Oxford 2007 monadic structures = algebras with quantifiers = algebraic models for one-variable
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 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 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 informationMathematical Logic. Reasoning in First Order Logic. Chiara Ghidini. FBK-IRST, Trento, Italy
Reasoning in First Order Logic FBK-IRST, Trento, Italy April 12, 2013 Reasoning tasks in FOL Model checking Question: Is φ true in the interpretation I with the assignment a? Answer: Yes if I = φ[a]. No
More informationFoundations of Mathematics Worksheet 2
Foundations of Mathematics Worksheet 2 L. Pedro Poitevin June 24, 2007 1. What are the atomic truth assignments on {a 1,..., a n } that satisfy: (a) The proposition p = ((a 1 a 2 ) (a 2 a 3 ) (a n 1 a
More informationSocratic Proofs for Some Temporal Logics RESEARCH REPORT
Section of Logic and Cognitive Science Institute of Psychology Adam Mickiewicz University in Poznań Mariusz Urbański Socratic Proofs for Some Temporal Logics RESEARCH REPORT Szamarzewskiego 89, 60-589
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 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 informationPropositional Dynamic Logic
Propositional Dynamic Logic Contents 1 Introduction 1 2 Syntax and Semantics 2 2.1 Syntax................................. 2 2.2 Semantics............................... 2 3 Hilbert-style axiom system
More informationDeductive Systems. Lecture - 3
Deductive Systems Lecture - 3 Axiomatic System Axiomatic System (AS) for PL AS is based on the set of only three axioms and one rule of deduction. It is minimal in structure but as powerful as the truth
More informationModule 5 K and Equivalent Systems
Module 5 K and Equivalent Systems G. J. Mattey July 8, 2010 Contents 1 The Semantical System KI 2 1.1 Specification of KI....................................... 2 1.2 Semantical Properties and Relations
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 informationPropositional Logics and their Algebraic Equivalents
Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic
More informationGödel s Completeness Theorem
A.Miller M571 Spring 2002 Gödel s Completeness Theorem We only consider countable languages L for first order logic with equality which have only predicate symbols and constant symbols. We regard the symbols
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 informationAn Introduction to Description Logic III
An Introduction to Description Logic III Knowledge Bases and Reasoning Tasks Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014
More informationJustification logic - a short introduction
Institute of Computer Science and Applied Mathematics University of Bern Bern, Switzerland January 2013 Modal Logic A Modal Logic A A B and Modal Logic A A B B and thus Modal Logic A A B B and thus A (A
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 informationTerminating Minimal Model Generation Procedures for Propositional Modal Logics
Terminating Minimal Model Generation Procedures for Propositional Modal Logics Fabio Papacchini and Renate A. Schmidt The University of Manchester, UK Abstract. Model generation and minimal model generation
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationLogical Closure Properties of Propositional Proof Systems
of Logical of Propositional Institute of Theoretical Computer Science Leibniz University Hannover Germany Theory and Applications of Models of Computation 2008 Outline of Propositional of Definition (Cook,
More informationIntroduction to Modal and Temporal Logic
Introduction to Modal and Temporal Logic c Rajeev Goré Automated Reasoning Group Computer Sciences Laboratory Australian National University http://arp.anu.edu.au/ rpg Rajeev.Gore@anu.edu.au 6 December
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 information127: Lecture notes HT18. Week 3. D.I. Semantic and proof-theoretic approaches to consequence (LfP 1.5)
D. Axiomatic Proofs D.I. Semantic and proof-theoretic approaches to consequence (LfP 1.5) Question. When is a conclusion φ a logical consequence of a set of premisses Γ? Two reductive answers have been
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
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 information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
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 informationConsequence Relations of Modal Logic
Consequence Relations of Modal Logic Lauren Coe, Trey Worthington Huntingdon College BLAST 2015 January 6, 2015 Outline 1. Define six standard consequence relations of modal logic (Syntactic, Algebraic,
More informationA Logical Perspective on Mathematical Morphology
A Logical Perspective on Mathematical Morphology A MsC Thesis in Artificial Intelligence Brammert Ottens supervisors Marco Aiello Rein van den Boomgaard February 2, 2007 ii abstract In this thesis a link
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 informationLogics for Compact Hausdorff Spaces via de Vries Duality
Logics for Compact Hausdorff Spaces via de Vries Duality Thomas Santoli ILLC, Universiteit van Amsterdam June 16, 2016 Outline Main goal: developing a propositional calculus for compact Hausdorff spaces
More informationMath 267a - Propositional Proof Complexity. Lecture #1: 14 January 2002
Math 267a - Propositional Proof Complexity Lecture #1: 14 January 2002 Lecturer: Sam Buss Scribe Notes by: Robert Ellis 1 Introduction to Propositional Logic 1.1 Symbols and Definitions The language of
More informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
More informationAn Introduction to Modal Logic. Ordinary logic studies the partition of sentences1 into two categories, true and false.
An Introduction to Modal Logic Ordinary logic studies the partition of sentences1 into two categories, true and false. Modal logic investigates a finer classification. A sentence can be either necessary
More informationUNIVERSITY OF EAST ANGLIA. School of Mathematics UG End of Year Examination MATHEMATICAL LOGIC WITH ADVANCED TOPICS MTH-4D23
UNIVERSITY OF EAST ANGLIA School of Mathematics UG End of Year Examination 2003-2004 MATHEMATICAL LOGIC WITH ADVANCED TOPICS Time allowed: 3 hours Attempt Question ONE and FOUR other questions. Candidates
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 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 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 informationThe Logic of Proofs, Semantically
The Logic of Proofs, Semantically Melvin Fitting Dept. Mathematics and Computer Science Lehman College (CUNY), 250 Bedford Park Boulevard West Bronx, NY 10468-1589 e-mail: fitting@lehman.cuny.edu web page:
More informationAn Introduction to Description Logics
An Introduction to Description Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, 21.11.2013 Marco Cerami (UPOL) Description Logics 21.11.2013
More informationForcing in Lukasiewicz logic
Forcing in Lukasiewicz logic a joint work with Antonio Di Nola and George Georgescu Luca Spada lspada@unisa.it Department of Mathematics University of Salerno 3 rd MATHLOGAPS Workshop Aussois, 24 th 30
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 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 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 informationRasiowa-Sikorski proof system for the non-fregean sentential logic SCI
Rasiowa-Sikorski proof system for the non-fregean sentential logic SCI Joanna Golińska-Pilarek National Institute of Telecommunications, Warsaw, J.Golinska-Pilarek@itl.waw.pl We will present complete and
More informationON DEFINABILITY IN MULTIMODAL LOGIC
THE REVIEW OF SYMBOLIC LOGIC Volume 2, Number 3, September 2009 ON DEFINABILITY IN MULTIMODAL LOGIC JOSEPH Y. HALPERN Computer Science Department, Cornell University DOV SAMET The Faculty of Management,
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 informationMadhavan Mukund Chennai Mathematical Institute
AN INTRODUCTION TO LOGIC Madhavan Mukund Chennai Mathematical Institute E-mail: madhavan@cmiacin Abstract ese are lecture notes for an introductory course on logic aimed at graduate students in Computer
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 informationPREFERENCE SEMANTICS FOR DEONTIC LOGIC PART I SIMPLE MODELS LOU GOBLE
Logique & Analyse 183 184 (2003), 383 418 PREFERENCE SEMANTICS FOR DEONTIC LOGIC PART I SIMPLE MODELS LOU GOBLE Abstract This paper presents determination results for some deontic logics with respect to
More informationMathematical Logic. Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. Chiara Ghidini. FBK-IRST, Trento, Italy
Introduction to Reasoning and Automated Reasoning. Hilbert-style Propositional Reasoning. FBK-IRST, Trento, Italy Deciding logical consequence Problem Is there an algorithm to determine whether a formula
More informationThe Mother of All Paradoxes
The Mother of All Paradoxes Volker Halbach Truth and Intensionality Amsterdam 3rd December 2016 A theory of expressions The symbols of L are: 1. infinitely many variable symbols v 0, v 1, v 2, v 3,...
More informationInterpretability Logic
Interpretability Logic Logic and Applications, IUC, Dubrovnik vukovic@math.hr web.math.pmf.unizg.hr/ vukovic/ Department of Mathematics, Faculty of Science, University of Zagreb September, 2013 Interpretability
More informationThe Axiomatic Translation Principle for Modal Logic
The Axiomatic Translation Principle for Modal Logic RENATE A. SCHMIDT University of Manchester and ULLRICH HUSTADT University of Liverpool In this paper we present a translation principle, called the axiomatic
More informationFrom Frame Properties to Hypersequent Rules in Modal Logics
From Frame Properties to Hypersequent Rules in Modal Logics Ori Lahav School of Computer Science Tel Aviv University Tel Aviv, Israel Email: orilahav@post.tau.ac.il Abstract We provide a general method
More informationChapter 2 Core Theory
Chapter 2 Core Theory The previous chapter established that neighborhood structures with the basic propositional modal language is an interesting and well-motivated logical framework. In this chapter,
More informationPropositional and Predicate Logic - V
Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
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 informationNon-primitive recursive decidability of products of modal logics with expanding domains
Non-primitive recursive decidability of products of modal logics with expanding domains D. Gabelaia, A. Kurucz, F. Wolter and M. Zakharyaschev Department of Computer Science King s College London Strand,
More informationA Journey through the Possible Worlds of Modal Logic Lecture 1: Introduction to modal logics
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 Outline
More informationOutline. 1 Background and Aim. 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion
Outline 1 Background and Aim 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016
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 informationDe Jongh s characterization of intuitionistic propositional calculus
De Jongh s characterization of intuitionistic propositional calculus Nick Bezhanishvili Abstract In his PhD thesis [10] Dick de Jongh proved a syntactic characterization of intuitionistic propositional
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 informationSubminimal Negation. Almudena Colacito, Dick de Jongh and Ana Lucia Vargas. March 30, 2016
Subminimal Negation Almudena Colacito, Dick de Jongh and Ana Lucia Vargas March 30, 2016 Abstract Minimal Logic, i.e. intuitionistic logic without the ex falso principle, is investigated in its original
More information1 FUNDAMENTALS OF LOGIC NO.10 HERBRAND THEOREM Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 So Far Propositional Logic Logical connectives (,,, ) Truth table Tautology
More informationLogics for Belief as Maximally Plausible Possibility
Logics for Belief as Maximally Plausible Possibility Giacomo Bonanno Department of Economics, University of California, Davis, USA gfbonanno@ucdavis.edu Abstract We consider a basic logic with two primitive
More informationA NEW VERSION OF AN OLD MODAL INCOMPLETENESS THEOREM
Bulletin of the Section of Logic Volume 39:3/4 (2010), pp. 199 204 Jacob Vosmaer A NEW VERSION OF AN OLD MODAL INCOMPLETENESS THEOREM Abstract Thomason [5] showed that a certain modal logic L S4 is incomplete
More informationModal Logics. Most applications of modal logic require a refined version of basic modal logic.
Modal Logics Most applications of modal logic require a refined version of basic modal logic. Definition. A set L of formulas of basic modal logic is called a (normal) modal logic if the following closure
More informationIntroduction to Logic
Introduction to Logic Alwen Tiu The Australian National University Summer Schools in Logic and Learning 26 January 6 February 2009, Canberra Alwen Tiu (ANU) Introduction to Logic SSLL 2009 1 / 101 Logic
More informationMODAL SATISIFIABILITY IN A CONSTRAINT LOGIC ENVIRONMENT LYNETTE STEVENSON. Submitted in fulfillment of the requirements for the degree of
MODAL SATISIFIABILITY IN A CONSTRAINT LOGIC ENVIRONMENT by LYNETTE STEVENSON Submitted in fulfillment of the requirements for the degree of MASTER OF SCIENCE in the subject COMPUTER SCIENCE at the UNIVERSITY
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 informationPHIL 50 - Introduction to Logic
Truth Validity Logical Consequence Equivalence V ψ ψ φ 1, φ 2,, φ k ψ φ ψ PHIL 50 - Introduction to Logic Marcello Di Bello, Stanford University, Spring 2014 Week 2 Friday Class Overview of Key Notions
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 informationSemantics for Propositional Logic
Semantics for Propositional Logic An interpretation (also truth-assignment, valuation) of a set of propositional formulas S is a function that assigns elements of {f,t} to the propositional variables in
More information