One Useful Logic That Defines Its Own Truth

DOI10.1007/978-3-540-85238-4_1zbMath1173.03306arXiv0811.0964OpenAlexW2145191051MaRDI QIDQ3599112

Andreas Blass, Yuri Gurevich

Publication date: 3 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0811.0964

Mathematics Subject Classification ID

Logic in computer science (03B70)

Uses Software

• DKAL

Cites Work

• Elementary induction on abstract structures
• Datalog vs first-order logic
• A lattice-theoretical fixpoint theorem and its applications
• Horn clause queries and generalizations
• Soundness and Completeness of an Axiom System for Program Verification
• A Deductive System for Existential Least Fixpoint Logic
• Existential least fixed-point logic and its relatives
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: One Useful Logic That Defines Its Own Truth