Pages that link to "Item:Q2641108"
From MaRDI portal
The following pages link to Sufficient-completeness, ground-reducibility and their complexity (Q2641108):
Displaying 24 items.
- Sufficient completeness verification for conditional and constrained TRS (Q420848) (← links)
- Lazy productivity via termination (Q549188) (← links)
- Undecidability of ground reducibility for word rewriting systems with variables (Q674184) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- A simplification of the completeness proofs for Guaspari and Solovay's R (Q923070) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Completeness and reduction in algebraic complexity theory (Q1567446) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- Explicit versus implicit representations of subsets of the Herbrand universe. (Q1853582) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- Working with ARMs: Complexity results on atomic representations of Herbrand models (Q1854418) (← links)
- Ground reducibility is EXPTIME-complete (Q1887142) (← links)
- New uses of linear arithmetic in automated theorem proving by induction (Q1915133) (← links)
- Stability of termination and sufficient-completeness under pushouts via amalgamation (Q2215962) (← links)
- \(L^1\)-computability, layerwise computability and Solovay reducibility (Q2851186) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- (Q4530147) (← links)
- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning (Q4916080) (← links)
- On relationship between term rewriting systems and regular tree languages (Q5055769) (← links)
- Incremental Proofs of Termination, Confluence and Sufficient Completeness of OBJ Specifications (Q5403069) (← links)
- Behavioral Rewrite Systems and Behavioral Productivity (Q5403074) (← links)
- Checking Sufficient Completeness by Inductive Theorem Proving (Q6487296) (← links)
- On Ground Convergence and Completeness of Conditional Equational Program Hierarchies (Q6487297) (← links)