KeywordsIncompleteness Theorem Finite Tree Transfinite Induction Countable Ordinal Trivial Tree
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- First, let me simply update the references to my column on the Paris-Harrington Theorem: The papers of Erdös and Mills and of Ketonen and Solovay have since appeared, the former in the Journal of Combinatorial Theory, series A, vol. 30 (1981), pp. 53–70, and the latter in the Annals of Mathematics, vol. 113 (1981), pp. 267- 314. In addition, I note the bookRamsey Theory (J. Wiley, 1980) by R. Graham, B. Rothschild and J. Spencer has a nice exposition of a variant of the Ketonen-Solovay work.CrossRefGoogle Scholar
- Friedman’s work reported above is not, at the time of writing, in manuscript form and I can only cite some background material. With respect to Kruskal’s Theorem and ordinals, I suggest: J. B. Kruskal, Well-quasi-ordering, the tree theorem, and Vázsonyi’s conjecture, Trans. AMS 95 (1960), pp. 210–225.MATHCrossRefMathSciNetGoogle Scholar
- D. Schmidt, Well-partial-orderings and their maximal order types, Habilitationsschrift, Heidelberg, 1978.Google Scholar
- Finally, a good reference on Γ0, ordinals, and proof theory is K. Schütte,Proof Theory (Springer-Verlag, 1977).Google Scholar
© Springer Science+Business Media, Inc. 1982