Pages that link to "Item:Q1824382"
From MaRDI portal
The following pages link to Automatic proofs by induction in theories without constructors (Q1824382):
Displaying 41 items.
- Proving weak properties of rewriting (Q554217) (← links)
- Using induction and rewriting to verify and complete parameterized specifications (Q672051) (← links)
- Towards a foundation of completion procedures as semidecision procedures (Q673134) (← links)
- Testing for the ground (co-)reducibility property in term-rewriting systems (Q685352) (← links)
- Automating inductionless induction using test sets (Q758216) (← links)
- Proof by consistency (Q1094888) (← links)
- Rewriting with a nondeterministic choice operator (Q1096383) (← links)
- Equational problems and disunification (Q1124372) (← links)
- Narrowing based procedures for equational disunification (Q1197097) (← links)
- Deciding quasi-reducibility using witnessed test sets (Q1288435) (← links)
- The equational part of proofs by structural induction (Q1317862) (← links)
- Deductive and inductive synthesis of equational programs (Q1322836) (← links)
- Proving Ramsey's theory by the cover set induction: A case and comparision study. (Q1353938) (← links)
- Abstract data type systems (Q1391729) (← links)
- Test sets for the universal and existential closure of regular tree languages. (Q1400712) (← links)
- Automatic proofs by induction in theories without constructors (Q1824382) (← links)
- Induction = I-axiomatization + first-order consistency. (Q1854350) (← links)
- Automata-driven automated induction (Q1854445) (← links)
- Sound generalizations in mathematical induction (Q1882908) (← links)
- Ground reducibility is EXPTIME-complete (Q1887142) (← links)
- Induction using term orders (Q1915132) (← links)
- New uses of linear arithmetic in automated theorem proving by induction (Q1915133) (← links)
- Specification and proof in membership equational logic (Q1978640) (← links)
- Pumping, cleaning and symbolic constraints solving (Q4632446) (← links)
- Computing ground reducibility and inductively complete positions (Q5055712) (← links)
- Inductive proofs by specification transformations (Q5055713) (← links)
- Conditional rewrite rule systems with built-in arithmetic and induction (Q5055742) (← links)
- Proofs in parameterized specifications (Q5055758) (← links)
- Proving equational and inductive theorems by completion and embedding techniques (Q5055774) (← links)
- The negation elimination from syntactic equational formula is decidable (Q5055804) (← links)
- Encompassment properties and automata with constraints (Q5055805) (← links)
- AC complement problems: Satisfiability and negation elimination (Q5055807) (← links)
- More problems in rewriting (Q5055812) (← links)
- Towards an efficient construction of test sets for deciding ground reducibility (Q5055821) (← links)
- Problems in rewriting III (Q5055847) (← links)
- Applying term rewriting methods to finite groups (Q5096205) (← links)
- Induction using term orderings (Q5210765) (← links)
- Mechanizable inductive proofs for a class of ∀ ∃ formulas (Q5210766) (← links)
- On the connection between narrowing and proof by consistency (Q5210767) (← links)
- Consistency and semantics of equational definitions over predefined algebras (Q5881176) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
