Equivalences of Inconsistency and Henkin Models
Patrick Braselmann, Peter Koepke · 2007
This article is part of a series of Mizar articles which constitute a formal proof (of a basic version) of Kurt Godel’s famous completeness theorem (K. Godel, “Die Vollstandigkeit der Axiome des logischen Funktionenkalkuls”, Monatshefte fur Mathematik und Physik 37 (1930), 349–360). The completeness theorem provides the theoretical basis for a uniform formalization of mathematics as in the Mizar project. We formalize first-order logic up to the completeness theorem as in H. D. Ebbinghaus, J. Flum, and W. Thomas, Mathematical Logic, 1984, Springer Verlag, New York Inc. The present article establishes some equivalences of inconsistency. It is proved that a countable union of consistent sets is consistent. Then the concept of a Henkin model is introduced. The contents of this article correspond to Chapter IV, par. 7 and Chapter V, par. 1 of Ebbinghaus, Flum, Thomas.