Cylindric algebra

Short description: Algebraizes first-order logic with equality

In mathematics, the notion of cylindric algebra, developed by Alfred Tarski, arises naturally in the algebraization of first-order logic with equality. This is comparable to the role Boolean algebras play for propositional logic. 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.

Definition of a cylindric algebra

A cylindric algebra of dimension [math]\displaystyle{ \alpha }[/math] (where [math]\displaystyle{ \alpha }[/math] is any ordinal number) is an algebraic structure [math]\displaystyle{ (A,+,\cdot,-,0,1,c_\kappa,d_{\kappa\lambda})_{\kappa,\lambda\lt \alpha} }[/math] such that [math]\displaystyle{ (A,+,\cdot,-,0,1) }[/math] is a Boolean algebra, [math]\displaystyle{ c_\kappa }[/math] a unary operator on [math]\displaystyle{ A }[/math] for every [math]\displaystyle{ \kappa }[/math] (called a cylindrification), and [math]\displaystyle{ d_{\kappa\lambda} }[/math] a distinguished element of [math]\displaystyle{ A }[/math] for every [math]\displaystyle{ \kappa }[/math] and [math]\displaystyle{ \lambda }[/math] (called a diagonal), such that the following hold:

(C1) [math]\displaystyle{ c_\kappa 0=0 }[/math]

(C2) [math]\displaystyle{ x\leq c_\kappa x }[/math]

(C3) [math]\displaystyle{ c_\kappa(x\cdot c_\kappa y)=c_\kappa x\cdot c_\kappa y }[/math]

(C4) [math]\displaystyle{ c_\kappa c_\lambda x=c_\lambda c_\kappa x }[/math]

(C5) [math]\displaystyle{ d_{\kappa\kappa}=1 }[/math]

(C6) If [math]\displaystyle{ \kappa\notin\{\lambda,\mu\} }[/math], then [math]\displaystyle{ d_{\lambda\mu}=c_\kappa(d_{\lambda\kappa}\cdot d_{\kappa\mu}) }[/math]

(C7) If [math]\displaystyle{ \kappa\neq\lambda }[/math], then [math]\displaystyle{ c_\kappa(d_{\kappa\lambda}\cdot x)\cdot c_\kappa(d_{\kappa\lambda}\cdot -x)=0 }[/math]

Assuming a presentation of first-order logic without function symbols, the operator [math]\displaystyle{ c_\kappa x }[/math] models existential quantification over variable [math]\displaystyle{ \kappa }[/math] in formula [math]\displaystyle{ x }[/math] while the operator [math]\displaystyle{ d_{\kappa\lambda} }[/math] models the equality of variables [math]\displaystyle{ \kappa }[/math] and [math]\displaystyle{ \lambda }[/math]. Hence, reformulated using standard logical notations, the axioms read as

(C1) [math]\displaystyle{ \exists \kappa. \mathit{false} \iff \mathit{false} }[/math]

(C2) [math]\displaystyle{ x \implies \exists \kappa. x }[/math]

(C3) [math]\displaystyle{ \exists \kappa. (x\wedge \exists \kappa. y) \iff (\exists\kappa. x) \wedge (\exists\kappa. y) }[/math]

(C4) [math]\displaystyle{ \exists\kappa \exists\lambda. x \iff \exists \lambda \exists\kappa. x }[/math]

(C5) [math]\displaystyle{ \kappa=\kappa \iff \mathit{true} }[/math]

(C6) If [math]\displaystyle{ \kappa }[/math] is a variable different from both [math]\displaystyle{ \lambda }[/math] and [math]\displaystyle{ \mu }[/math], then [math]\displaystyle{ \lambda=\mu \iff \exists\kappa. (\lambda=\kappa \wedge \kappa=\mu) }[/math]

(C7) If [math]\displaystyle{ \kappa }[/math] and [math]\displaystyle{ \lambda }[/math] are different variables, then [math]\displaystyle{ \exists\kappa. (\kappa=\lambda \wedge x) \wedge \exists\kappa. (\kappa=\lambda\wedge \neg x) \iff \mathit{false} }[/math]

