Relation algebras can tile

DOI10.1016/S0020-0255(99)00013-4zbMath0939.03009MaRDI QIDQ1961863

Maarten Marx

Publication date: 5 July 2000

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

undecidabilitydecidabilitytilingrelation algebrasequational theoryrelational type algebras

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Combinatorial aspects of tessellation and tiling problems (05B45) Cylindric and polyadic algebras; relation algebras (03G15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cylindric algebras. Part II
• Sahlqvist's theorem for Boolean algebras with operators with an application to cylindric algebras
• Decidable and undecidable logics with a binary modality
• Varieties of complex algebras
• Some Varieties Containing Relation Algebras
• Decidability of Relation Algebras with Weakened Associativity
• The equational theory of CA₃ is undecidable
• Pair-Dense Relation Algebras
• Undecidable semiassociative relation algebras
• The undecidability of the domino problem

This page was built for publication: Relation algebras can tile