Pages that link to "Item:Q5941752"
From MaRDI portal
The following pages link to Termination proofs for ground rewrite systems -- interpretations and derivational complexity (Q5941752):
Displaying 9 items.
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Omega-termination is undecidable for totally terminating term rewriting systems (Q1355781) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) (Q2104557) (← links)
- Decidability of termination of grid string rewriting rules (Q2784496) (← links)
- Canonized rewriting and ground AC completion modulo Shostak theories: design and implementation (Q2914237) (← links)
- Proofs and reachability problem for ground rewrite systems (Q3979263) (← links)
- Total termination of term rewriting (Q5055796) (← links)
- Termination of Fair Computations in Term Rewriting (Q5387839) (← links)
