Pages that link to "Item:Q1595492"
From MaRDI portal
The following pages link to On a connection between the word problem and decidability of the equational theory (Q1595492):
Displaying 8 items.
- 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)
- Undecidability of the word problem in relatively free rings (Q1585640) (← links)
- Deciding the word problem in pure double Boolean algebras (Q1948275) (← links)
- Hao Wang's contributions to mechanized deduction and to the Entscheidungsproblem (Q2845892) (← links)
- A decidable word problem without equivalent canonical term rewriting system (Q3816049) (← links)
- (Q3839876) (← links)