In mathematical logic, Lindenbaum's lemma states that any consistent theory of predicate logic can be extended to a complete consistent theory. It is used in the proof of Gödel's completeness theorem, among other places. The lemma is a special case of the ultrafilter lemma for Boolean algebras, applied to the Lindenbaum algebra of a theory.
The effective version of the lemma's statement, "every consistent computably enumerable theory can be extended to a complete consistent computably enumerable theory," fails (provided Peano Arithmetic is consistent) by Gödel's incompleteness theorem.
- Tarski, A. On Fundamental Concepts of Metamathematics, 1930.
- Crossley, J.N.; Ash, C.J.; Brickhill, C.J.; Stillwell, J.C.; Williams, N.H. (1972). What is mathematical logic?. London-Oxford-New York: Oxford University Press. p. 16. ISBN 0-19-888087-1. Zbl 0251.02001.
- University of Texas, A Causal Theory of Modal Knowledge (Including Logical and Mathematical Knowledge
|This logic-related article is a stub. You can help Wikipedia by expanding it.|