Pages that link to "Item:Q1061484"
From MaRDI portal
The following pages link to The undecidability of self-embedding for term rewriting systems (Q1061484):
Displaying 8 items.
- The undecidability of self-embedding for finite semi-Thue and Thue systems (Q1092041) (← links)
- Termination of rewriting (Q1098624) (← links)
- A field guide to equational logic (Q1201350) (← links)
- Simple termination is difficult (Q1343111) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- An equational logic sampler (Q5055725) (← links)
- Simple termination is difficult (Q5055798) (← links)
