Action, Failure and Free Will Choice in Epistemic stit Logic

Size: px
Start display at page:

Download "Action, Failure and Free Will Choice in Epistemic stit Logic"

Transcription

1 Action, Failure and Free Will Choice in Epistemic stit Logic Jan Broersen Department of Information and Computing Sciences Utrecht University, The Netherlands Symposium "What is really possible?" Utrecht, April 8th, 2011

2 My research interests Logics of programs, action, choice and agency (dynamic logic, stit logic, situation calculus, event calculus, BIAT, etc.) Logics of action and change (frame problem, qualification problem, non-monotonic logic, etc. ) Logics and theories of norms (deontic logic, deontic temporal logic, norm change, etc.) Logics for reasoning in game situations (multi-agent stit, CL, ATL, PDL, etc. ) Theories of action (knowingly doing, non-successful action, intentional action, attempt, responsibility, deliberate action, etc.) Theories of collective action

3 Actions in computer science In computer science a clear ontology of action is much needed: Computer scientists see actions as the basic instructions of a program Computer scientists often confuse actions, action types, effects, events, etc. Problem: if we specify that the action has a different effect, is it still the same action? Problem: if an action fails, did it have a different effect, or did another action take place? Problem: if an action is performed by another agent, is it still the same action?

4 Outline Introduction / XSTIT Action versus Choice Successful action Choice and failing action Free will action Conclusion

5 Facts and views on STIT stit is an acronym for "Seeing To It That" stit logics originate in philosophy (Belnap, Perloff, Horty) stit theory is a theory of agency and action stit logics define actions as relations between agents and effects: [a stit]ϕ means "agent a ensures the actual world is among those satisfying ϕ" stit: acting = performing a winning strategy against non-determinacy Temporal version of stit (as the present one) take temporal histories as worlds: acting = history selection So, stit may be said to add the witnesses of branching (i.e., choices by agents) to the branching time logics CTL / CTL*

6 Particulars for XSTIT We build up the semantics and the syntax ensuring we stay within the Sahlqvist class, thereby ensuring completeness (*). Effects in next states (without which we would not have (*)) Formal comparison with stit formalisms from philosophy is not straightforward: choices in XSTIT models partition next states, choices in Belnap/Horty stit models partition the current state. The XSTIT language is neither a sub- or superset of the standard temporal stit language of, e.g. Horty. We stay within normal multi-modal / two-dimensional modal logic.

7 XSTIT frame Hb2 Hb4 Hb6 Hb8 Hb1 Hb3 Hb5 Hb7 s2-choices Ag2 s5 s7 s9 s11 s3-choices Ag2 s4 s6 s8 s2-choices Ag1 s10 s3-choices Ag1 s1-choice Ag2 s2 s1-choices Ag1 s3 s1 Figure: Visualization of a partial two agent XSTIT frame

8 h-relative effectivity functions (for individual agency) E : S H Ags 2 S is an h-relative effectivity function yielding for an agent ag the set of next static states allowed by the action taken by the agent relative to a history a. if s h then E(s, h, ag) = b. succ(s, h) E(s, h, ag) c. if s E(s, h, ag) then h : s = succ(s, h ) d. if s = succ(s, h) and s h then s E(s, h, ag) e. E(s, h, ag 1 ) E(s, h, ag 2 )

9 Individual agency: XSTIT.I The XSTIT.I syntax: ϕ := p ϕ ϕ ϕ ϕ [{ag} xstit]ϕ Xϕ

10 Semantics of XSTIT.I Relative to a model M = S, H, E, π, truth s, h = ϕ of a formula ϕ in a dynamic state s, h, with s h, is defined as: s, h = p s π(p) s, h = ϕ not s, h = ϕ s, h = ϕ ψ s, h = ϕ and s, h = ψ s, h = ϕ h : if s h then s, h = ϕ s, h = Xϕ if s = succ(s, h) then s, h = ϕ s, h = [{ag} xstit]ϕ s, h : if s E(s, h, {ag}) and s h then s, h = ϕ Satisfiability, validity on a model, validity on a frame, general validity and the logic are defined as usual.

