Pages that link to "Item:Q582891"

The following pages link to Tools for proving inductive equalities, relative completeness, and \(\omega\)-completeness (Q582891):

Displaying 11 items.

• Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
• Proving weak properties of rewriting (Q554217) (← links)
• Basic notions of universal algebra for language theory and graph grammars (Q671349) (← links)
• Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
• On finite alphabets and infinite bases (Q924717) (← links)
• Which data types have \(\omega\)-complete initial algebra specifications? (Q1318728) (← links)
• Algebra and theory of order-deterministic pomsets (Q1815430) (← links)
• A proof method for local sufficient completeness of term rewriting systems (Q2119990) (← links)
• Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
• On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs (Q2163179) (← links)
• Improving rewriting induction approach for proving ground confluence (Q5111302) (← links)