Axiomatizing fixpoint logics

DOI10.1016/0020-0190(92)90175-UzbMath0749.68051OpenAlexW2081593276MaRDI QIDQ1190508

Andrzej Szałas

Publication date: 26 September 1992

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90175-u

zbMATH Keywords

fixpoint equationsmultimodal logicsfixpoint logics

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Arithmetical axiomatization of first-order temporal logic
• A complete axiomatic characterization of first-order temporal logic of linear time
• Axiomatising the logic of computer programming
• A complete logic for reasoning about programs via nonstandard model theory. II
• First-order dynamic logic
• On strictly arithmetical completeness in logics of programs
• Soundness and Completeness of an Axiom System for Program Verification

This page was built for publication: Axiomatizing fixpoint logics