Emergent Mind
A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic
(1905.06143)
Published May 15, 2019
in
cs.LO
Abstract
We define a infinitary labelled sequent calculus for PDL, G3PDL{\infty}. A finitarily representable cyclic system, G3PDL{\omega}, is then given. We show that both are sound and complete with respect to standard models of PDL and, further, that G3PDL{\infty} is cut-free complete. We additionally investigate proof-search strategies in the cyclic system for the fragment of PDL without tests.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.