Minimal signatures with undecidability of representability by binary relations
From MaRDI portal
Cites work
- A noncommutative generalization of Stone duality.
- Adequate Semigroups
- Algorithmic problems for amalgams of finite semigroups
- Algorithmic problems for finite groups and finite \(0\)-simple semigroups
- Axiomatizability of positive algebras of binary relations
- Demonic lattices and semilattices in relational semigroups with ordinary composition
- Domain range semigroups and finite representations
- Ehresmann theory and partition monoids
- Embeddability and the Word Problem
- Eventually \({\mathcal H}\)-related sets and systems of equations over finite semigroups and rings
- FAITHFUL FUNCTORS FROM CANCELLATIVE CATEGORIES TO CANCELLATIVE MONOIDS WITH AN APPLICATION TO ABUNDANT SEMIGROUPS
- scientific article; zbMATH DE number 3156400 (Why is no real title available?)
- scientific article; zbMATH DE number 3179521 (Why is no real title available?)
- scientific article; zbMATH DE number 67045 (Why is no real title available?)
- scientific article; zbMATH DE number 193143 (Why is no real title available?)
- scientific article; zbMATH DE number 3582190 (Why is no real title available?)
- scientific article; zbMATH DE number 3611365 (Why is no real title available?)
- scientific article; zbMATH DE number 1563405 (Why is no real title available?)
- scientific article; zbMATH DE number 1431713 (Why is no real title available?)
- Implication algebras and implication semigroups of binary relations
- On representable relation algebras
- On the calculus of relations
- Ordered domain algebras
- Partial Maps with Domain and Range: Extending Schein's Representation
- Potential Divisibility in Finite Semigroups is Undecidable
- Preservation theorems for Tarski's relation algebra
- Quasigroups. I
- Relation algebras and function semigroups
- Relation algebras by games
- Representability is not decidable for finite relation algebras
- Representation of involuted semigroups by binary relations
- Representation of Modular Lattices and Of Relation Algebras
- Representations of ordered semigroups and lattices by binary relations
- Some undecidable embedding problems for finite semigroups
- The representation of relation algebras. II
- The representation of relational algebras
- Undecidability of Algebras of Binary Relations
- Undecidability of representability as binary relations
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
- Undecidable problems for completely 0-simple semigroups.
- Unsolvability of the universal theory of finite groups
This page was built for publication: Minimal signatures with undecidability of representability by binary relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6927318)
