Soundness and Completeness Proofs by Coinductive Methods

We show how codatatypes can be employed to produce compact, high-level proofs of key results in logic: the soundness and completeness of proof systems for variations of first-order logic. For the classical completeness result, we first establish an abstract property of possibly infinite derivation t...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of automated reasoning Vol. 58; no. 1; pp. 149 - 179
Main Authors:	Blanchette, Jasmin Christian, Popescu, Andrei, Traytel, Dmitriy
Format:	Journal Article
Language:	English
Published:	Dordrecht Springer Netherlands 01.01.2017 Springer Nature B.V Springer Verlag
Subjects:	Artificial Intelligence Automated reasoning Completeness Computer Science Derivation Flavours Logic Logic in Computer Science Mathematical Logic and Formal Languages Mathematical Logic and Foundations Nesting Specification and description languages Specifications Symbolic and Algebraic Manipulation Trees Gentian systems First-order logic Isabelle/HOL Soundness Completeness Codatatypes Proof assistants Lazy evaluation
ISSN:	0168-7433, 1573-0670
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!