Embeddability and the word problem

DOI10.2307/2275882zbMath0853.08003OpenAlexW2131463039MaRDI QIDQ4876319

Deko V. Dekov

Publication date: 6 January 1997

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275882

zbMATH Keywords

word problemfinite axiomatizabilitypartial Evans commutative semigroups

Mathematics Subject Classification ID

Commutative semigroups (20M14) Partial algebras (08A55) Word problems (aspects of algebraic structures) (08A50)

Related Items (4)

The class of embeddable semigroup amalgams is not finitely axiomatizable ⋮ Partial algebras and complexity of satisfiability and universal theory for distributive lattices, Boolean algebras and Heyting algebras ⋮ Join-completions of partially ordered algebras ⋮ Deciding embeddability of partial groupoids into semigroups

This page was built for publication: Embeddability and the word problem