An arithmetical hierarchy in propositional dynamic logic

DOI10.1016/0890-5401(89)90033-3zbMath0671.03022OpenAlexW2041330005MaRDI QIDQ1119628

Sorin Istrail

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90033-3

zbMATH Keywords

expressive powerarithmetical hierarchytestspropositional dynamic logicKleene-Mostowski hierarchyalternation of modalitiesBerman-Paterson theorem

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Cites Work

• Propositional dynamic logic is weaker without tests
• Propositional dynamic logic of regular programs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An arithmetical hierarchy in propositional dynamic logic