Abstract
Relation algebras were conceived by Tarski as the means to capture the algebra of binary relations. In this paper, we prove that a Maddux Style Representation preserves well-foundedness of relations, which is not in general true for a relation algebra isomorphism. This theorem enables us to construct equationally distinct countable simple Q-relation algebras using the method of forcing.
Similar content being viewed by others
References
Chin L.H., Tarski A.: Distributive and modular laws in the arithmetic of relation algebras. Univ. California Publ. Math. (N.S.) 1, 341–384 (1951)
Jónsson B., Tarski A.: Boolean algebras with operators. II. Amer. J. Math. 74, 127–162 (1952)
Kunen, K.: Set theory. An introduction to independence proofs. Reprint of the 1980 original. Studies in Logic and the Foundations of Mathematics, vol. 102. North-Holland, Amsterdam (1983)
Maddux R.: Some sufficient conditions for the representability of relation algebras. Algebra Universalis 8, 162–172 (1978)
Tarski A.: On the calculus of relations. J. Symbolic Logic 6, 73–89 (1941)
Tarski A.: Collected papers, vol. 3. Contemporary Mathematicians. Birkhäuser, Basel (1986)
Tarski, A., Givant, S.: A formalization of set theory without variables. American Mathematical Society Colloquium Publications, vol. 41. American Mathematical Society, Providence (1987)
Author information
Authors and Affiliations
Corresponding author
Additional information
Presented by I. Hodkinson.
This article is dedicated to Professor George F. McNulty
The author is grateful to an anonymous referee for various corrections and suggestions.
Rights and permissions
About this article
Cite this article
Wu, J. Equationally distinct countable simple Q-relation algebras. Algebra Univers. 63, 131–147 (2010). https://doi.org/10.1007/s00012-010-0068-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00012-010-0068-1