Well-partial-orderings and hierarchies of binary trees

  title={Well-partial-orderings and hierarchies of binary trees},
  author={Gyesik Lee},
The set of binary trees together with the homeomorphic embedding build an wellpartial-ordering. It is well known that its maximal order type is ε0 as shown by de Jongh and that its canonical linearization is the system obtained from the celebrated Feferman-Schütte system for Γ0 by omitting the addition operator. We show here that Higman’s Lemma and Dershowitz’s recursive path ordering are nice tools in deciding the maximal order type and the order type, respectively. Moreover, this will be done… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 17 references

Nonprovability of certain combinatorial properties of finite trees

  • S. G. Simpson
  • in: Harvey Friedman’s research on the foundations…
  • 1985
Highly Influential
6 Excerpts

Well-Partial Orderings and Their Maximal order Types

  • D. Schmidt
  • Habilitationsschrift, Heidelberg
  • 1979
Highly Influential
6 Excerpts

Well-partial orderings and hierarchies, Nederl

  • D.H.J. de Jongh, R. Parikh
  • Akad. Wetensch. Proc. Ser. A 80=Indag. Math
  • 1977
Highly Influential
6 Excerpts

Ordering by divisibility in abstract algebras

  • G. Higman
  • Proc. London Math. Soc. (3) 2
  • 1952
Highly Influential
11 Excerpts

On undecidability of the weakened Kruskal theorem

  • M. Loebl, J. Matoušek
  • in: Logic and combinatorics
  • 1985
2 Excerpts

The consistency strengths of some finite forms of the Higman and Kruskal theorems

  • R. L. Smith
  • in: Harvey Friedman’s research on the foundations…
  • 1985
2 Excerpts

Similar Papers

Loading similar papers…