An analysis of the constructive content of Henkin's proof of G\" odel's completeness theorem
H Herbelin, D Ilik - arXiv preprint arXiv:2401.13304, 2024 - arxiv.org
G {\" o} del's completeness theorem for classical first-order logic is one of the most basic
theorems of logic. Central to any foundational course in logic, it connects the notion of valid …
theorems of logic. Central to any foundational course in logic, it connects the notion of valid …
A bi-directional refinement algorithm for the calculus of (co) inductive constructions
The paper describes the refinement algorithm for the Calculus of (Co) Inductive
Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement …
Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement …
Binding structures as an abstract data type
W Ricciotti - Programming Languages and Systems: 24th European …, 2015 - Springer
A long line of research has been dealing with the representation, in a formal tool such as an
interactive theorem prover, of languages with binding structures (eg the lambda calculus) …
interactive theorem prover, of languages with binding structures (eg the lambda calculus) …
[PDF][PDF] An analysis of the constructive content of Henkin's proof of Gödel's completeness theorem DRAFT
H Herbelin, D Ilik - 2016 - pauillac.inria.fr
Gödel's completeness theorem for first-order logic is one of the best-known theorems of
logic. Central to any foundational course in logic, it connects the notion of valid formula to …
logic. Central to any foundational course in logic, it connects the notion of valid formula to …