A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic
Logic in Computer Science
2019-05-20 v2
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.
Keywords
Cite
@article{arxiv.1905.06143,
title = {A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic},
author = {Simon Docherty and Reuben N. S. Rowe},
journal= {arXiv preprint arXiv:1905.06143},
year = {2019}
}