We present an overview of the axiomatizability problem of algebras of binary relations. The focus will be on the finite and non-finite axiomatizability of several fragments of Tarski’s class of representable relation algebras.We examine the step-by-step method for establishing finite axiomatizability and ultraproduct constructions for establishing non-finite axiomatizability.We conclude with some open problems that could be tackled using either of the above methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this paper
Cite this paper
Mikulás, S. (2004). Axiomatizability of algebras of binary relations. In: Löwe, B., Piwinger, B., Räsch, T. (eds) Classical and New Paradigms of Computation and their Complexity Hierarchies. Trends in Logic, vol 23. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-2776-5_11
Download citation
DOI: https://doi.org/10.1007/978-1-4020-2776-5_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2775-8
Online ISBN: 978-1-4020-2776-5
eBook Packages: Springer Book Archive