Otwarty dostęp

The Gödel Completeness Theorem for Uncountable Languages


Zacytuj

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.

eISSN:
1898-9934
ISSN:
1426-2630
Język:
Angielski
Częstotliwość wydawania:
4 razy w roku
Dziedziny czasopisma:
Computer Sciences, other, Mathematics, General Mathematics