scientific article; zbMATH DE number 3999904
From MaRDI portal
Publication:4726238
zbMath0617.03023MaRDI QIDQ4726238
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
finite presentationscompletion algorithmredundant generators and relationssyntactic conditions on the defining identities of a varietyword problem solvability
Word problems, etc. in computability and recursion theory (03D40) Word problems (aspects of algebraic structures) (08A50)
Related Items (5)
Free products and the word problem ⋮ On decidability of theories of finitely generated quasigroups in \(R\)- varieties of groups ⋮ Decidability of elementary theories of certain finitely defined algebras ⋮ On finitely presented and free algebras of Cantor varieties ⋮ Efficient solution of the word problem in slim varieties
This page was built for publication:
