The notion of cylindric algebra, invented by Alfred Tarski, arises naturally in the algebraization of equational first-order logic. This is comparable to the role Boolean algebras play for propositional logic. Indeed, cylindric algebras are Boolean algebras equipped with additional cylindrification operations that model quantification and equality. They differ from polyadic algebras in that the latter do not model equality.
Contents
Definition of a cylindric algebra
A cylindric algebra of dimension
(C1)
(C2)
(C3)
(C4)
(C5)
(C6) If
(C7) If
Assuming a presentation of first-order logic without function symbols, the operator
(C1)
(C2)
(C3)
(C4)
(C5)
(C6) If
(C7) If
Generalizations
Cylindric algebras have been generalized to the case of many-sorted logic (Caleiro and Gonçalves 2006), which allows for a better modeling of the duality between first-order formulas and terms.