Undecidability of representability as binary relations
From MaRDI portal
Recommendations
- A decidable equational theory with undecidable membership problem for finite algebras
- The finite representation property for composition, intersection, domain and range
- Representability is not decidable for finite relation algebras
- Undecidability of Algebras of Binary Relations
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
- Weakly representable but not representable relation algebras
- Implication algebras and implication semigroups of binary relations
- Decision problems for equational theories of relation algebras
- scientific article; zbMATH DE number 5539272
- scientific article; zbMATH DE number 67049
Cites work
- A remark of representable positive cylindric algebras
- ALGORITHMIC PROBLEMS IN VARIETIES
- Algebras of modal operators and partial correctness
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- An invitation to C-semigroups
- Atom structures and Sahlqvist equations
- Boolean Algebras with Operators
- Canonical varieties with no canonical axiomatisation
- Difference semigroups
- FAITHFUL FUNCTORS FROM CANCELLATIVE CATEGORIES TO CANCELLATIVE MONOIDS WITH AN APPLICATION TO ABUNDANT SEMIGROUPS
- Free right type A semigroups
- Kleene algebra with domain
- Modal restriction semigroups: towards an algebra of functions.
- On representable relation algebras
- PDL with intersection and converse: satisfiability and infinite-state model checking
- Partial Maps with Domain and Range: Extending Schein's Representation
- Relation algebras
- Relation algebras and function semigroups
- Relation algebras by games
- Representability is not decidable for finite relation algebras
- Representable semilattice-ordered monoids
- Representations of distributive lattice-ordered semigroups with binary relations
- The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable
- The equational theory of union-free algebras of relations
- The representation of relation algebras. II
- The representation of relational algebras
- Undecidability and nonperiodicity for tilings of the plane
- Undecidable problems for completely 0-simple semigroups.
Cited in
(15)- The finite representation property for composition, intersection, domain and range
- Domain and range for angelic and demonic compositions
- Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
- Ehresmann theory and partition monoids
- Embeddability into relational lattices is undecidable
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
- Finite representability of semigroups with demonic refinement
- The algebra of functions with antidomain and range
- Small partial Latin squares that embed in an infinite group but not into any finite group
- Minimal signatures with undecidability of representability by binary relations
- Undecidable semiassociative relation algebras
- Representability is not decidable for finite relation algebras
- Nonrepresentable relation algebras generated by functional elements
- Undecidability of Algebras of Binary Relations
- Implication algebras and implication semigroups of binary relations
This page was built for publication: Undecidability of representability as binary relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899169)
