Pages that link to "Item:Q4955722"
From MaRDI portal
The following pages link to A finitely axiomatizable undecidable equational theory with recursively solvable word problems (Q4955722):
Displaying 8 items.
- Many-sorted and single-sorted algebras (Q353361) (← links)
- Applying, extending, and specializing pseudorecursiveness (Q598283) (← links)
- Almost all one-rule Thue systems have decidable word problems (Q1057265) (← links)
- The word problem for Smullyan's lark combinator is decidable (Q1114668) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- Pseudorecursive varieties of semigroups. II (Q2909488) (← links)
- A decidable word problem without equivalent canonical term rewriting system (Q3816049) (← links)
- (Q3839876) (← links)