Well rewrite orderings and well quasi-orderings

DOI10.1016/0747-7171(92)90015-VMaRDI QIDQ1209622zbMATH OpenOpenAlexFDO

Authors 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

basicitydivisibility ordernarrowingprojectivity

Mathematics Subject Classification ID

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

Recommendations

• Leanest quasi-orderings
• A comparison of well-quasi orders on trees
• Term Rewriting and Applications
• On well quasiordering of finite languages
• A note on well quasi-orderings for powersets

Cites work

• A note on simplification orderings
• Embedding with patterns and associated recursive path ordering
• scientific article; zbMATH DE number 4170966 (Why is no real title available?)
• scientific article; zbMATH DE number 3810909 (Why is no real title available?)
• scientific article; zbMATH DE number 3921958 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 3776841 (Why is no real title available?)
• scientific article; zbMATH DE number 48157 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 3198033 (Why is no real title available?)
• Ordering by Divisibility in Abstract Algebras
• Recursive unsolvability of a problem of Thue
• Resolution of equations in algebraic structures. Volume II: Rewriting techniques
• Termination of rewriting
• The theory of well-quasi-ordering: a frequently discovered concept
• Using unavoidable set of trees to generalize Kruskal's theorem
• 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

(12)

• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• Well quasi ordering finite posets and formal languages
• On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
• Well-Quasi Orders and Hierarchy Theory
• scientific article; zbMATH DE number 4170966 (Why is no real title available?)
• Well Quasi-orders in Formal Language Theory
• A comparison of well-quasi orders on trees
• WELL ORDERING PRINCIPLES AND -STATEMENTS: A PILOT STUDY
• An addition to "On defining well-orderings"
• Term Rewriting and Applications
• Linearizing well quasi-orders and bounding the length of bad sequences
• Leanest quasi-orderings

Describes a project that uses

Uses Software

• REVE

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209622)