Reversed Squares of Opposition in PAL and DEL

Size: px
Start display at page:

Download "Reversed Squares of Opposition in PAL and DEL"

Transcription

1 Center for Logic and Analytical Philosophy, University of Leuven SQUARE 2010, Corsica

2 Goal of the talk public announcement logic (PAL), and dynamic epistemic logic (DEL) in general, are recent field of epistemic logic that study how knowledge changes under the influence of various actions (e.g. communication between agents) many applications in computer science (protocol security), AI (multi-agent systems), game theory (backward induction paradox), linguistics (formal semantics) etc... the goal of this talk is to connect PAL with the philosophical tradition of the square of opposition: squares/hexagons arise in a nontrivial way in PAL squares/hexagons are compact representations of the subtle relations between knowledge and dynamics studied in PAL

3 Outline of the talk 1 Public Announcement Logic and Dynamic Epistemic Logic Intuitive idea Syntax and semantics Some key validities 2 3

4 Disclaimer Intuitive idea Syntax and semantics Some key validities dynamic epistemic logic studies any type of epistemic actions (whispering, cheating, private communication etc... ) public announcement logic is a small fragment: studies only public announcements for expository reasons, we will focus on PAL everything that follows can be generalized to full DEL

5 Intuitive idea Intuitive idea Syntax and semantics Some key validities a community Ag of agents an outside source S announces that ϕ publicly and truthfully to all agents i Ag explanation: outside source: S / Ag ( S is God ) truthful: S can only announce truths, falsehoods cannot be announced (true = true before the announcement) public: each agent i Ag hears the announcement, but i also sees that the others have heard the announcement, and i sees that the others have seen that i has heard the announcement, etc...

6 Models Intuitive idea Syntax and semantics Some key validities Multi-agent Kripke model M = W, {R i } i Ag, V W : nonempty set of possible worlds R i : equivalence relation on W (for each agent i Ag) V : Prop (W ): valuation (Equivalence relations R i, so we will get S5-knowledge operators.)

7 Updating a model Intuitive idea Syntax and semantics Some key validities Take three ingredients: a multi-agent Kripke model M = W, {R i } i Ag, V a world w W a formula ϕ L If (and only if!) M, w = ϕ, we define the updated model and world M ϕ, w ϕ := W ϕ, {R ϕ i } i Ag, V ϕ, w ϕ : W ϕ := {v W M, v = ϕ} R ϕ i := R i ( W ϕ W ϕ) V ϕ (p) := V (p) W ϕ for any p Prop w ϕ := w

8 Formal language Intuitive idea Syntax and semantics Some key validities L is defined as follows ϕ ::= p ϕ ϕ ϕ K i ϕ [!ϕ]ϕ K i ϕ: agent i knows that ϕ [!ϕ]ψ: ψ is true after any public announcement of ϕ any might be an empty quantifier here: ϕ might be false and thus not announcable dually:!ϕ ψ := [!ϕ] ψ ϕ can be announced, and afterwards ψ is true

9 Semantics Intuitive idea Syntax and semantics Some key validities M, w = p iff w V (p) M, w = ϕ iff M, w = ϕ M, w = ϕ ψ iff M, w = ϕ and M, w = ψ M, w = K i ϕ iff M, v = ϕ for all v W such that wr i v M, w = [!ϕ]ψ iff if M, w = ϕ then M ϕ, w = ψ M, w =!ϕ ψ iff M, w = ϕ and M ϕ, w = ψ We say that PAL = ϕ iff M, w = ϕ for all M, w.

10 Some key validities Intuitive idea Syntax and semantics Some key validities truthfulness: PAL = ϕ!ϕ partiality: PAL =!ϕ PAL = [!ϕ]ψ!ϕ ψ (consider M, w = ϕ) functionality: PAL =!ϕ ψ [!ϕ]ψ distributivity: PAL = [!ϕ](ψ χ) ([!ϕ]ψ [!ϕ]χ) necessitation: if PAL = ψ then also PAL = [!ϕ]ψ these are all structural validities interaction of knowledge and public announcement: later

11 A failed first attempt we now start looking for squares of opposition in PAL [!ϕ] satisfies distr. and necess. normal modal operator given the modal analysis of knowledge in classical (static) epistemic logic, it is tempting to construct a square like this: but since PAL = [!ϕ]ψ!ϕ ψ, this doesn t work!

