Completely Representable Relation Algebras

DOI10.1093/JIGPAL/3.1.77MaRDI QIDQ4834295zbMATH OpenOpenAlexFDO

Authors Robin Hirsch

Publication date 28 November 1995

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0f7cee6fceae99e38086ead5463a79916f854f80

zbMATH Keywords

Boolean algebraBoolean reductcomplete representationelementary classrelation algebraultrapower

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Cylindric and polyadic algebras; relation algebras (03G15) Structure theory of Boolean algebras (06E05)

Recommendations

• Complete representations in algebraic logic
• Completions and complete representations
• Relation algebra reducts of cylindric algebras and complete representations
• A simple construction of representable relation algebras with non-representable completions
• Weakly representable but not representable relation algebras

Cited in

(18)

• Relation algebras: Concept of points and representability
• Finitely representable nested relations
• Subcompletions of representable relation algebras
• Difference-restriction algebras of partial functions with operators: discrete duality and completion
• Nonrepresentable relation algebras generated by functional elements
• Representability is not decidable for finite relation algebras
• Strongly representable atom structures of relation algebras
• Completions and complete representations
• Positive fragments of relevance logic and algebras of binary relations
• Complete representation by partial functions for composition, intersection and anti-domain
• A simple construction of representable relation algebras with non-representable completions
• scientific article; zbMATH DE number 1281921 (Why is no real title available?)
• Universal classes of simple relation algebras
• The lattice of varieties of representable relation algebras
• Complete representations in algebraic logic
• Undecidability of Algebras of Binary Relations
• First-order axiomatisations of representable relation algebras need formulas of unbounded quantifier depth
• Relation algebra reducts of cylindric algebras and complete representations

This page was built for publication: Completely Representable Relation Algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834295)