Non-embeddable simple relation algebras
From MaRDI portal
Publication:1272140
DOI10.1007/s000120050041zbMath0903.03039OpenAlexW2085230603MaRDI QIDQ1272140
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
Related Items
Using relation-algebraic means and tool support for investigating and computing bipartitions ⋮ Subcompletions of representable 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 ⋮ 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
