The notion of cylindric algebra, invented by Alfred Tarski, arises naturally in the algebraization of 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.
Contents |
A cylindric algebra of dimension α, where α is any ordinal is an algebraic structure
such that
is a Boolean algebra, cκ a unary operator on A for every κ, and dκλ a distinguished element of A for every κ and λ, such that the following hold:
(C1) cκ0 = 0
(C2) 
(C3) 
(C4) cκcλx = cλcκx
(C5) dκκ = 1
(C6) If
, then 
(C7) If
, then 
Recently, cylindric algebras have been generalized to the many-sorted case, which allows for a better modeling of the duality between first-order formulas and terms.
No comments have been added.