A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic

05/15/2019
by   Simon Docherty, et al.
0

We define a infinitary labelled sequent calculus for PDL, G3PDL^∞. A finitarily representable cyclic system, G3PDL^ω, is then given. We show that both are sound and complete with respect to standard models of PDL and, further, that G3PDL^∞ is cut-free complete. We additionally investigate proof-search strategies in the cyclic system for the fragment of PDL without tests.

READ FULL TEXT
research
07/21/2022

A Labelled Sequent Calculus for Public Announcement Logic

Public announcement logic(PAL) is an extension of epistemic logic (EL) w...
research
03/02/2021

Focus-style proof systems and interpolation for the alternation-free μ-calculus

In this paper we introduce a cut-free sequent calculus for the alternati...
research
05/17/2022

Cyclic Proofs, Hypersequents, and Transitive Closure Logic

We propose a cut-free cyclic system for Transitive Closure Logic (TCL) b...
research
03/31/2022

4DL: a four-valued Dynamic logic and its proof-theory

Transition systems are often used to describe the behaviour of software ...
research
10/17/2018

Validating Back-links of FOLID Cyclic Pre-proofs

Cyclic pre-proofs can be represented as sets of finite tree derivations ...
research
09/01/2023

Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics

We derive an intuitionistic version of Gödel-Löb modal logic (GL) in the...
research
04/15/2019

From Linear Logic to Cyclic Sharing

We present a translation from Multiplicative Exponential Linear Logic to...

Please sign up or login with your details

Forgot password? Click here to reset