The following pages link to Problems in rewriting III (Q5055847):
Displaying 6 items.
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- Thue trees (Q1861534) (← links)
- (Q3629661) (← links)
- More problems in rewriting (Q5055812) (← links)
- The first-order theory of one-step rewriting is undecidable (Q5055866) (← links)
- Unique normal form property of compatible term rewriting systems: A new proof of Chew's theorem (Q5941196) (← links)