Pages that link to "Item:Q1824381"
From MaRDI portal
The following pages link to A strong restriction of the inductive completion procedure (Q1824381):
Displaying 18 items.
- The strength of sharply bounded induction requires MSP (Q636290) (← links)
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Inductive completion with retracts (Q1093368) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Induction using term orders (Q1915132) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Strong forward induction (Q2098894) (← links)
- Equational completion by proof transformation (Q3993260) (← links)
- Computing ground reducibility and inductively complete positions (Q5055712) (← links)
- Proving equational and inductive theorems by completion and embedding techniques (Q5055774) (← links)
- Applying term rewriting methods to finite groups (Q5096205) (← links)
- Induction using term orderings (Q5210765) (← links)
- Knuth-bendix completion of horn clause programs for restricted linear resolution and paramodulation (Q5881277) (← links)
- Proof by consistency in conditional equational theories (Q5881278) (← links)
- Completion procedures as semidecision procedures (Q5881279) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies (Q6487297) (← links)