12 Building the right square but recall that we have functionality: PAL =!ϕ ψ [!ϕ]ψ, to get subalternation working in reversed order :

13 Building the right square since!ϕ ψ just abbreviates [!ϕ] ψ, we get the contradictories:

14 Building the right square!ϕ ψ and!ϕ ψ can both be false (if ϕ is false), but they cannot both be true (check the semantics!), so they are contraries:

15 Building the right square [!ϕ]ψ and [!ϕ] ψ can both be true (if ϕ is false), but they cannot both be false, so they are subcontraries:

16 Building the right square using well-known techniques from Sesmat and Blanché, we turn the square into a hexagon:

17 Building the right square but!ϕ ψ!ϕ ψ just says that ϕ is announcable at all, and thus true; similarly [!ϕ]ψ [!ϕ] ψ says that ϕ is not announcable, and thus false:

18 Summary we have constructed a square (hexagon) for public announcements in most well-known squares, implications go from the universal notion (,, K, O) to the existential notion (,, ˆK, P) in our square the implications are reversed! other relations (contradiction, contr., subcontr.) still ok the reversed square is really natural!

19 Some more validities We will now extend the hexagon constructed above with knowledge First some validities about the interaction between knowledge and public announcement: 1 PAL =!ϕ K i ψ K i [!ϕ]ψ 2 PAL = K i [!ϕ]ψ [!ϕ]k i ψ 3 PAL =!ϕ K i ψ K i [!ϕ]ψ (contrapositive of 2) 4 PAL = K i [!ϕ]ψ [!ϕ] K i ψ (contrapositive of 1)

20 Building the second square take the square/hexagon constructed above, but replace ψ with Kψ (we drop agent indices):

21 Building the second square using the four validities above, we extend the hexagon:

22 Building the second square obviously K[!ϕ]ψ and K[!ϕ]ψ are contradictory:

23 Building the second square two more contrariety relations (can both be false if ϕ false):

24 Building the second square two more subcontrariety relations (can both be true if ϕ false):

25 Summary we have extended the first (reversed) hexagon with knowledge by adding two more formulas, we obtained: four more implication (altern/subaltern) relations two more contradiction relations two more contrariety relations two more subcontrariety relations PAL provides a detailed account of the subtle interactions between knowledge and public announcement the (extended) hexagon is a compact representation of this account

26 and future work aim: connect PAL (DEL) with the rich philosophical tradition of the square of opposition our squares/hexagons are: interesting: they arise in a nontrivial way useful: compact representation of a lot of information future work: study this at higher level of abstraction partial functionality is essential for the reversed squares (also in generalization to DEL) drop the epistemic perspective altogether reversed squares for dynamic logic of (deterministic) computer programs

27 Thank you! Handout available at demey

Epistemic Informativeness

Epistemic Informativeness Epistemic Informativeness Yanjing Wang and Jie Fan Abstract In this paper, we introduce and formalize the concept of epistemic informativeness (EI) of statements: the set of new propositions that an agent

More information

The Interaction between Logic and Geometry in Aristotelian Diagrams

The Interaction between Logic and Geometry in Aristotelian Diagrams The Interaction between Logic and Geometry in Aristotelian Diagrams Lorenz Demey and Hans Smessaert Diagrams 2016 Structure of the talk 2 1 Introduction 2 Informational and Computational Equivalence 3

More information

Knowable as known after an announcement

Knowable 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 information

What is DEL good for? Alexandru Baltag. Oxford University

What is DEL good for? Alexandru Baltag. Oxford University Copenhagen 2010 ESSLLI 1 What is DEL good for? Alexandru Baltag Oxford University Copenhagen 2010 ESSLLI 2 DEL is a Method, Not a Logic! I take Dynamic Epistemic Logic () to refer to a general type of

More information

Towards A Multi-Agent Subset Space Logic

Towards A Multi-Agent Subset Space Logic Towards A Multi-Agent Subset Space Logic A Constructive Approach with Applications Department of Computer Science The Graduate Center of the City University of New York cbaskent@gc.cuny.edu www.canbaskent.net

More information

Lecture 3: Semantics of Propositional Logic

