Hostname: page-component-78c5997874-ndw9j Total loading time: 0 Render date: 2024-11-10T12:50:58.689Z Has data issue: false hasContentIssue false
  • English
  • Français

Generalizations of the Kruskal-Friedman theorems

Published online by Cambridge University Press:  12 March 2014

L. Gordeev
L. Gordeev*
Affiliation:
Mathematisches Institut, Universität Tübingen, D-7400 Tübingen, West Germany
Get access Rights & Permissions [Opens in a new window]

Abstract

Kruskal proved that finite trees are well-quasi-ordered by hom(e)omorphic embeddability. Friedman observed that this statement is not provable in predicative analysis. Friedman also proposed (see in [Simpson]) some stronger variants of the Kruskal theorem dealing with finite labeled trees under hom(e)omorphic embeddability with a certain gap-condition, where labels are arbitrary finite ordinals from a fixed initial segment of ω. The corresponding limit statement, expressing that for all initial segments of ω these labeled trees are well-quasi-ordered, is provable in -CA, but not in the analogous theory -CA0 with induction restricted to sets. Schütte and Simpson proved that the one-dimensional case of Friedman's limit statement dealing with finite labeled intervals is not provable in Peano arithmetic. However, Friedman's gap-condition fails for finite trees labeled with transfinite ordinals. In [Gordeev 1] I proposed another gap-condition and proved the resulting one-dimensional modified statements for all (countable) transfinite ordinal-labels. The corresponding universal modified one-dimensional statement UM1 is provable in (in fact, is equivalent to) the familiar theory ATR0 whose proof-theoretic ordinal is Γ0. In [Gordeev 1] I also announced that, in the general case of arbitrarily-branching finite trees labeled with transfinite ordinals, in the proof-theoretic sense the hierarchy of the limit modified statements M<λ (which are denoted by LMλ in the present note) is as strong as the hierarchy of the familiar theories of iterated inductive definitions (more precisely, see [Gordeev 1, Concluding Remark 3]). In this note I present a “positive” proof of the full universal modified statement UM, together with a short proof of the crucial “reverse” results which is based on Okada's interpretation of the well-established ordinal notations of Buchholz corresponding to the theories of iterated inductive definitions. Formally the results are summarized in §5 below.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 55 , Issue 1 , March 1990 , pp. 157 - 181
Copyright
Copyright © Association for Symbolic Logic 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[Buchholz 1]Buchholz, W., A new system of proof-theoretic ordinal functions, Annals of Pure and Applied Logic, vol. 32 (1986), pp. 195–207.CrossRefGoogle Scholar
[Buchholz 2]Buchholz, W., An independence result for (, Annals of Pure and Applied Logic, vol. 33 (1987), pp. 131–155.CrossRefGoogle Scholar
[Buchholz + Feferman + Pohlers + Sieg]Buchholz, W., Feferman, S., Pohlers, W., and Sieg, W., Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies, Lecture Notes in Mathematics, vol. 897, Springer-Verlag, Berlin, 1981.Google Scholar
[De Jongh + Parikh]de Jongh, D. and Parikh, R., Well-partial-orderings and hierarchies, Indaga-tiones Mathematicae, vol. 39 (1977), pp. 195–207.CrossRefGoogle Scholar
[Gordeev 1]Gordeev, L., Generalizations of the one-dimensional version of the Kruskal-Friedman theorems, this Journal, vol. 54 (1989), pp. 100–121.Google Scholar
[Gordeev 2]Gordeev, L., Proof-theoretical analysis: Weak systems of functions and classes, Annals of Pure and Applied Logic, vol. 38 (1988), pp. 1–121.CrossRefGoogle Scholar
[Higman]Higman, G., Ordering by divisibility in abstract algebras, Proceedings of the London Mathematical Society, set. 3, vol. 2 (1952), pp. 326–336.CrossRefGoogle Scholar
[Kruskal]Kruskal, J., Well-quasi-ordering, the tree theorem, and Vazsonyi's conjecture, Transactions of the American Mathematical Society, vol. 95 (1960), pp. 210–225.Google Scholar
[Okada]Okada, M., A simple relation between Buchholz's new system of ordinal notations and Takeuti's system of ordinal diagrams, this Journal, vol. 52 (1987), pp. 557–581.Google Scholar
[Schütte + Simpson]Schütte, K. and Simpson, S. G., Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen, Archiv für Mathematische Logik and Grundlagenforschung, vol. 25 (1985), pp. 75–89.CrossRefGoogle Scholar
[Simpson]Simpson, S. G., Nonprovability of certain combinatorial properties of finite trees, Harvey Friedman's research on the foundations of mathematics, North-Holland, Amsterdam, 1985, pp. 87–117.CrossRefGoogle Scholar