scientific article; zbMATH DE number 4047063
From MaRDI portal
Publication:3783519
Recommendations
Cited in
(28)- Proof by consistency
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure
- Proving Ramsey's theory by the cover set induction: A case and comparision study.
- Automated theorem proving by test set induction
- Test sets for the universal and existential closure of regular tree languages.
- A strong restriction of the inductive completion procedure
- Sufficient-completeness, ground-reducibility and their complexity
- scientific article; zbMATH DE number 3891336 (Why is no real title available?)
- scientific article; zbMATH DE number 6538198 (Why is no real title available?)
- scientific article; zbMATH DE number 4776 (Why is no real title available?)
- Computing ground reducibility and inductively complete positions
- Inductive proofs by specification transformations
- Rewriting techniques for program synthesis
- Mechanically certifying formula-based Noetherian induction reasoning
- Applying term rewriting methods to finite groups
- Mechanizable inductive proofs for a class of \(\forall \exists\) formulas
- Proving weak properties of rewriting
- Computing linearizations using test sets
- Confluence of terminating membership conditional TRS
- Conditional rewriting in focus
- Proof by consistency in conditional equational theories
- Completion procedures as semidecision procedures
- Term rewriting induction
- Towards a foundation of completion procedures as semidecision procedures
- A unified view of induction reasoning for first-order logic
- The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
- Automating inductionless induction using test sets
- Proofs by induction in equational theories with constructors
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783519)