Lecture 3: Semantics of Propositional Logic Lecture 3: Semantics of Propositional Logic 1 Semantics of Propositional Logic Every language has two aspects: syntax and semantics. While syntax deals with the form or structure of the language, it is

More information

Logics For Epistemic Programs

Logics For Epistemic Programs 1 / 48 Logics For Epistemic Programs by Alexandru Baltag and Lawrence S. Moss Chang Yue Dept. of Philosophy PKU Dec. 9th, 2014 / Seminar 2 / 48 Outline 1 Introduction 2 Epistemic Updates and Our Target

More information

Yanjing Wang: An epistemic logic of knowing what

Yanjing 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 information

Aristotelian Diagrams for Semantic and Syntactic Consequence

Aristotelian Diagrams for Semantic and Syntactic Consequence Aristotelian Diagrams for Semantic and Syntactic Consequence Lorenz Demey [Accepted for publication in Synthese.] Abstract Several authors have recently studied Aristotelian diagrams for various metatheoretical

More information

Modal Dependence Logic

Modal Dependence Logic Modal Dependence Logic Jouko Väänänen Institute for Logic, Language and Computation Universiteit van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam, The Netherlands J.A.Vaananen@uva.nl Abstract We

More information

Existence and Predication in Free Logics. Secretaria de Estado de Educação do Distrito Federal, Brasil

Existence and Predication in Free Logics. Secretaria de Estado de Educação do Distrito Federal, Brasil Studia Humana Volume 6:4 (2017), pp. 3 9 DOI: 10.1515/sh-2017-0023 Guilherme Kubiszeski Existence and Predication in Free Logics Secretaria de Estado de Educação do Distrito Federal, Brasil email: guilhermefk4@gmail.com

More information

02 Propositional Logic

02 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 information

BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR

BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR Bulletin of the Section of Logic Volume 38:3/4 (2009), pp. 123 133 Kordula Świȩtorzecka BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR Abstract In the presented text we shall focus on some specific

More information

Aristotelian Diagrams for Semantic and Syntactic Consequence

Aristotelian Diagrams for Semantic and Syntactic Consequence Aristotelian Diagrams for Semantic and Syntactic Consequence Lorenz Demey Abstract Various authors have recently studied Aristotelian diagrams for metatheoretical notions from logic. However, all these

More information

An Introduction to Logical Geometry. Hans Smessaert and Lorenz Demey

An Introduction to Logical Geometry. Hans Smessaert and Lorenz Demey An Introduction to Logical Geometry Hans Smessaert and Lorenz Demey Structure of the talk 2 1 General introduction Central aim of Logical Geometry Bitstrings in Logical Geometry Aristotelian relations

More information

Propositional Logic Truth-functionality Definitions Soundness Completeness Inferences. Modal Logic. Daniel Bonevac.

Propositional 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 information

Truth-Functional Logic

Truth-Functional Logic Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence

More information

arxiv: v2 [cs.lo] 10 Sep 2014

arxiv: v2 [cs.lo] 10 Sep 2014 A simple proof of the completeness ofapal Philippe Balbiani and Hans van Ditmarsch arxiv:1409.2612v2 [cs.lo] 10 Sep 2014 October 14, 2018 Abstract We provide a simple proof of the completeness of arbitrary

More information

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

09 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

Notes on Modal Logic

Notes 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 information

Notes on Modal Logic

Notes 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 information

Action Models in Inquisitive Logic

Action Models in Inquisitive Logic Action Models in Inquisitive Logic MSc Thesis (Afstudeerscriptie) written by Thom van Gessel (born October 10th, 1987 in Apeldoorn, The Netherlands) under the supervision of Dr. Floris Roelofsen and Dr.

More information

Epistemic Informativeness

Epistemic Informativeness Epistemic Informativeness Yanjing Wang, Jie Fan Department of Philosophy, Peking University 2nd AWPL, Apr. 12th, 2014 Motivation Epistemic Informativeness Conclusions and future work Frege s puzzle on

More information

Modal 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 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 information

A generalization of modal definability

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 information

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 007 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence

More information

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference

Outline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 008 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence

More information

Logic: Propositional Logic (Part I)

Logic: 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 information

Description Logics. Foundations of Propositional Logic. franconi. Enrico Franconi

Description 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 information

