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 languages. We follow the proof given in [16]. The present article contains the techniques required to expand a theory such that the expanded theory co...

Full description

Bibliographic Details
Main Authors: Schlöder Julian J., Koepke Peter
Format: Article
Language:English
Published: Sciendo 2012-12-01
Series:Formalized Mathematics
Online Access:https://doi.org/10.2478/v10037-012-0023-z