Relation algebras can tile
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 638616
- Decision problems for equational theories of relation algebras
- Complexity of equational theory of relational algebras with standard projection elements
- Undecidable relativizations of algebras of relations
- Representability is not decidable for finite relation algebras
Cites work
- scientific article; zbMATH DE number 986406 (Why is no real title available?)
- scientific article; zbMATH DE number 4041866 (Why is no real title available?)
- scientific article; zbMATH DE number 67022 (Why is no real title available?)
- scientific article; zbMATH DE number 67039 (Why is no real title available?)
- scientific article; zbMATH DE number 757645 (Why is no real title available?)
- Cylindric algebras. Part II
- Decidability of Relation Algebras with Weakened Associativity
- Decidable and undecidable logics with a binary modality
- Pair-Dense Relation Algebras
- Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras
- Some Varieties Containing Relation Algebras
- The equational theory of CA3 is undecidable
- The undecidability of the domino problem
- Undecidable semiassociative relation algebras
- Varieties of complex algebras
Cited in
(2)
This page was built for publication: Relation algebras can tile
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961863)