Cited By
View all- Rubinson R(undefined)There is No Such Thing as Litigation: Access to Justice and the Realities of AdjudicationSSRN Electronic Journal10.2139/ssrn.2591393
The completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-constructive and usually presented in an informal manner. We obtain a formal and constructive completeness proof for Converse PDL by recasting a completeness proof ...
In standard Propositional Dynamic Logic (PDL) literature [D. Harel and D. Kozen and J. Tiuryn. Dynamic Logics. MIT Press, 2000; R. Goldblatt. Logics of Time and Computation. CSLI Lecture Notes 7. Stanford, 1992; P. Blackburn, M. de Rijke, and Y. Venema. ...
We give a deterministic exponential, sound and complete tableau-based satisfiability algorithm for the system of Type PDL (τPDL) [9, 8], by extending the algorithm of Goré and Widmann [6] that has been given for the case of the CPDL. The system of τPDL ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in