Propositional dynamic logic is weaker without tests

DOI10.1016/0304-3975(81)90102-XzbMATH Open0468.68039MaRDI QIDQ1156482FDOQ1156482

Authors: 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

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

Cites Work

• Propositional dynamic logic of regular programs
• Title not available (Why is that?)

Cited In (3)

• An arithmetical hierarchy in propositional dynamic logic
• The expressive power of memory logics
• A canonical model construction for iteration-free PDL with intersection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156482)