Mathematics – Logic
Scientific paper
1993-01-15
Proc. London Math. Soc. 66 (1993), 225-256
Mathematics
Logic
Scientific paper
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if there is an algorithm which given a finite presentation produces an algorithm for solving the word problem of the algebra so presented. A variety is given with finitely many axioms having a decidable, but not uniformly decidable, word problem. Other related examples are given as well.
Mekler Alan H.
Nelson Evelyn
Shelah Saharon
No associations
LandOfFree
A variety with solvable, but not uniformly solvable, word problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A variety with solvable, but not uniformly solvable, word problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A variety with solvable, but not uniformly solvable, word problem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-610470