Mathematical logic and foundations Algebraic logic Concept
Relation algebra
Summary
A relation algebra is a Boolean algebra with two more operations and a constant. They behave like composition and converse of binary relations and like the identity relation. Alfred Tarski gave the axioms in the 1940s, building on the calculus of relations of De Morgan, Peirce and Schröder. The main example is the algebra of all binary relations on a set. Relation algebras give an algebraic form of a fragment of first-order logic. Tarski and Givant showed that set theory can be formalized in this setting.
Further reading
About this page
| Tag | GQK4DSA11K |
|---|---|
| URI | m2://GQK4DSA11K |
| Kind | concept |
| Writing | W0 stub |
| MSC | 03G15 |
| Specializes | Boolean algebra |
| 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.