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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of automated reasoning Jg. 58; H. 1; S. 149 - 179
Hauptverfasser:	Blanchette, Jasmin Christian, Popescu, Andrei, Traytel, Dmitriy
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Dordrecht Springer Netherlands 01.01.2017 Springer Nature B.V Springer Verlag
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!