Pages that link to "Item:Q1183582"
From MaRDI portal
The following pages link to How to prove equivalence of term rewriting systems without induction (Q1183582):
Displaying 7 items.
- Confluence and commutation for nominal rewriting systems with atom-variables (Q2119102) (← links)
- A proof method for local sufficient completeness of term rewriting systems (Q2119990) (← links)
- Four equivalent equivalences of reductions (Q2843602) (← links)
- Combining Rewriting with Noetherian Induction to Reason on Non-orientable Equalities (Q3522029) (← links)
- Completion after Program Inversion of Injective Functions (Q5170160) (← links)
- Confluence of terminating membership conditional TRS (Q5881201) (← links)
- Term rewriting induction (Q6488529) (← links)