Knowable as known after an announcement Balbiani, P.; Baltag, A.; van Ditmarsch, H.P.; Herzig, A.; Hoshi, T.; de Lima, T.

Knowable 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

TR : Public and Private Communication Are Different: Results on Relative Expressivity

TR : Public and Private Communication Are Different: Results on Relative Expressivity City University of New York CUNY) CUNY Academic Works Computer Science Technical Reports The Graduate Center 2008 TR-2008001: Public and Private Communication Are Different: Results on Relative Expressivity

More information

Adding Modal Operators to the Action Language A

Adding Modal Operators to the Action Language A Adding Modal Operators to the Action Language A Aaron Hunter Simon Fraser University Burnaby, B.C. Canada V5A 1S6 amhunter@cs.sfu.ca Abstract The action language A is a simple high-level language for describing

More information

Dynamic Logics of Knowledge and Access

Dynamic Logics of Knowledge and Access Dynamic Logics of Knowledge and Access Tomohiro Hoshi (thoshi@stanford.edu) Department of Philosophy Stanford University Eric Pacuit (e.j.pacuit@uvt.nl) Tilburg Center for Logic and Philosophy of Science

More information

Applied 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 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 information

Generalized Quantifiers Logical and Linguistic Aspects

Generalized Quantifiers Logical and Linguistic Aspects Generalized Quantifiers Logical and Linguistic Aspects Lecture 1: Formal Semantics and Generalized Quantifiers Dag Westerståhl University of Gothenburg SELLC 2010 Institute for Logic and Cognition, Sun

More information

DEL-sequents for Regression and Epistemic Planning

DEL-sequents for Regression and Epistemic Planning DEL-sequents for Regression and Epistemic Planning Guillaume Aucher To cite this version: Guillaume Aucher. DEL-sequents for Regression and Epistemic Planning. Journal of Applied Non-Classical Logics,

More information

Epistemic Logic: VI Dynamic Epistemic Logic (cont.)

Epistemic Logic: VI Dynamic Epistemic Logic (cont.) Epistemic Logic: VI Dynamic Epistemic Logic (cont.) Yanjing Wang Department of Philosophy, Peking University Oct. 26th, 2015 Two basic questions Axiomatizations via reduction A new axiomatization Recap:

More information

Modal logics: an introduction

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 information

Ambiguous Language and Differences in Beliefs

Ambiguous Language and Differences in Beliefs Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning Ambiguous Language and Differences in Beliefs Joseph Y. Halpern Computer Science Dept. Cornell

More information

A Modal Logic of Epistemic Games

A Modal Logic of Epistemic Games Submitted to Games. Pages 1-49. OPEN ACCESS games ISSN 2073-4336 www.mdpi.com/journal/games Article A Modal Logic of Epistemic Games Emiliano Lorini 1, François Schwarzentruber 1 1 Institut de Recherche

More information

Modal 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. 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 information

An Inquisitive Formalization of Interrogative Inquiry

An Inquisitive Formalization of Interrogative Inquiry An Inquisitive Formalization of Interrogative Inquiry Yacin Hamami 1 Introduction and motivation The notion of interrogative inquiry refers to the process of knowledge-seeking by questioning [5, 6]. As

More information

The predicate calculus is complete

The predicate calculus is complete The predicate calculus is complete Hans Halvorson The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c,

More information

An Introduction to Modal Logic III

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 information

Lecture Notes on Classical Modal Logic

Lecture 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 information

Syntactic Characterisations in Model Theory

Syntactic Characterisations in Model Theory Department of Mathematics Bachelor Thesis (7.5 ECTS) Syntactic Characterisations in Model Theory Author: Dionijs van Tuijl Supervisor: Dr. Jaap van Oosten June 15, 2016 Contents 1 Introduction 2 2 Preliminaries

More information

Handout: Proof of the completeness theorem

Handout: Proof of the completeness theorem MATH 457 Introduction to Mathematical Logic Spring 2016 Dr. Jason Rute Handout: Proof of the completeness theorem Gödel s Compactness Theorem 1930. For a set Γ of wffs and a wff ϕ, we have the following.

More information

CL16, 12th September 2016

CL16, 12th September 2016 CL16, 12th September 2016 for - Soft Outline for - Soft for - Soft The Problem of Anyone who utters: (S) Sherlock Holmes lives in Baker Street would not be objected against by non-philosophers. However:

