The following pages link to More problems in rewriting (Q5055812):
Displaying 10 items.
- Rewrite, rewrite, rewrite, rewrite, rewrite, \dots (Q1176247) (← links)
- The first-order theory of linear one-step rewriting is undecidable (Q1275021) (← links)
- Non-existent Statman's double fixed point combinator does not exist, indeed (Q1368379) (← links)
- The first-order theory of lexicographic path orderings is undecidable (Q1392274) (← links)
- The undecidability of the first-order theories of one step rewriting in linear canonical systems (Q1854538) (← links)
- Thue trees (Q1861534) (← links)
- Rewrite systems for integer arithmetic (Q5055840) (← links)
- Problems in rewriting III (Q5055847) (← links)
- The first-order theory of one-step rewriting is undecidable (Q5055866) (← links)
- On interreduction of semi-complete term rewriting systems (Q5941203) (← links)
