Skip to main content
Log in

Axiomatizability of reducts of algebras of relations

  • Published:
algebra universalis Aims and scope Submit manuscript

Abstract.

In this paper, we prove that any subreduct of the class of representable relation algebras whose similarity type includes intersection, relation composition and converse is a non-finitely axiomatizable quasivariety and that its equational theory is not finitely based. We show the same result for subreducts of the class of representable cylindric algebras of dimension at least three whose similarity types include intersection and cylindrifications. A similar result is proved for subreducts of the class of representable sequential algebras.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received October 7, 1998; accepted in final form September 10, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hodkinson, I., Mikulás, S. Axiomatizability of reducts of algebras of relations. Algebra univers. 43, 127–156 (2000). https://doi.org/10.1007/s000120050150

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000120050150

Keywords

Navigation