More information

Inquisitive Logic. Journal of Philosophical Logic manuscript No. (will be inserted by the editor) Ivano Ciardelli Floris Roelofsen

Inquisitive Logic. Journal of Philosophical Logic manuscript No. (will be inserted by the editor) Ivano Ciardelli Floris Roelofsen Journal of Philosophical Logic manuscript No. (will be inserted by the editor) Inquisitive Logic Ivano Ciardelli Floris Roelofsen Received: 26 August 2009 / Accepted: 1 July 2010 Abstract This paper investigates

More information

Common Knowledge in Update Logics

Common Knowledge in Update Logics Common Knowledge in Update Logics Johan van Benthem, Jan van Eijck and Barteld Kooi Abstract Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups

More information

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims

INTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of

More information

T Reactive Systems: Temporal Logic LTL

T 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 information

Merging Frameworks for Interaction

Merging Frameworks for Interaction Merging Frameworks for Interaction Johan van Benthem Tomohiro Hoshi Jelle Gerbrandy Eric Pacuit March 26, 2008 1 Introduction Many logical systems today describe intelligent interacting agents over time.

More information

SOME SEMANTICS FOR A LOGICAL LANGUAGE FOR THE GAME OF DOMINOES

SOME SEMANTICS FOR A LOGICAL LANGUAGE FOR THE GAME OF DOMINOES SOME SEMANTICS FOR A LOGICAL LANGUAGE FOR THE GAME OF DOMINOES Fernando R. Velázquez-Quesada Instituto de Investigaciones en Matemáticas Aplicadas y en Sistemas Universidad Nacional Autónoma de México

More information

Relational Reasoning in Natural Language

Relational 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 information

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

Formal 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 information

Ahmad KARIMI A NON-SELF-REFERENTIAL PARADOX IN EPISTEMIC GAME THEORY

Ahmad KARIMI A NON-SELF-REFERENTIAL PARADOX IN EPISTEMIC GAME THEORY REPORTS ON MATHEMATICAL LOGIC 52 (2017), 45 56 doi:10.4467/20842589rm.17.002.7140 Ahmad KARIMI A NON-SELF-REFERENTIAL PARADOX IN EPISTEMIC GAME THEORY A b s t r a c t. The beliefs of other people about

More information

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

Today. 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 information

On the semantics and logic of declaratives and interrogatives

On the semantics and logic of declaratives and interrogatives Noname manuscript No. (will be inserted by the editor) On the semantics and logic of declaratives and interrogatives Ivano Ciardelli Jeroen Groenendijk Floris Roelofsen Received: date / Accepted: 17-9-2013

More information

1 Completeness Theorem for First Order Logic

1 Completeness Theorem for First Order Logic 1 Completeness Theorem for First Order Logic There are many proofs of the Completeness Theorem for First Order Logic. We follow here a version of Henkin s proof, as presented in the Handbook of Mathematical

More information

The Mediated Character of Immediate Inferences

The Mediated Character of Immediate Inferences Melentina Toma * The Mediated Character of Immediate Inferences Abstract: In the present article we aim to illustrate the mediated character of inferences designated as being immediate. We analyze immediate

More information

Epistemic Modals and Informational Consequence

