scientific article; zbMATH DE number 3868597

MaRDI QIDQ3334975zbMATH OpenFDO

Authors Piotr Berman

Publication date 1983

zbMATH Keywords

deterministic programsdynamic logicrecursive procedures

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Deterministic dynamic logic is strictly weaker than dynamic logic
• Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
• scientific article; zbMATH DE number 3858392
• A nondeterministic program logic
• ON THE EXPRESSIVE POWER OF SOME DYNAMIC LOGICS

Cited in

(3)

• A simplified proof of \(DDL<DL\)
• Deterministic dynamic logic is strictly weaker than dynamic logic
• Regular dynamic logic is not interpretable in deterministic context-free dynamic logic

This page was built for publication:

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