Pages that link to "Item:Q685352"

The following pages link to Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352):

Displaying 4 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)
• Mechanizable inductive proofs for a class of ∀ ∃ formulas (Q5210766) (← links)