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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Petria, M. (2007). An institutional version of Gödel’s completeness theorem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4624 LNCS, pp. 409–424). Springer Verlag. https://doi.org/10.1007/978-3-540-73859-6_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
