Embeddability and the Word Problem
From MaRDI portal
Publication:5817463
DOI10.1112/jlms/s1-28.1.76zbMath0050.02801OpenAlexW2098297140MaRDI QIDQ5817463
Publication date: 1953
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-28.1.76
Related Items
Embeddability into Relational Lattices Is Undecidable, The free orthomodular word problem is solvable, On dynamic algebras, Embeddability into relational lattices is undecidable, The Isomorphism Problem for Some Classes of Multiplicative Systems, Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras, Implication algebras and implication semigroups of binary relations, Modular proof systems for partial functions with Evans equality, Varieties of quasigroups determined by short strictly balanced identities, Join-completions of partially ordered algebras, Equational classes of Steiner systems, Strong finite embeddability for classes of quasigroups, Gültigkeitsbegriffe für Gleichungen in partiellen Algebren, Equational partiality, Intersection preserving finite embedding theorems for partial quasigroups, Word problems, Slim groupoids, Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups, Undecidable problems for completely 0-simple 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, On free modular lattices. II, Deciding embeddability of partial groupoids into semigroups, Cut elimination and word problems for varieties of lattices, Decidable and undecidable MV-algebras, Undecidability of Algebras of Binary Relations
