Undecidability of Algebras of Binary Relations
From MaRDI portal
Publication:5015973
DOI10.1007/978-3-030-64187-0_11OpenAlexW3167511828MaRDI QIDQ5015973
Marcel Jackson, Robin Hirschl, I. M. Hodkinson
Publication date: 10 December 2021
Published in: Hajnal Andréka and István Németi on Unity of Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-64187-0_11
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relation algebras by games
- Combinatorial aspects of relations
- The calculus of relations as a foundation for mathematics
- Undecidable problems for completely 0-simple semigroups.
- Unsolvability of the universal theory of finite groups
- A perspective on the theory of relation algebras
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- Decidability of equational theories for subsignatures of relation algebra
- Eventually \({\mathcal H}\)-related sets and systems of equations over finite semigroups and rings
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
- NONREPRESENTABLE RELATION ALGEBRAS FROM GROUPS
- Some Varieties Containing Relation Algebras
- The equational theory of CA3 is undecidable
- Some undecidable embedding problems for finite semigroups
- Decision problems for equational theories of relation algebras
- Groups and Algebras of Binary Relations
- Potential Divisibility in Finite Semigroups is Undecidable
- Completely Representable Relation Algebras
- ALGORITHMIC PROBLEMS IN VARIETIES
- Undecidability of representability as binary relations
- Recursive Unsolvability of a problem of Thue
- The undecidability of the domino problem
- Boolean Algebras with Operators
- Embeddability and the Word Problem
This page was built for publication: Undecidability of Algebras of Binary Relations
