Recommendations
Cites work
- Computing in systems described by equations
- Decision procedures for real and p‐adic fields
- scientific article; zbMATH DE number 3930339 (Why is no real title available?)
- scientific article; zbMATH DE number 3729436 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3635501 (Why is no real title available?)
- scientific article; zbMATH DE number 1324443 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- On the recursive decomposition ordering with lexicographical status and other related orderings
- Orderings for term-rewriting systems
- Proving Properties of Programs by Structural Induction
- Proving termination with multiset orderings
- Termination of rewriting
- Termination of rewriting systems by polynomial interpretations and its implementation
Cited in
(15)- Induction using term orders
- Outside opportunities and termination
- Orderings and Constraints: Theory and Practice of Proving Termination
- On Lazy Commutation
- scientific article; zbMATH DE number 3905845 (Why is no real title available?)
- scientific article; zbMATH DE number 4007716 (Why is no real title available?)
- scientific article; zbMATH DE number 1241629 (Why is no real title available?)
- Linear interpretations by counting patterns
- A termination ordering for higher order rewrite systems
- A complete characterization of termination of 0p 1q→1r 0s
- On the termination problem for one-rule semi-Thue system
- Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
- Term Rewriting and Applications
- Natural termination
- Summarization for termination: No return!
This page was built for publication: Topics in termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055795)