11 Hilbert style axiomatic characterization of XSTIT.I (Lin) (Sett) (XSett) (Indep) S5 for KD for each [A xstit] X ϕ Xϕ X ϕ [{ag} xstit]ϕ [{ag} xstit]ϕ X ϕ [{ag 1 } xstit]ϕ [{ag 2 } xstit]ψ ([{ag 1 } xstit]ϕ [{ag 2 } xstit]ψ) Plus the standard axioms and rules for propositional logic and normal modal operators. Note: so called deliberative stit is definable: [{ag} dxstit]ϕ def [{ag} xstit]ϕ [{ag} xstit]ϕ

12 Collective agency: XSTIT S5 for KD for each [A xstit] (Det) X ϕ Xϕ ( = SettX) [ xstit]ϕ Xϕ (Ags = XSett) [Ags xstit]ϕ X ϕ (C-Mon) [A xstit]ϕ [A B xstit]ϕ (Indep-G) [A xstit]ϕ [B xstit]ψ ([A xstit]ϕ [B xstit]ψ) for A B = Plus the standard axioms and rules for propositional logic and normal modal operators. ϕ [ xstit]ψ represents that "ϕ causes ψ"

13 Outline Introduction / XSTIT Action versus Choice Successful action Choice and failing action Free will action Conclusion

14 How to interpret independence of agency? Problem: If agent ag 1 opens the door and agent ag 2 closes the door are actions, then independence of agency does not apply to actions in general (the described actions cannot occur simultaneously). There are (at least) two closely related interpretations: 1. the actions of game forms are basic actions (ag 1 pushes to open, ag 2 pushes to close) 2. distinguish between choices and actions (exercising the choice to open the door is different from the action of opening the door)

15 Choice versus action Choices of different agents are independent, actions of different agents not necessarily Game theorists and stit theorists often talk about actions where I would prefer choices A choice can never fail to be chosen A choice can fail to produce the corresponding action How to account for choice/action success/failure? We measure success and failure against an agent s epistemic attitude towards his action

16 Outline Introduction / XSTIT Action versus Choice Successful action Choice and failing action Free will action Conclusion

17 Syntax and semantics Syntax: ϕ... := p ϕ ϕ ϕ ϕ [A xstit]ϕ Xϕ K a ϕ Semantics: M, s, h = K a ϕ s, h a s, h implies that M, s, h = ϕ

18 Epistemic frames Hb1 Hb2 Hb3 Hb4 Hb5 Hb6 Hb7 Hb8 s3-choice 1 s3-choice 2 s3-choice 3 s2-choice s4 s5 s6 s7 s8 s9 s10 s11 s1-choice 1 s1-choice 2 s3 s2 s0-choice s1 Figure: Knowingly doing in a K-extended XSTIT frame

19 XSTIT frame (repeating the earlier slide) Hb2 Hb4 Hb6 Hb8 Hb1 Hb3 Hb5 Hb7 s2-choices Ag2 s5 s7 s9 s11 s3-choices Ag2 s4 s6 s8 s2-choices Ag1 s10 s3-choices Ag1 s1-choice Ag2 s2 s1-choices Ag1 s3 s1 Figure: Visualization of a partial two agent XSTIT frame

20 Examples of (un)knowingly doing If you do not know that you carry a contagious disease, it can be that by knowingly taking a seat next to somebody you unknowingly see to it that the person is infected. By knowingly sending an you may unknowingly see to it that a server breaks down. By knowingly signing a contract you may unknowingly see to it that you loose all your money.

21 How do we express this in the logic? a objectively does p unknowingly: [a xstit]p K a [a xstit]p a does p knowingly: K a [a xstit]p objective possibility for a to see to it that p: [a xstit]p ability of a to see to it that p: K a [a xstit]p

22 Possible logical properties The following Sahlqvist axioms reflect possible logical properties of knowingly doing: (IgnCC) (XK) (Rec-Eff) (R-KS-comm) (L-KS-comm) K a [b xstit]ϕ K a [b xstit]ϕ for a b K a Xϕ K a [a xstit]ϕ K a [a xstit]ϕ [a xstit]k a ϕ K a ϕ K a ϕ K a ϕ K a ϕ

23 Derivable properties The following properties of knowingly doing are derivable: (Indep-K) (HK-confl) (Unif-Str) K a [a xstit]ϕ K b [b xstit]ψ (K a [a xstit]ϕ K b [b xstit]ψ) K a ϕ K a ϕ K a [a xstit]ϕ K a [a xstit]ϕ

