Extending a construction of Andreka, Givant, and Nemeti, we construct some finite vector spaces and use them to build finite non-representable relation algebras. They are simple, measurable, and persistently finite, and they validate arbitrary finite sets of equations that are valid in the variety RRA of representable relation algebras. It follows that there is no finitely axiomatisable class of relation algebras that contains RRA and validates every equation that is both valid in RRA and preserved by completions of relation algebras. Consequently, the variety generated by the completions of representable relation algebras is not finitely axiomatisable. This answers a question of Maddux.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.26686/ajl.v17i2.6467
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,342
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Atom Structures of Cylindric Algebras and Relation Algebras.Ian Hodkinson - 1997 - Annals of Pure and Applied Logic 89 (2):117-148.
Nonrepresentable Relation Algebras From Groups.H. Andréka, S. Givant & I. Németi - forthcoming - Review of Symbolic Logic:1-21.
Representations for Small Relation Algebras.Hajnal Andréka & Roger D. Maddux - 1994 - Notre Dame Journal of Formal Logic 35 (4):550-562.


Added to PP index

Total views
2 ( #1,328,054 of 2,326,047 )

Recent downloads (6 months)
2 ( #438,061 of 2,326,047 )

How can I increase my downloads?


My notes