Epistemic Modals and Informational Consequence Epistemic Modals and Informational Consequence [This is a penultimate draft. Please quote only from the published version. The paper is already available through Online First at http://www.springerlink.com/content/0039-7857]

More information

Product Update and Looking Backward

Product Update and Looking Backward Product Update and Looking Backward Audrey Yap May 21, 2006 Abstract The motivation behind this paper is to look at temporal information in models of BMS product update. That is, it may be useful to look

More information

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0.

a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0. (x 1) 2 > 0. For some problems, several sample proofs are given here. Problem 1. a. See the textbook for examples of proving logical equivalence using truth tables. b. There is a real number x for which f (x) < 0.

More information

Timo Latvala. February 4, 2004

Timo Latvala. February 4, 2004 Reactive Systems: Temporal Logic LT L Timo Latvala February 4, 2004 Reactive Systems: Temporal Logic LT L 8-1 Temporal Logics Temporal logics are currently the most widely used specification formalism

More information

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed

More information

C. Modal Propositional Logic (MPL)

C. Modal Propositional Logic (MPL) C. Modal Propositional Logic (MPL) Let s return to a bivalent setting. In this section, we ll take it for granted that PL gets the semantics and logic of and Ñ correct, and consider an extension of PL.

More information

Quantified Modal Logic and the Ontology of Physical Objects

Quantified Modal Logic and the Ontology of Physical Objects Scuola Normale Superiore Classe di Lettere e Filosofia Anno Accademico 2004-05 Tesi di Perfezionamento Quantified Modal Logic and the Ontology of Physical Objects CANDIDATO: Dott. F. Belardinelli RELATORE:

More information

Logic and Artificial Intelligence Lecture 12

Logic and Artificial Intelligence Lecture 12 Logic and Artificial Intelligence Lecture 12 Eric Pacuit Currently Visiting the Center for Formal Epistemology, CMU Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/ epacuit

More information

Handout Lecture 1: Standard Deontic Logic

Handout Lecture 1: Standard Deontic Logic Handout Lecture 1: Standard Deontic Logic Xavier Parent and Leendert van der Torre University of Luxembourg October 18, 2016 1 Introduction The topic of this handout is so-called standard deontic logic,

More information

A Survey of Topologic

A Survey of Topologic Illuminating New Directions Department of Computer Science Graduate Center, the City University of New York cbaskent@gc.cuny.edu // www.canbaskent.net/logic December 1st, 2011 - The Graduate Center Contents

More information

- 1.2 Implication P. Danziger. Implication

- 1.2 Implication P. Danziger. Implication Implication There is another fundamental type of connectives between statements, that of implication or more properly conditional statements. In English these are statements of the form If p then q or

More information

Modal Calculus of Illocutionary Logic

Modal Calculus of Illocutionary Logic 1 Andrew Schumann Belarusian State University Andrew.Schumann@gmail.com Modal Calculus of Illocutionary Logic Abstract: The aim of illocutionary logic is to explain how context can affect the meaning of

More information

A Strategic Epistemic Logic for Bounded Memory Agents

A Strategic Epistemic Logic for Bounded Memory Agents CNRS, Université de Lorraine, Nancy, France Workshop on Resource Bounded Agents Barcelona 12 August, 2015 Contents 1 Introduction 2 3 4 5 Combining Strategic and Epistemic Reasoning The goal is to develop

More information

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic

The Importance of Being Formal. Martin Henz. February 5, Propositional Logic The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets

More information

Formal Logic Lecture 11

Formal Logic Lecture 11 Faculty of Philosophy Formal Logic Lecture 11 Peter Smith Peter Smith: Formal Logic, Lecture 11 1 Outline Where next? Introducing PL trees Branching trees Peter Smith: Formal Logic, Lecture 11 2 Where

More information

Model Checking for Modal Intuitionistic Dependence Logic

Model 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 information

Modal Logic XX. Yanjing Wang

Modal 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 information

Undecidability in Epistemic Planning

Undecidability in Epistemic Planning Undecidability in Epistemic Planning Thomas Bolander, DTU Compute, Tech Univ of Denmark Joint work with: Guillaume Aucher, Univ Rennes 1 Bolander: Undecidability in Epistemic Planning p. 1/17 Introduction

More information

1. Propositions: Contrapositives and Converses

1. Propositions: Contrapositives and Converses Preliminaries 1 1. Propositions: Contrapositives and Converses Given two propositions P and Q, the statement If P, then Q is interpreted as the statement that if the proposition P is true, then the statement

More information

Model 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 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 information

Agent Communication and Belief Change

Agent Communication and Belief Change Agent Communication and Belief Change Satoshi Tojo JAIST November 30, 2014 Satoshi Tojo (JAIST) Agent Communication and Belief Change November 30, 2014 1 / 34 .1 Introduction.2 Introspective Agent.3 I

More information

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system): Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building

More information

A Dynamic-Logical Perspective on Quantum Behavior

A Dynamic-Logical Perspective on Quantum Behavior A Dynamic-Logical Perspective on Quantum Behavior A. Baltag and S. Smets Abstract In this paper we show how recent concepts from Dynamic Logic, and in particular from Dynamic Epistemic logic, can be used

More information

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008 Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency

