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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of automated reasoning Ročník 58; číslo 1; s. 149 - 179
Hlavní autori:	Blanchette, Jasmin Christian, Popescu, Andrei, Traytel, Dmitriy
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Dordrecht Springer Netherlands 01.01.2017 Springer Nature B.V Springer Verlag
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!