Cylindric algebra
Encyclopedia
|
| Tutorials | Encyclopedia | Dictionary | Directory |
|
![]()
Cylindric algebra
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.
Definition of a cylindric algebraA cylindric algebra of dimension \alpha, where \alpha is any ordinal is an algebraic structure (A,+,\cdot,-,0,1,c_\kappa,d_{\kappa\lambda})_{\kappa,\lambda<\alpha} such that (A,+,\cdot,-,0,1) is a Boolean algebra, c_\kappa a unary operator on A for every \kappa, and d_{\kappa\lambda} a distinguished element of A for every \kappa and \lambda, such that the following hold: (C1) c_\kappa 0=0 (C2) x\leq c_\kappa x (C3) c_\kappa(x\cdot c_\kappa y)=c_\kappa x\cdot c_\kappa y (C4) c_\kappa c_\lambda x=c_\lambda c_\kappa x (C5) d_{\kappa\kappa}=1 (C6) If \kappa\neq\lambda\mu, then d_{\lambda\mu}=c_\kappa(d_{\lambda\kappa}\cdot d_{\kappa\mu}) (C7) If \kappa\neq\lambda, then c_\kappa(d_{\kappa\lambda}\cdot x)\cdot c_\kappa(d_{\kappa\lambda}\cdot -x)=0 GeneralizationsRecently, 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. See also
References
External links
Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article
|
|
top
©2008-2009 TutorGig.com. All Rights Reserved. Privacy Statement