Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS
   
Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)

Decidability of relation algebras with weakened associativity


Author: I. Németi
Journal: Proc. Amer. Math. Soc. 100 (1987), 340-344
MSC: Primary 03G15; Secondary 03B25, 03G25, 08A50
MathSciNet review: 884476
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Tarski showed that mathematics can be built up in the equational theory EqRA of relation algebras (RA's), hence EqRA is undecidable. He raised the problem "how much associativity of relation composition is needed for this result." Maddux defined the classes $ \operatorname{NA} \supset \operatorname{WA} \supset \operatorname{SA} \supset \operatorname{RA}$ by gradually weakening the associativity of relation composition, and he proved that the equational theory of SA is still undecidable. We showed, elsewhere, that mathematics can be built up in SA, too. In the present paper we prove that the equational theories of WA and NA are already decidable. Hence mathematics cannot be built up in WA or NA. This solves a problem in the book by Tarski and Givant.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC: 03G15, 03B25, 03G25, 08A50

Retrieve articles in all journals with MSC: 03G15, 03B25, 03G25, 08A50


Additional Information

DOI: http://dx.doi.org/10.1090/S0002-9939-1987-0884476-5
PII: S 0002-9939(1987)0884476-5
Article copyright: © Copyright 1987 American Mathematical Society