Relation algebras as residuated Boolean algebras
✍ Scribed by Bjarni Jónsson; Constantine Tsinakis
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 357 KB
- Volume
- 30
- Category
- Article
- ISSN
- 0002-5240
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## S(z A y ) z S(A), by (c) * S(z) A S(Y) 2 S(A) e S(x) 2 S(A) and S(y) 2 S(A) e C ( s ) s C ( A ) 'and C ( y ) E C ( A ) , by (c) o x € C ( A ) and Y E C ( A ) . Now every ultrafilter is consistent and closed with respect to C, since if U is an ultrafilter and C ( U ) = X , then C({,uu,, . . ., ,
## Abstract Logics designed to deal with vague statements typically allow algebraic semantics such that propositions are interpreted by elements of residuated lattices. The structure of these algebras is in general still unknown, and in the cases that a detailed description is available, to underst