Proof-theoretic investigations on Kruskal's theorem

Annals of Pure and Applied Logic 60 (1):49-88 (1993)
  Copy   BIBTEX

Abstract

In this paper we calibrate the exact proof-theoretic strength of Kruskal's theorem, thereby giving, in some sense, the most elementary proof of Kruskal's theorem. Furthermore, these investigations give rise to ordinal analyses of restricted bar induction

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,749

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An intuitionistic proof of Kruskal’s theorem.Wim Veldman - 2004 - Archive for Mathematical Logic 43 (2):215-264.
Complexity Bounds for Some Finite Forms of Kruskal's Theorem.Andreas Weiermann - 2004 - Bulletin of Symbolic Logic 10 (4):588-590.
A note on Bar Induction in Constructive Set Theory.Michael Rathjen - 2006 - Mathematical Logic Quarterly 52 (3):253-258.

Analytics

Added to PP
2014-01-16

Downloads
36 (#442,498)

6 months
23 (#152,424)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Michael Rathjen
University of Leeds