Cylindric set algebras

A cylindric set algebra of dimension [math]\displaystyle{ \alpha }[/math] is an algebraic structure [math]\displaystyle{ (A, \cup, \cap, -, \empty, X^\alpha, c_\kappa,d_{\kappa\lambda})_{\kappa,\lambda\lt \alpha} }[/math] such that [math]\displaystyle{ \langle X^\alpha, A \rangle }[/math] is a field of sets, [math]\displaystyle{ c_\kappa S }[/math] is given by [math]\displaystyle{ \{y \in X^\alpha \mid \exists x \in S\ \forall \beta \neq \kappa\ y(\beta) = x(\beta)\} }[/math], and [math]\displaystyle{ d_{\kappa\lambda} }[/math] is given by [math]\displaystyle{ \{x \in X^\alpha \mid x(\kappa) = x(\lambda)\} }[/math]. It necessarily validates the axioms C1–C7 of a cylindric algebra, with [math]\displaystyle{ \cup }[/math] instead of [math]\displaystyle{ + }[/math], [math]\displaystyle{ \cap }[/math] instead of [math]\displaystyle{ \cdot }[/math], set complement for complement, empty set as 0, [math]\displaystyle{ X^\alpha }[/math] as the unit, and [math]\displaystyle{ \subseteq }[/math] instead of [math]\displaystyle{ \le }[/math]. The set X is called the base.

A representation of a cylindric algebra is an isomorphism from that algebra to a cylindric set algebra. Not every cylindric algebra has a representation as a cylindric set algebra. It is easier to connect the semantics of first-order predicate logic with cylindric set algebra. (For more details, see § Further reading.)

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.

Relation to monadic Boolean algebra

When [math]\displaystyle{ \alpha = 1 }[/math] and [math]\displaystyle{ \kappa, \lambda }[/math] are restricted to being only 0, then [math]\displaystyle{ c_\kappa }[/math] becomes [math]\displaystyle{ \exists }[/math], the diagonals can be dropped out, and the following theorem of cylindric algebra (Pinter 1973):

[math]\displaystyle{ c_\kappa (x + y) = c_\kappa x + c_\kappa y }[/math]

turns into the axiom

[math]\displaystyle{ \exists (x + y) = \exists x + \exists y }[/math]

of monadic Boolean algebra. The axiom (C4) drops out (becomes a tautology). Thus monadic Boolean algebra can be seen as a restriction of cylindric algebra to the one variable case.

See also

• Abstract algebraic logic
• Lambda calculus and Combinatory logic—other approaches to modelling quantification and eliminating variables
• Hyperdoctrines are a categorical formulation of cylindric algebras
• Relation algebras (RA)
• Polyadic algebra
• Cylindrical algebraic decomposition

References

• Charles Pinter (1973). "A Simple Algebra of First Order Logic". Notre Dame Journal of Formal Logic XIV: 361–366. https://www.researchgate.net/publication/38356319. 
• Leon Henkin, J. Donald Monk, and Alfred Tarski (1971) Cylindric Algebras, Part I. North-Holland. ISBN:978-0-7204-2043-2.
• Leon Henkin, J. Donald Monk, and Alfred Tarski (1985) Cylindric Algebras, Part II. North-Holland.
• Robin Hirsch and Ian Hodkinson (2002) Relation algebras by games Studies in logic and the foundations of mathematics, North-Holland
• Carlos Caleiro, Ricardo Gonçalves (2006). "On the algebraization of many-sorted logics". in J. Fiadeiro and P.-Y. Schobbens. Proc. 18th int. conf. on Recent trends in algebraic development techniques (WADT). LNCS. 4409. Springer. pp. 21–36. ISBN 978-3-540-71997-7. http://sqig.math.ist.utl.pt/pub/CaleiroC/06-CG-manysorted.pdf. 

Further reading

• Imieliński, T.; Lipski, W. (1984). "The relational model of data and cylindric algebras". Journal of Computer and System Sciences 28: 80–102. doi:10.1016/0022-0000(84)90077-1. 

External links

• example of cylindrical algebra by CWoo on planetmath.org