Embeddability and the Word Problem
From MaRDI portal
Cited in
(28)- Undecidable problems for completely 0-simple semigroups.
- Decidable and undecidable MV-algebras
- Equational classes of Steiner systems
- Strong finite embeddability for classes of quasigroups
- Gültigkeitsbegriffe für Gleichungen in partiellen Algebren
- Intersection preserving finite embedding theorems for partial quasigroups
- Deciding embeddability of partial groupoids into semigroups
- On dynamic algebras
- Embeddability into relational lattices is undecidable
- Join-completions of partially ordered algebras
- Modular proof systems for partial functions with Evans equality
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
- Embedding partial idempotent Latin squares
- Finite partial cyclic triple systems can be finitely embedded
- Finite embedding theorems for partial Latin squares, quasi-groups, and loops
- Slim groupoids
- The free orthomodular word problem is solvable
- Varieties of quasigroups determined by short strictly balanced identities
- Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras
- Word problems
- Undecidability of Algebras of Binary Relations
- Embeddability into relational lattices is undecidable
- The Isomorphism Problem for Some Classes of Multiplicative Systems
- Equational partiality
- Implication algebras and implication semigroups of binary relations
- Minimal signatures with undecidability of representability by binary relations
- On free modular lattices. II
- Cut elimination and word problems for varieties of lattices
This page was built for publication: Embeddability and the Word Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5817463)
