Simple termination of rewrite systems
From MaRDI portal
Recommendations
Cites work
- A note on simplification orderings
- Automating the Knuth Bendix ordering
- Completeness of combinations of constructor systems
- Counterexamples to termination for the direct sum of term rewriting systems
- Extension orderings
- Generalized sufficient conditions for modular termination of rewriting
- scientific article; zbMATH DE number 1638661 (Why is no real title available?)
- scientific article; zbMATH DE number 108365 (Why is no real title available?)
- scientific article; zbMATH DE number 1354152 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 1479616 (Why is no real title available?)
- scientific article; zbMATH DE number 1761896 (Why is no real title available?)
- scientific article; zbMATH DE number 759443 (Why is no real title available?)
- scientific article; zbMATH DE number 794236 (Why is no real title available?)
- scientific article; zbMATH DE number 794239 (Why is no real title available?)
- scientific article; zbMATH DE number 794240 (Why is no real title available?)
- scientific article; zbMATH DE number 1456966 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3198033 (Why is no real title available?)
- Modular proofs for completeness of hierarchical term rewriting systems
- Modular properties of composable term rewriting systems
- Modularity of simple termination of term rewriting systems with shared constructors
- On the modularity of termination of term rewriting systems
- Ordering by Divisibility in Abstract Algebras
- Orderings for term-rewriting systems
- Proving termination with multiset orderings
- Simple termination is difficult
- Simple termination revisited
- Simulation of Turing machines by a regular rewrite rule
- Termination of rewriting
- Termination of term rewriting: Interpretation and type elimination
- Termination proofs by multiset path orderings imply primitive recursive derivation lengths
- Total termination of term rewriting
- Total termination of term rewriting is undecidable
- Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
- What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
Cited in
(17)- Simple termination is difficult
- Pattern-matching algorithms based on term rewrite systems
- Relative undecidability in term rewriting. I: The termination hierarchy
- Relative undecidability in term rewriting. II: The confluence hierarchy
- Modular termination proofs for rewriting using dependency pairs
- Modularity in term rewriting revisited
- Termination of term rewriting using dependency pairs
- Certified Kruskal's tree theorem
- Termination Proof of S-Expression Rewriting Systems with Recursive Path Relations
- AC-KBO revisited
- scientific article; zbMATH DE number 759443 (Why is no real title available?)
- scientific article; zbMATH DE number 7379291 (Why is no real title available?)
- Kruskal's tree theorem for acyclic term graphs
- Simple termination is difficult
- Simple termination revisited
- Weighted Path Orders Are Semantic Path Orders
- Hydra battles and AC termination
This page was built for publication: Simple termination of rewrite systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392146)
