scientific article; zbMATH DE number 4164140
From MaRDI portal
Recommendations
Cited in
(17)- How to prove equivalence of term rewriting systems without induction
- Induction using term orders
- Inductive theorem proving for design specifications
- Transforming orthogonal inductive definition sets into confluent term rewrite systems
- Inductive theorem proving based on tree grammars
- Dealing with Non-orientable Equations in Rewriting Induction
- scientific article; zbMATH DE number 4047062 (Why is no real title available?)
- scientific article; zbMATH DE number 2043540 (Why is no real title available?)
- Improving rewriting induction approach for proving ground confluence
- Proof Terms for Infinitary Rewriting
- Induction using term orderings
- Natural inductive theorems for higher-order rewriting
- Theorem Proving Based on Proof Scores for Rewrite Theory Specifications of OTSs
- Focused Inductive Theorem Proving
- Rewriting Techniques and Applications
- Term rewriting induction
- Testing for the ground (co-)reducibility property in term-rewriting systems
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 Q3490953)