A finitely axiomatizable undecidable equational theory with recursively solvable word problems (Q4955722)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Publication:4955722 |
scientific article; zbMATH DE number 1449843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A finitely axiomatizable undecidable equational theory with recursively solvable word problems |
scientific article; zbMATH DE number 1449843 |
Statements
A finitely axiomatizable undecidable equational theory with recursively solvable word problems (English)
0 references
22 May 2000
0 references
undecidable equational theory
0 references
recursively solvable word problems
0 references
many-sorted logics
0 references
0 references
0.7984236478805542
0 references
