Paper Info
Title
An institutional version of Gödel's completeness theorem
Abstract
Gödel's famous result about the completeness of first order deduction can be cast in the general framework of institutions. For this we use Henkin's method of proving completeness which is very generic and has been exploited over time by producing similar proofs of completeness for various logical systems. This paper sets out a general framework with the purpose to incorporates many of these proofs as examples. As a consequence of this abstraction, the completeness theorem becomes available for many "first order" logical systems that appear in the area of logic or computer science.
Year
DOI
Venue
2007
10.1007/978-3-540-73859-6_28
CALCO
Keywords
Field
DocType
logical system,general framework,similar proof,computer science,various logical system,famous result,completeness theorem,paper set,institutional version,order deduction,first order,first order logic
Discrete mathematics,Gödel's completeness theorem,Computer science,Completeness (logic),Decidability,Model theory,Soundness,Complete partial order,Completeness (statistics),Original proof of Gödel's completeness theorem
Conference
Volume
ISSN
Citations 
4624
0302-9743
5
PageRank 
References 
Authors
0.43
5
1
Name
Order
Citations
PageRank
Marius Petria1182.04