Relation algebras can tile

DOI10.1016/S0020-0255(99)00013-4zbMATH Open0939.03009MaRDI QIDQ1961863FDOQ1961863

Authors: Maarten Marx 

Publication date: 5 July 2000

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

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

zbMATH Keywords

tilingdecidabilityundecidabilityequational theoryrelation algebrasrelational type algebras

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• Title not available (Why is that?)
• Representability is not decidable for finite relation algebras

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)