24 Knowingly doing is always successful K a [a xstit]ϕ [a xstit]ϕ [a xstit]ϕ X ϕ X ϕ Xϕ How to account for failure?

25 Outline Introduction / XSTIT Action versus Choice Successful action Choice and failing action Free will action Conclusion

26 Belief frames Figure: Unsuccessful action in a B-extended XSTIT frame

27 The logic for failing action Instead of an S5 knowledge operator K a, we now use a KD45 belief operator B a Many axioms from successful action (knowingly doing) are not inherited Important: we have independence of agency for possibly failing action

28 Outline Introduction / XSTIT Action versus Choice Successful action Choice and failing action Free will action Conclusion

29 Free will action that is objectively not coerced Free will action willed action Free will action = action without coercion We define free will action as action an agent could have knowingly refrained from: [a freew ]ϕ def K a [a xstit]ϕ K a [a xstit]ϕ However, here, again, choice is necessarily successful.

30 Free will action that is subjectively not coerced [a freew]ϕ def B a [a xstit]ϕ B a [a xstit]ϕ Figure: A subjectively free will action can be objectively coerced.

31 Logical possibilities The set {[a freew]ϕ, [ xstit]ϕ} is consistent in XSTIT p + extra axioms. {[a freew ]ϕ, [ xstit]ϕ} is not consistent. The sets {[a freew]ϕ, [b freew]ϕ} and {[a freew]ϕ, [b freew] ϕ} are consistent in XSTIT p + extra axioms. What is the relation with Harry Frankfurt s argument?

32 The principle of alternative possibilities (PAP) Def: EAP = "the Existence of Alternative Possibilities" PAP: "Moral Responsibility for an action EAP for an action" Harry Frankfurt: "Moral Responsibility for an action & not EAP for an action" Conclusion: PAP is wrong So far, so good. But now from moral responsibility to compatibilsm and free choice.

33 Arguing against compatibilism Def: compatibilism = consistent (determinism, free will action) Many 1: determinism not EAP for an action Many 2: free will action EAP for an action Conclusion: compatibilism is not true

34 Using Frankfurt to argue against the argument Can Frankfurt s argument be applied to attack assertion many 2? No, because: morally responsible action free will action free will action = action the agent could have knowingly refrained from morally responsible action = action originating in an agent s will, relative to a normative (moral) system (which are independent of the existence of real alternatives)

35 So, what do we have? A non-deterministic framework (stit) The logical possibility to have a free choice for a property that is causally determined compatibilism (Yesterday I learned that I am an agnostic compatibilist) The logical possibility is not simply that agents may believe to have alternatives they have not; the theory is more subtle than that: we do not have that [a freew]ϕ B a B a [a xstit]ϕ

36 Outline Introduction / XSTIT Action versus Choice Successful action Choice and failing action Free will action Conclusion

37 Are alternative choices really possible? Maybe they are, maybe they are not, depending, e.g., on the truth of causal determinism. However, the issue may be irrelevant for deciding on the possibility of free will action. Here we have a logic with an operator for free will action, where we allow for the logical possibility that alternative histories are only possible in a specific subjective sense but not objectively (i.e., really ).

38 Thanks Thanks!

Making a Start with the stit Logic Analysis of Intentional Action

Making a Start with the stit Logic Analysis of Intentional Action J Philos Logic (2011) 40:499 530 DOI 10.1007/s10992-011-9190-6 Making a Start with the stit Logic Analysis of Intentional Action Jan M. Broersen Received: 16 November 2009 / Accepted: 17 January 2010 /

More information

Journal of Applied Logic

Journal of Applied Logic Journal of Applied Logic 9 (2011) 137 152 Contents lists available at ScienceDirect Journal of Applied Logic www.elsevier.com/locate/jal Deontic epistemic stit logic distinguishing modes of mens rea Jan

More information

A stit Logic Analysis of Morally Lucky and Legally Lucky Action Outcomes

A stit Logic Analysis of Morally Lucky and Legally Lucky Action Outcomes A stit Logic Analysis of Morally Lucky and Legally Lucky Action Outcomes Jan Broersen Abstract Moral luck is the phenomenon that agents are not always held accountable for performance of a choice that

More information

Modes of `Mens Rea' version as submitted to the Journal of Applied Logic

Modes of `Mens Rea' version as submitted to the Journal of Applied Logic Deontic Epistemic stit Logic Distinguishing Modes of `Mens Rea' version as submitted to the Journal of Applied Logic Jan Broersen May 28, 2009 Abstract Most juridical systems contain the principle that

