Mathematical logic and foundations Algebraic logic Concept
Lindenbaum–Tarski algebra
Summary
The Lindenbaum–Tarski algebra of a logical theory is the set of its formulas taken up to provable equivalence, with the operations induced by the connectives. For a theory of classical propositional logic it is a Boolean algebra. It turns statements about provability into statements about an algebra, and it is the basic tool in algebraic proofs of completeness theorems.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | QC9M3Q8B8Q |
|---|---|
| URI | m2://QC9M3Q8B8Q |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03G05, 03B05 |
| Same as | |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.