<abstract xmlns="http://www.w3.org/1999/xhtml"><p>This article is the second in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [15] for uncountably large languages. We follow the proof given in [16]. The present article contains the techniques required to expand a theory such that the expanded theory contains witnesses and is negation faithful. Then the completeness theorem follows immediately.</p></abstract>

This article is the second in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [15] for uncountably large languages. We follow the proof given in [16]. The present article contains the techniques required to expand a theory such that the expanded theory contains witnesses and is negation faithful. Then the completeness theorem follows immediately.

The Gödel Completeness Theorem for Uncountable Languages

Mathematisches Institut, Rheinische Friedrich-Wilhelms-Universität Bonn, Endenicher Allee 60, D-53113 Bonn, Germany

Formalized Mathematics

{"article-title":"The Gödel Completeness Theorem for Uncountable Languages"}

This article is the second in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [15] for uncountably large...

The Gödel Completeness Theorem for Uncountable Languages

Publié en ligne: 02 févr. 2013

Pages: 199 - 203

DOI: https://doi.org/10.2478/v10037-012-0023-z

This content is open access.