Well rewrite orderings and well quasi-orderings

DOI10.1016/0747-7171(92)90015-VzbMath0778.68048OpenAlexW2079347863MaRDI QIDQ1209622

Pierre Lescanne

Publication date: 16 May 1993

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0747-7171(92)90015-v

zbMATH Keywords

basicityprojectivitynarrowingdivisibility order

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Algebraic aspects of posets (06A11)

Related Items (2)

What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory ⋮ Linearizing well quasi-orders and bounding the length of bad sequences

Uses Software

• REVE

Cites Work

• Termination of rewriting
• Using unavoidable set of trees to generalize Kruskal's theorem
• A note on simplification orderings
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• The theory of well-quasi-ordering: a frequently discovered concept
• Recursive Unsolvability of a problem of Thue
• Embedding with patterns and associated recursive path ordering
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Well rewrite orderings and well quasi-orderings