Determinism and Looping in Combinatory PDL

Abstract In this paper some propositional modal logics of programs are considered, based on the system CPDL (Combinatory PDL)—an extension of PDL with proper names for states. These proper names are atomic formulae which are satisfied at exactly one state, in each model. Among other things (e.g., decidability and finite-model property results) a version of Streett's conjecture that his axioms do axiomatize the infinite repeating construct repeat is established with respect to CPDL.