Axiomatization of identity-free equations valid in relation algebras (original) (raw)
Related papers
The equational theory of union-free algebras of relations
Algebra Universalis, 1995
Decision problems for equational theories of relation algebras
Memoirs of the American Mathematical Society, 1997
Axiomatizability of positive algebras of binary relations
Algebra universalis, 2011
The Review of Symbolic Logic, 2016
Complexity of equations valid in algebras of relations part I: Strong non-finitizability
Annals of Pure and Applied Logic, 1997
On the equational theory of representable polyadic equality algebras (extended abstract)
Logic Journal of IGPL, 1998
Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite Representability
Logical Foundations of Computer Science, 2021
Gentzen-style axiomatizations in equational logic
Algebra Universalis, 1995
Expressibility of properties of relations
Relation algebras from cylindric algebras, II
Annals of Pure and Applied Logic, 2001
Complexity of equational theory of relational algebras with standard projection elements
Synthese, 2015
The Journal of Symbolic Logic, 2021
Finite algebras of relations are representable on finite sets
Journal of Symbolic Logic, 1999
The Index and Core of a Relation With Applications to the Axiomatics of Relation Algebra
Roland Backhouse, Ed Voermans, Roland Backhouse
On the construction of free algebras for equational systems
Theoretical Computer Science, 2009
Non-finite-axiomatizability results in algebraic logic
Journal of Symbolic Logic, 1992
On the search for a finitizable algebraization of first order logic
Logic Journal of IGPL, 2000
1. Relation algebras Outline 1. Relation algebras; representations
2013
On Recognisable Properties of Associative Algebras
Journal of Symbolic Computation, 1988
Axiomatizability of representable domain algebras
The Journal of Logic and Algebraic Programming, 2011
Relation algebras with -dimensional relational bases
Annals of Pure and Applied Logic, 2000
Finite Quantifier Hierarchies in Relational Algebras (Semenov A. L.; Soprunov S. F.)
Proceedings of the Steklov Institute of Mathematics, 2011
On the definition and the representability of quasi-polyadic equality algebras
Mathematical Logic Quarterly, 2016
Infinitary Axiomatization of the Equational Theory of Context-Free Languages
Electronic Proceedings in Theoretical Computer Science, 2013
Complete sets of unifiers and matchers in equational theories
Theoretical Computer Science, 1986
Mathematical Logic Quarterly, 1995
Representability is not decidable for finite relation algebras
Transactions of the American Mathematical Society, 1999
Algebra Universalis, 1994
Composita, Equations, and Freely Generated Algebras
Transactions of the American Mathematical Society, 1959
Relevant logic and relation algebras
Non-Computability of the Equational Theory of Polyadic Algebras
2001
Working Document, 2022
An abstract theory of invertible relations
Algebra Universalis, 1988
Computer aided investigations of relation algebras
1992