Non-embeddable simple relation algebras
The authors try to solve (at least partially) some of the long standing problems in relation algebras. In a simple relation algebra, every element satisfying a certain condition is an atom. The question is if also the converse statement is valid. The authors give the solution in the negative. B. Jónsson proposed to find all finite simple relation algebras without simple proper extension. The authors show how to construct them in a particular case. They answer positively the problem whether there is a countable simple relation algebra that cannot be embedded in a one-generated relation algebra and solve a similar problem for \(k\)-generated simple relation algebras.
- Minimal relation algebras
- Parallel constructions of maximal path sets and applications to short superstrings
- Complexity of equations valid in algebras of relations. I: Strong non-finitizability
- Subcompletions of representable relation algebras
- A nonpermutational integral relation algebra
- On the use of binary decision diagrams for solving problems on simple games
- Varieties generated by completions
- Symmetric Heyting relation algebras with applications to hypergraphs
- Using relation-algebraic means and tool support for investigating and computing bipartitions
- scientific article; zbMATH DE number 763537 (Why is no real title available?)
- Simple relation algebras
- Equationally distinct countable simple {\textsf{Q}}-relation algebras
- Necessary subalgebras of simple nonintegral semiassociative relation algebras
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)
