Theoretical Computer Science
An essay in combinatory dynamic logic
Information and Computation
Logic and information flow
Reasoning about knowledge
Axiomatising the Logic of Computer Programming
Axiomatising the Logic of Computer Programming
Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Preliminary Report)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Arrow Logic with Arbitrary Intersections: Applications to Pawlak's Information Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Arrow Logic with Arbitrary Intersections: Applications to Pawlak's Information Systems
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Modal Logics for Region-based Theories of Space
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Hi-index | 0.00 |
This paper is devoted to the completeness issue of PDL_0^∩ - an iteration-free fragment of Propositional Dynamic Logic with intersection of programs. The trouble with PDL_0^∩ is that the operation of intersection is not modally definable. Using new techniques connected with rules for intersection and the notions of large and maximal programs, the paper demonstrates that the presented proof theory for PDL_0^∩ is complete for the standard Kripke semantics of PDL_0^∩.