| Compactness Theorem |
Website Links For Theorem |
Information AboutCompactness Theorem |
| CATEGORIES ABOUT COMPACTNESS THEOREM | |
| model theory | |
| mathematical theorems | |
|
The compactness theorem for the Propositional Calculus is a result of Tychonoff's Theorem (which says that the product of Compact Space s is compact) applied to compact Stone Space s; hence the theorem's name. APPLICATIONS From the theorem it follows for instance that if some first-order sentence holds for every Field of Characteristic zero, then there exists a constant ''p'' such that the sentence holds for every field of characteristic larger than ''p''. This can be seen as follows: suppose ''S'' is the sentence under consideration. Then its negation ~''S'', together with the field axioms and the infinite series of sentences 1+1 ≠ 0, 1+1+1 ≠ 0, ... is not satisfiable by assumption. Therefore a finite subset of these sentences is not satisfiable, meaning that ''S'' holds in those fields which have large enough characteristic. Also, it follows from the theorem that any theory that has an infinite model has models of arbitrary large Cardinality . So, for instance, there are nonstandard models of Peano Arithmetic with uncountably many 'natural numbers'. The Nonstandard Analysis is another example where infinite natural numbers appear, a possibility that cannot be excluded by any Axiomatization - also a consequence of the compactness theorem. PROOFS One can prove the compactness theorem using Gödel's Completeness Theorem , which establishes that a set of sentences is satisfiable if and only if no contradiction can be proven from it. In fact, the compactness theorem is equivalent to Gödel's completeness theorem, and both are equivalent to the Ultrafilter Lemma , a weak form of the Axiom Of Choice . Since proofs are always finite and therefore involve only finitely many of the given sentences, the compactness theorem follows. Gödel originally proved the compactness theorem in just this way, but later some "purely semantic" proofs of the compactness theorem were found, i.e., proofs that refer to ''truth'' but not to ''provability''. One of those proofs relies on Ultraproduct s hinging on the axiom of choice as follows: |
|
|