One Useful Logic That Defines Its Own Truth
From MaRDI portal
Abstract: Existential fixed point logic (EFPL) is a natural fit for some applications, and the purpose of this talk is to attract attention to EFPL. The logic is also interesting in its own right as it has attractive properties. One of those properties is rather unusual: truth of formulas can be defined (given appropriate syntactic apparatus) in the logic. We mentioned that property elsewhere, and we use this opportunity to provide the proof.
Recommendations
Cites work
- A Deductive System for Existential Least Fixpoint Logic
- A lattice-theoretical fixpoint theorem and its applications
- An axiomatic basis for computer programming
- Datalog vs first-order logic
- Elementary induction on abstract structures
- Existential least fixed-point logic and its relatives
- Horn clause queries and generalizations
- scientific article; zbMATH DE number 5605141 (Why is no real title available?)
- scientific article; zbMATH DE number 4055578 (Why is no real title available?)
- scientific article; zbMATH DE number 4114627 (Why is no real title available?)
- scientific article; zbMATH DE number 4120169 (Why is no real title available?)
- scientific article; zbMATH DE number 1860676 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- Soundness and Completeness of an Axiom System for Program Verification
This page was built for publication: One Useful Logic That Defines Its Own Truth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599112)