Representations for small relation algebras

DOI10.1305/ndjfl/1040408612zbMath0830.03033OpenAlexW2112073482MaRDI QIDQ1903131

Hajnalka Andréka, Roger D. Maddux

Publication date: 26 November 1995

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1040408612

zbMATH Keywords

representationsisomorphism typesfinite relation algebras

Mathematics Subject Classification ID

Cylindric and polyadic algebras; relation algebras (03G15)

Related Items (6)

Improved bounds on the size of the smallest representation of relation algebra \(32_{65}\) ⋮ Hardness of Network Satisfaction for Relation Algebras with Normal Representations ⋮ Relation algebras of Sugihara, Belnap, Meyer, and Church ⋮ Relation algebras and their application in temporal and spatial reasoning ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom ⋮ The complexity of constraint satisfaction problems for small relation algebras

Cites Work

• The representation of relation algebras. II
• Varieties of relation algebras
• Combinatorial aspects of relations
• Relation algebras and Schröder categories
• A new foundation for the theory of relations
• Representations of integral relation algebras
• The representation of relational algebras
• Boolean Algebras with Operators. Part I
• Boolean Algebras with Operators
• Combinatorial Relations and Chromatic Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Representations for small relation algebras