Pages that link to "Item:Q685352"
From MaRDI portal
The following pages link to Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352):
Displaying 8 items.
- Proving weak properties of rewriting (Q554217) (← links)
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Observational proofs by rewriting. (Q1607227) (← links)
- Ground reducibility is EXPTIME-complete (Q1887142) (← links)
- Pumping, cleaning and symbolic constraints solving (Q4632446) (← links)
- Towards an efficient construction of test sets for deciding ground reducibility (Q5055821) (← links)
- Mechanizable inductive proofs for a class of ∀ ∃ formulas (Q5210766) (← links)
