PP-2017-23: IPDL: a new modal logic of computation

PP-2017-23: van Benthem, Johan and Bezhanishvili, Nick and Enqvist, Sebastian (2017) IPDL: a new modal logic of computation. [Pre-print] (Submitted)

[thumbnail of 2017.IPDL.pdf]

Download (361kB) | Preview


We propose a new perspective on logics of computation by combining instantial neighborhood logic INL with bisimulation safe operations adapted from PDL and dynamic game logic. INL is a recently proposed modal logic, based on a richer extension of neighborhood semantics which permits both universal and existential quantification over individual neighborhoods. We show that a number of game constructors from game logic can be adapted to this setting to ensure invariance for instantial neighborhood bisimulations, which give the appropriate bisimulation concept for INL. We also prove that our extended logic IPDL is a conservative extension of dual-free game logic, and its semantics generalizes the monotone neighborhood semantics of game logic. Finally, we provide a sound and complete system of axioms for IPDL, and establish its finite model property and decidability.

Item Type: Pre-print
Report Nr: PP-2017-23
Series Name: Prepublication (PP) Series
Year: 2017
Subjects: Computation
Depositing User: Johan van Benthem
Date Deposited: 23 Dec 2017 13:01
Last Modified: 01 Jan 2018 14:13
URI: https://eprints.illc.uva.nl/id/eprint/1588

Actions (login required)

View Item View Item