Non-embeddable simple relation algebras

DOI10.1007/S000120050041MaRDI QIDQ1272140zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 23 November 1998

Published in Algebra Universalis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s000120050041

zbMATH Keywords

relation algebraatomproper extensionsimple relation algebra

Mathematics Subject Classification ID

Cylindric and polyadic algebras; relation algebras (03G15)

Recommendations

• scientific article; zbMATH DE number 67031
• Nonrepresentable relation algebras generated by functional elements
• A simple construction of representable relation algebras with non-representable completions
• The Structure of Relation Algebras Generated by Relativizations

Cited in

(13)

• Varieties generated by completions
• Complexity of equations valid in algebras of relations. I: Strong non-finitizability
• Subcompletions of representable relation algebras
• Using relation-algebraic means and tool support for investigating and computing bipartitions
• scientific article; zbMATH DE number 763537 (Why is no real title available?)
• Necessary subalgebras of simple nonintegral semiassociative relation algebras
• Equationally distinct countable simple {\textsf{Q}}-relation algebras
• Simple relation algebras
• Minimal relation algebras
• A nonpermutational integral relation algebra
• Parallel constructions of maximal path sets and applications to short superstrings
• Symmetric Heyting relation algebras with applications to hypergraphs
• On the use of binary decision diagrams for solving problems on simple games

This page was built for publication: Non-embeddable simple relation algebras

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