More information

A Note on Logics of Ability

A Note on Logics of Ability A Note on Logics of Ability Eric Pacuit and Yoav Shoham May 8, 2008 This short note will discuss logical frameworks for reasoning about an agent s ability. We will sketch details of logics of can, do,

More information

A plausibility driven STIT-operator

A plausibility driven STIT-operator A plausibility driven STIT-operator Rob Franken Supervisor: dr. Jan Broersen August 27, 2013 Contents 1 Introduction 3 2 Preliminary notations and definitions 5 3 Introducing plausibility models 7 4 XSTIT

More information

Logic and Artificial Intelligence Lecture 20

Logic and Artificial Intelligence Lecture 20 Logic and Artificial Intelligence Lecture 20 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

CTL.STIT: enhancing ATL to express important multi-agent system verification properties

CTL.STIT: enhancing ATL to express important multi-agent system verification properties CTL.STIT: enhancing ATL to express important multi-agent system verification properties Jan Broersen Department of Information and Computing Sciences Utrecht University The Netherlands broersen@cs.uu.nl

More information

Meeting the Deadline: Why, When and How

Meeting the Deadline: Why, When and How Meeting the Deadline: Why, When and How Frank Dignum, Jan Broersen, Virginia Dignum and John-Jules Meyer Institute of Information and Computing Sciences Utrecht University, email: {dignum/broersen/virginia/jj}@cs.uu.nl

More information

The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract)

The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract) The Ceteris Paribus Structure of Logics of Game Forms (Extended Abstract) Davide Grossi University of Liverpool D.Grossi@liverpool.ac.uk Emiliano Lorini IRIT-CNRS, Toulouse University François Schwarzentruber

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

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

Developing Modal Tableaux and Resolution Methods via First-Order Resolution

Developing Modal Tableaux and Resolution Methods via First-Order Resolution Developing Modal Tableaux and Resolution Methods via First-Order Resolution Renate Schmidt University of Manchester Reference: Advances in Modal Logic, Vol. 6 (2006) Modal logic: Background Established

More information

Knowledge and action in labeled stit logics

Knowledge and action in labeled stit logics Knowledge and action in labeled stit logics John Horty Eric Pacuit April 10, 2014 Abstract Stit semantics supplements branching time models with an operator representing the agency of an individual in

More information

Action Types in Stit Semantics

Action Types in Stit Semantics Action Types in Stit Semantics John Horty Eric Pacuit *** DRAFT *** Version of: May 11, 2016 Contents 1 Introduction 1 2 A review of stit semantics 2 2.1 Branching time..................................

More information

Modal Logic XXI. Yanjing Wang

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

Logic and Artificial Intelligence Lecture 22

Logic and Artificial Intelligence Lecture 22 Logic and Artificial Intelligence Lecture 22 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

A Decidable Logic for Complex Contracts

