Decidability of Word Problem for Just Infinite Groups

This paper addresses a fundamental problem in group theory: the word problem. It demonstrates that for a specific class of groups (finitely generated just infinite groups), the word problem is algorithmically decidable. This is significant because it provides a positive result for a class of groups where the word problem's decidability wasn't immediately obvious. The paper's approach, avoiding reliance on the Wilson-Grigorchuk classification, offers a potentially more direct and accessible proof.

• •The word problem is decidable for finitely generated just infinite groups.
• •The proof avoids the Wilson-Grigorchuk classification.
• •The approach uses ideas from classical decidability results.