More information

The Logic of Proofs, Semantically

The 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 information

. Modal AGM model of preference changes. Zhang Li. Peking University

. Modal AGM model of preference changes. Zhang Li. Peking University Modal AGM model of preference changes Zhang Li Peking University 20121218 1 Introduction 2 AGM framework for preference change 3 Modal AGM framework for preference change 4 Some results 5 Discussion and

More information

First Order Logic: Syntax and Semantics

First Order Logic: Syntax and Semantics irst Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Logic Recap You should already know the basics of irst Order Logic (OL) It s a prerequisite of this course!

More information

Announcements. Problem Set 1 out. Checkpoint due Monday, September 30. Remaining problems due Friday, October 4.

Announcements. Problem Set 1 out. Checkpoint due Monday, September 30. Remaining problems due Friday, October 4. Indirect Proofs Announcements Problem Set 1 out. Checkpoint due Monday, September 30. Grade determined by attempt rather than accuracy. It's okay to make mistakes we want you to give it your best effort,

More information

Understanding the Brandenburger-Keisler Belief Paradox

Understanding the Brandenburger-Keisler Belief Paradox Understanding the Brandenburger-Keisler Belief Paradox Eric Pacuit Institute of Logic, Language and Information University of Amsterdam epacuit@staff.science.uva.nl staff.science.uva.nl/ epacuit March

More information

Towards Symbolic Factual Change in Dynamic Epistemic Logic

Towards Symbolic Factual Change in Dynamic Epistemic Logic Towards Symbolic Factual Change in Dynamic Epistemic Logic Malvin Gattinger ILLC, Amsterdam July 18th 2017 ESSLLI Student Session Toulouse Are there more red or more blue points? Are there more red or

More information

INF5390 Kunstig intelligens. Logical Agents. Roar Fjellheim

INF5390 Kunstig intelligens. Logical Agents. Roar Fjellheim INF5390 Kunstig intelligens Logical Agents Roar Fjellheim Outline Knowledge-based agents The Wumpus world Knowledge representation Logical reasoning Propositional logic Wumpus agent Summary AIMA Chapter

More information

Strategic Coalitions with Perfect Recall

Strategic Coalitions with Perfect Recall Strategic Coalitions with Perfect Recall Pavel Naumov Department of Computer Science Vassar College Poughkeepsie, New York 2604 pnaumov@vassar.edu Jia Tao Department of Computer Science Lafayette College

More information

Logical Geometries and Information in the Square of Oppositions

Logical Geometries and Information in the Square of Oppositions Noname manuscript No. (will be inserted by the editor) Logical Geometries and Information in the Square of Oppositions Hans Smessaert Lorenz Demey Received: date / Accepted: date Abstract The Aristotelian

More information

Schematic Validity in Dynamic Epistemic Logic: Decidability

Schematic Validity in Dynamic Epistemic Logic: Decidability This paper has been superseded by W. H. Holliday, T. Hoshi, and T. F. Icard, III, Information dynamics and uniform substitution, Synthese, Vol. 190, 2013, 31-55. Schematic Validity in Dynamic Epistemic

More information

Classical Propositional Logic

Classical 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 information

Nonclassical logics (Nichtklassische Logiken)

Nonclassical 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 information

Logics of Rational Agency Lecture 3

Logics of Rational Agency Lecture 3 Logics of Rational Agency Lecture 3 Eric Pacuit Tilburg Institute for Logic and Philosophy of Science Tilburg Univeristy ai.stanford.edu/~epacuit July 29, 2009 Eric Pacuit: LORI, Lecture 3 1 Plan for the

More information

A simplified proof of arithmetical completeness theorem for provability logic GLP

A simplified proof of arithmetical completeness theorem for provability logic GLP A simplified proof of arithmetical completeness theorem for provability logic GLP L. Beklemishev Steklov Mathematical Institute Gubkina str. 8, 119991 Moscow, Russia e-mail: bekl@mi.ras.ru March 11, 2011

More information

The Square of Opposition in Orthomodular Logic

The Square of Opposition in Orthomodular Logic The Square of Opposition in Orthomodular Logic H. Freytes, C. de Ronde and G. Domenech Abstract. In Aristotelian logic, categorical propositions are divided in Universal Affirmative, Universal Negative,

More information