A Decidable Logic for Complex Contracts A Decidable Logic for Complex Contracts Cristian Prisacariu joint work with Gerardo Schneider Precise Modeling and Analysis group (PMA), University of Oslo 21 st Nordic Workshop on Programming Theory (NWPT'09)

More information

STIT is dangerously undecidable

STIT is dangerously undecidable STIT is dangerously undecidable François Schwarzentruber and Caroline Semmling June 2, 2014 Abstract STIT is a potential logical framework to capture responsibility, counterfactual emotions and norms,

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

Epistemic Oughts in Stit Semantics. John Horty. University of Maryland

Epistemic Oughts in Stit Semantics. John Horty. University of Maryland Epistemic Oughts in Stit Semantics John Horty University of Maryland Version of: April 15, 2016 1 Outline 1. Stit semantics [α stit: A] = α (an agent) sees to it that A 2. Oughts in stit semantics 3. Some

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

CS206 Lecture 21. Modal Logic. Plan for Lecture 21. Possible World Semantics

CS206 Lecture 21. Modal Logic. Plan for Lecture 21. Possible World Semantics CS206 Lecture 21 Modal Logic G. Sivakumar Computer Science Department IIT Bombay siva@iitb.ac.in http://www.cse.iitb.ac.in/ siva Page 1 of 17 Thu, Mar 13, 2003 Plan for Lecture 21 Modal Logic Possible

More 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

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

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

Systems of modal logic

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

An Extension of BDI CTL with Functional Dependencies and Components

An Extension of BDI CTL with Functional Dependencies and Components An Extension of BDI CTL with Functional Dependencies and Components Mehdi Dastani 1 and Leendert van der Torre 2 1 Institute of Information and Computer Sciences, Utrecht University mehdi@cs.uu.nl 2 Department

More information

Combinations of Stit and Actions

Combinations of Stit and Actions Noname manuscript No. (will be inserted by the editor) Combinations of Stit and Actions Ming Xu Received: date / Accepted: date Abstract We present a simple theory of actions against the background of

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

Goal specification using temporal logic in presence of non-deterministic actions

Goal specification using temporal logic in presence of non-deterministic actions Goal specification using temporal logic in presence of non-deterministic actions Chitta Baral Matt Barry Department of Computer Sc. and Engg. Advance Tech Development Lab Arizona State University United

More information

Knowledge, Strategies, and Know-How

Knowledge, Strategies, and Know-How KR 2018, Tempe, AZ, USA Knowledge, Strategies, and Know-How Jia Tao Lafayette College Pavel Naumov Claremont McKenna College http://reasoning.eas.asu.edu/kr2018/ "!! Knowledge, Strategies, Know-How!!?!!

More information

Logics for MAS: a critical overview

Logics for MAS: a critical overview Logics for MAS: a critical overview Andreas Herzig CNRS, University of Toulouse, IRIT, France IJCAI 2013, August 9, 2013 1 / 37 Introduction 2 / 37 Introduction Multi-Agent Systems (MAS): agents with imperfect

More information

To do something else

To do something else To do something else Ju Fengkui School of Philosophy, Beijing Normal University May 21, 2016 Joint work with Jan van Eijck from Centrum Wiskunde & Informatica Outline 1 Background 2 Our ideas 3 A deontic

More information

Propositional Logic: Logical Agents (Part I)

Propositional Logic: Logical Agents (Part I) Propositional Logic: Logical Agents (Part I) This lecture topic: Propositional Logic (two lectures) Chapter 7.1-7.4 (this lecture, Part I) Chapter 7.5 (next lecture, Part II) Next lecture topic: First-order

More information

Concurrent Game Structures for Temporal STIT Logic

Concurrent Game Structures for Temporal STIT Logic Concurrent Game Structures for Temporal STIT Logic ABSTRACT Joseph Boudou IRIT Toulouse University Toulouse, France The paper introduces a new semantics for temporal STIT logic the logic of seeing to it

More information

Some Remarks on Alternating Temporal Epistemic Logic

Some Remarks on Alternating Temporal Epistemic Logic Some Remarks on Alternating Temporal Epistemic Logic Corrected version: July 2003 Wojciech Jamroga Parlevink Group, University of Twente, Netherlands Institute of Mathematics, University of Gdansk, Poland

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

How do pessimistic agents save miners? A STIT based approach

How do pessimistic agents save miners? A STIT based approach How do pessimistic agents save miners? A STIT based approach Xin Sun 1, Zohreh Baniasadi 2, Shuwen Zhou 3 1,2 Faculty of Science, Technology and Communication, University of Luxembourg, 3 School of computer

More information

Epistemic Oughts in Stit Semantics

Epistemic Oughts in Stit Semantics Epistemic Oughts in Stit Semantics John Horty *** Draft *** Version of: April 5, 2018 Contents 1 Introduction 1 2 Stit semantics 3 2.1 Branching time.................................. 3 2.2 The stit operator.................................

More information

A Propositional Dynamic Logic for Instantial Neighborhood Semantics

A Propositional Dynamic Logic for Instantial Neighborhood Semantics A Propositional Dynamic Logic for Instantial Neighborhood Semantics Johan van Benthem, Nick Bezhanishvili, Sebastian Enqvist Abstract We propose a new perspective on logics of computation by combining

More information

Modal Logic & Kripke Semantics

Modal Logic & Kripke Semantics Modal Logic & Kripke Semantics Modal logic allows one to model possible truths reasoning what is possible and what is simply not possible when we don t have complete knowledge. For example: it is possible

More information

Flat Coalgebraic Fixed Point Logics

Flat Coalgebraic Fixed Point Logics Lutz Schröder, Yde Venema: Flat Coalgebraic Fixed Point Logics 1 IFIP WG 1.3 Meeting, Etelsen, July 2010 Flat Coalgebraic Fixed Point Logics Lutz Schröder 1,2 Yde Venema 3 1 Safe and Secure Cognitive Systems,

More information

What I fail to do today, I have to do tomorrow : a logical study of the propagation of obligations

What I fail to do today, I have to do tomorrow : a logical study of the propagation of obligations What I fail to do today, I have to do tomorrow : a logical study of the propagation of obligations Jan Broersen 1 and Julien Brunel 2 broersen@cs.uu.nl brunel@irit.fr 1 Institute of Information and Computing

More information

Reasoning about Strategies: From module checking to strategy logic

Reasoning about Strategies: From module checking to strategy logic Reasoning about Strategies: From module checking to strategy logic based on joint works with Fabio Mogavero, Giuseppe Perelli, Luigi Sauro, and Moshe Y. Vardi Luxembourg September 23, 2013 Reasoning about

More information

NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM

NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM Notre Dame Journal of Formal Logic Volume 41, Number 1, 2000 NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM HILARY PUTNAM Abstract This lecture, given at Beijing University in 1984, presents

More information

Revisit summer... go to the Fitzwilliam Museum!

Revisit summer... go to the Fitzwilliam Museum! Revisit summer... go to the Fitzwilliam Museum! Faculty of Philosophy Formal Logic Lecture 5 Peter Smith Peter Smith: Formal Logic, Lecture 5 2 Outline Propositional connectives, and the assumption of

More information

Imperative Logic, Moods and Sentence Radicals

Imperative Logic, Moods and Sentence Radicals Imperative Logic, Moods and Sentence Radicals Berislav Žarnić The aim of this essay is to examine two challenges that the imperative logic poses to the received view of sentence moods. According to the

More information

Valentin Goranko Stockholm University. ESSLLI 2018 August 6-10, of 29

Valentin Goranko Stockholm University. ESSLLI 2018 August 6-10, of 29 ESSLLI 2018 course Logics for Epistemic and Strategic Reasoning in Multi-Agent Systems Lecture 5: Logics for temporal strategic reasoning with incomplete and imperfect information Valentin Goranko Stockholm

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 8: Introduction to Game Logic

Lecture 8: Introduction to Game Logic Lecture 8: Introduction to Game Logic Eric Pacuit ILLC, University of Amsterdam staff.science.uva.nl/ epacuit epacuit@science.uva.nl Lecture Date: April 6, 2006 Caput Logic, Language and Information: Social

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

Reversed Squares of Opposition in PAL and DEL

Reversed Squares of Opposition in PAL and DEL Center for Logic and Analytical Philosophy, University of Leuven lorenz.demey@hiw.kuleuven.be SQUARE 2010, Corsica Goal of the talk public announcement logic (PAL), and dynamic epistemic logic (DEL) in

More information

COMP2411 Lecture 10: Propositional Logic Programming. Note: This material is not covered in the book. Resolution Applied to Horn Clauses

COMP2411 Lecture 10: Propositional Logic Programming. Note: This material is not covered in the book. Resolution Applied to Horn Clauses COMP2411 Lecture 10: Propositional Logic Programming Note: This material is not covered in the book Consider two Horn clauses Resolution Applied to Horn Clauses p p 1... p n and q q 1... q m Suppose these

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

Basic Algebraic Logic

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

Formalizing knowledge-how

Formalizing knowledge-how Formalizing knowledge-how Tszyuen Lau & Yanjing Wang Department of Philosophy, Peking University Beijing Normal University November 29, 2014 1 Beyond knowing that 2 Knowledge-how vs. Knowledge-that 3 Our

More information

Introduction to Kleene Algebra Lecture 14 CS786 Spring 2004 March 15, 2004

Introduction to Kleene Algebra Lecture 14 CS786 Spring 2004 March 15, 2004 Introduction to Kleene Algebra Lecture 14 CS786 Spring 2004 March 15, 2004 KAT and Hoare Logic In this lecture and the next we show that KAT subsumes propositional Hoare logic (PHL). Thus the specialized

More information

Maximal Introspection of Agents

Maximal Introspection of Agents Electronic Notes in Theoretical Computer Science 70 No. 5 (2002) URL: http://www.elsevier.nl/locate/entcs/volume70.html 16 pages Maximal Introspection of Agents Thomas 1 Informatics and Mathematical Modelling

More 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

Nested Epistemic Logic Programs

Nested Epistemic Logic Programs Nested Epistemic Logic Programs Kewen Wang 1 and Yan Zhang 2 1 Griffith University, Australia k.wang@griffith.edu.au 2 University of Western Sydney yan@cit.uws.edu.au Abstract. Nested logic programs and

More information

Qualitative Action Theory

Qualitative Action Theory Qualitative Action Theory A Comparison of the Semantics of Alternating-Time Temporal Logic and the Kutschera-Belnap Approach to Agency Stefan Wölfl Institut für Informatik, Albert-Ludwigs-Universität Freiburg

More information

A Note on the Good Samaritan Paradox and the Disquotation Theory of Propositional Content a

A Note on the Good Samaritan Paradox and the Disquotation Theory of Propositional Content a A Note on the Good Samaritan Paradox and the Disquotation Theory of Propositional Content a Steven Orla Kimbrough University of Pennsylvania kimbrough@wharton.upenn.edu DEON, May 2002, London a File: deon02-good-samaritan-slides.txt.

More information

Capturing Lewis s Elusive Knowledge

Capturing Lewis s Elusive Knowledge Zhaoqing Xu Department of Philosophy, Peking University zhaoqingxu@gmail.com September 22, 2011 1 Introduction 2 Philosophical Background Dretske s Relevant Alternatives Theory Lewis s Elusive Knowledge

More information

Reasoning with Protocols under Imperfect Information

Reasoning with Protocols under Imperfect Information Reasoning with Protocols under Imperfect Information Eric Pacuit Sunil Simon September 27, 2010 Abstract Various combinations of temporal logics, epistemic and doxastic logics, and action logics have been

More information

Logics for Belief as Maximally Plausible Possibility

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

Neighborhood Semantics for Modal Logic Lecture 3

Neighborhood 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 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

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

A 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 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 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

Modal and temporal logic

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

Principles of Knowledge Representation and Reasoning

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

Seminar in Semantics: Gradation & Modality Winter 2014

Seminar in Semantics: Gradation & Modality Winter 2014 1 Subject matter Seminar in Semantics: Gradation & Modality Winter 2014 Dan Lassiter 1/8/14 Handout: Basic Modal Logic and Kratzer (1977) [M]odality is the linguistic phenomenon whereby grammar allows

More information

SKETCHY NOTES FOR WEEKS 7 AND 8

SKETCHY NOTES FOR WEEKS 7 AND 8 SKETCHY NOTES FOR WEEKS 7 AND 8 We are now ready to start work on the proof of the Completeness Theorem for first order logic. Before we start a couple of remarks are in order (1) When we studied propositional

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

Modal Logic. Introductory Lecture. Eric Pacuit. University of Maryland, College Park ai.stanford.edu/ epacuit. January 31, 2012.

Modal Logic. Introductory Lecture. Eric Pacuit. University of Maryland, College Park ai.stanford.edu/ epacuit. January 31, 2012. Modal Logic Introductory Lecture Eric Pacuit University of Maryland, College Park ai.stanford.edu/ epacuit January 31, 2012 Modal Logic 1/45 Setting the Stage Modern Modal Logic began with C.I. Lewis dissatisfaction

More information

Argumentation with Abduction

Argumentation with Abduction Argumentation with Abduction Neophytos Demetriou Dept. of Computer Science University of Cyprus Nicosia CY-1678, Cyprus nkd@cs.ucy.ac.cy Tel.: (+357) 22892673 Antonis Kakas Dept. of Computer Science University

More information

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

Neighborhood Semantics for Modal Logic Lecture 5

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

22c:145 Artificial Intelligence

22c:145 Artificial Intelligence 22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not

More information

A Logic for Reasoning about Counterfactual Emotions

A Logic for Reasoning about Counterfactual Emotions A Logic for Reasoning about Counterfactual Emotions Emiliano Lorini IRIT, Toulouse, France lorini@irit.fr François Schwarzentruber IRIT, Toulouse, France schwarze@irit.fr Abstract The aim of this work

More information

A modal logic for games with lies

A modal logic for games with lies A modal logic for games with lies Bruno Teheux University of Luxembourg The RÉNYI ULAM game A searching game with lies 1. ALICE chooses an element in {1,..., M}. 2. BOB tries to guess this number by asking

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

Intensionality. 1. Intensional Propositional Logic (IntPL).

Intensionality. 1. Intensional Propositional Logic (IntPL). Ling255: Sem and CogSci Maribel Romero April 5, 2005 1. Intensional Propositional Logic (IntPL). Intensionality Intensional PL adds some operators O to our standard PL. The crucial property of these operators

More information

Indicative conditionals

Indicative conditionals Indicative conditionals PHIL 43916 November 14, 2012 1. Three types of conditionals... 1 2. Material conditionals... 1 3. Indicatives and possible worlds... 4 4. Conditionals and adverbs of quantification...

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

Overview, cont. Overview, cont. Logistics. Optional Reference #1. Optional Reference #2. Workload and Grading

Overview, cont. Overview, cont. Logistics. Optional Reference #1. Optional Reference #2. Workload and Grading Course staff CS389L: Automated Logical Reasoning Lecture 1: ntroduction and Review of Basics şıl Dillig nstructor: şil Dillig E-mail: isil@cs.utexas.edu Office hours: Thursday after class until 6:30 pm

More information

JA-STIT: the stit way to (public) justification announcements

JA-STIT: the stit way to (public) justification announcements : the stit way to (public) justification announcements Grigory Ruhr University Bochum Bochum, 15.12.2017 Plan of the talk 1 The main subject of this talk will be the stit logic of justification announcements

More information

Logic: Propositional Logic Truth Tables

Logic: Propositional Logic Truth Tables Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06

More information

Doxastic Logic. Michael Caie

Doxastic Logic. Michael Caie Doxastic Logic Michael Caie There are at least three natural ways of interpreting the object of study of doxastic logic. On one construal, doxastic logic studies certain general features of the doxastic

More information

Objective probability-like things with and without objective indeterminism

Objective probability-like things with and without objective indeterminism Journal reference: Studies in History and Philosophy of Modern Physics 38 (2007) 626 Objective probability-like things with and without objective indeterminism László E. Szabó Theoretical Physics Research

More information

General methods in proof theory for modal logic - Lecture 1

General methods in proof theory for modal logic - Lecture 1 General methods in proof theory for modal logic - Lecture 1 Björn Lellmann and Revantha Ramanayake TU Wien Tutorial co-located with TABLEAUX 2017, FroCoS 2017 and ITP 2017 September 24, 2017. Brasilia.

More information

Notes on BAN Logic CSG 399. March 7, 2006

Notes on BAN Logic CSG 399. March 7, 2006 Notes on BAN Logic CSG 399 March 7, 2006 The wide-mouthed frog protocol, in a slightly different form, with only the first two messages, and time stamps: A S : A, {T a, B, K ab } Kas S B : {T s, A, K ab

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

The modal logic of forcing

The modal logic of forcing Joel David Hamkins New York University, Philosophy The City University of New York, Mathematics College of Staten Island of CUNY The CUNY Graduate Center London, August 5 6, 2011 This is joint work with

More information

MULTI-AGENT ONLY-KNOWING

MULTI-AGENT ONLY-KNOWING MULTI-AGENT ONLY-KNOWING Gerhard Lakemeyer Computer Science, RWTH Aachen University Germany AI, Logic, and Epistemic Planning, Copenhagen October 3, 2013 Joint work with Vaishak Belle Contents of this

More information

Correlated Information: A Logic for Multi-Partite Quantum Systems

Correlated Information: A Logic for Multi-Partite Quantum Systems Electronic Notes in Theoretical Computer Science 270 (2) (2011) 3 14 www.elsevier.com/locate/entcs Correlated Information: A Logic for Multi-Partite Quantum Systems Alexandru Baltag 1,2 Oxford University

More information

CS 4700: Foundations of Artificial Intelligence

CS 4700: Foundations of Artificial Intelligence CS 4700: Foundations of Artificial Intelligence Bart Selman selman@cs.cornell.edu Module: Knowledge, Reasoning, and Planning Part 2 Logical Agents R&N: Chapter 7 1 Illustrative example: Wumpus World (Somewhat

More information

Boolean bunched logic: its semantics and completeness

Boolean bunched logic: its semantics and completeness Boolean bunched logic: its semantics and completeness James Brotherston Programming Principles, Logic and Verification Group Dept. of Computer Science University College London, UK J.Brotherston@ucl.ac.uk

More information