Axiomatizing fixpoint logics
From MaRDI portal
Publication:1190508
DOI10.1016/0020-0190(92)90175-UzbMATH Open0749.68051OpenAlexW2081593276MaRDI QIDQ1190508FDOQ1190508
Authors: 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
Recommendations
Cites Work
- First-order dynamic logic
- Soundness and Completeness of an Axiom System for Program Verification
- Title not available (Why is that?)
- A complete axiomatic characterization of first-order temporal logic of linear time
- Title not available (Why is that?)
- Arithmetical axiomatization of first-order temporal logic
- A complete logic for reasoning about programs via nonstandard model theory. II
- Axiomatising the logic of computer programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- On strictly arithmetical completeness in logics of programs
- Title not available (Why is that?)
Cited In (12)
- Title not available (Why is that?)
- Characters and fixed points in provability logic
- Modal fixed point logics
- Fixed-point extensions of first-order logic
- Title not available (Why is that?)
- FOIL axiomatized
- Optimal axiomatizations of finitely valued logics
- A Step Up in Expressiveness of Decidable Fixpoint Logics
- Evidence for Fixpoint Logic
- Axiomatization of a Denotational Semantics for First-order Logic
- A Fixpoint Semantics for Ordered Logic
- Title not available (Why is that?)
This page was built for publication: Axiomatizing fixpoint logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190508)
