Propositional dynamic logic is weaker without tests

DOI10.1016/0304-3975(81)90102-XzbMath0468.68039MaRDI QIDQ1156482

Francine Berman, Michael S. Paterson

Publication date: 1981

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

zbMATH Keywords

expressibilitytest programs

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)

Related Items (3)

An arithmetical hierarchy in propositional dynamic logic ⋮ Unnamed Item ⋮ THE EXPRESSIVE POWER OF MEMORY LOGICS

Cites Work

• Unnamed Item
• Propositional dynamic logic of regular programs

This page was built for publication: Propositional dynamic logic is weaker without tests