The following pages link to Open problems in rewriting (Q5055780):
Displaying 9 items.
- Bubbles in modularity (Q1127335) (← links)
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- Logicality of conditional rewrite systems (Q1978646) (← links)
- Simple termination is difficult (Q5055798) (← links)
- More problems in rewriting (Q5055812) (← links)
- Problems in rewriting III (Q5055847) (← links)
- (Q5111310) (← links)
- Decidability of regularity and related properties of ground normal form languages (Q5881191) (← links)
- First-order theory of rewriting for linear variable-separated rewrite systems: automation, formalization, certification (Q6103588) (← links)
