
doi: 10.1007/bf01197182
The authors describe a variety of finite type with an undecidable equational theory, whose local word problem is solvable since there are finite bounds for the cardinality of finitely generated algebras.
variety of finite type, undecidable equational theory, Word problems (aspects of algebraic structures), Equational logic, Mal'tsev conditions, Undecidability and degrees of sets of sentences, Word problems, etc. in computability and recursion theory, local word problem
variety of finite type, undecidable equational theory, Word problems (aspects of algebraic structures), Equational logic, Mal'tsev conditions, Undecidability and degrees of sets of sentences, Word problems, etc. in computability and recursion theory, local word problem
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
