Determinism and looping in combinatory PDL

DOI10.1016/0304-3975(88)90126-0zbMath0709.68581OpenAlexW2025500813MaRDI QIDQ921968

Solomon Passy, George Gargov

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90126-0

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (5)

A modal logic for cyclic repeating ⋮ Modal logic with names ⋮ A modal perspective on the computational complexity of attribute value grammar ⋮ An essay in combinatory dynamic logic ⋮ On the undecidability of logics with converse, nominals, recursion and counting

Cites Work

• An essay in combinatory dynamic logic
• PDL with data constants
• Propositional dynamic logic of regular programs
• Deterministic propositional dynamic logic: finite models, complexity, and completeness
• More on looping vs. repeating in dynamic logic
• Looping vs. repeating in dynamic logic
• Propositional dynamic logic of looping and converse is elementarily decidable
• Concurrent dynamic logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Determinism and looping in combinatory PDL