Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem

DOI10.1016/S0019-9958(84)80055-8MaRDI QIDQ3734374zbMATH OpenFDO

Authors Peter H. Schmitt

Publication date 1984

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0019-9958(84)80055-8

zbMATH Keywords

box formulascomplete proof system for diamond formulasrecursive set of axiomsregular programs

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Abstract data types; algebraic specification (68Q65)

Recommendations

• Publication:3028985
• A system of dynamic modal logic
• scientific article; zbMATH DE number 139632
• scientific article; zbMATH DE number 4101151
• On the Completeness of Dynamic Logic

Cited in

(4)

• Inductive completeness of logics of programs
• scientific article; zbMATH DE number 4016871 (Why is no real title available?)
• Differential game logic
• Reasoning in Dynamic Logic about Program Termination

This page was built for publication: Diamond formulas: A fragment of dynamic logic with recursively enumerable validity problem

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