2000 character limit reached
A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic (1905.06143v2)
Published 15 May 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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.