Switch to: Citations

Add references

You must login to add references.
  1. Proof-theoretic investigations on Kruskal's theorem.Michael Rathjen & Andreas Weiermann - 1993 - Annals of Pure and Applied Logic 60 (1):49-88.
    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.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
    Solovay has shown that if F: [ω] ω → 2 is a clopen partition with recursive code, then there is an infinite homogeneous hyperarithmetic set for the partition (a basis result). Simpson has shown that for every 0 α , where α is a recursive ordinal, there is a clopen partition F: [ω] ω → 2 such that every infinite homogeneous set is Turing above 0 α (an anti-basis result). Here we refine these results, by associating the "order type" of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An effective proof that open sets are Ramsey.Jeremy Avigad - 1998 - Archive for Mathematical Logic 37 (4):235-240.
    Solovay has shown that if $\cal{O}$ is an open subset of $P(\omega)$ with code $S$ and no infinite set avoids $\cal{O}$ , then there is an infinite set hyperarithmetic in $S$ that lands in $\cal{O}$ . We provide a direct proof of this theorem that is easily formalizable in $ATR_0$.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Functional interpretation and inductive definitions.Jeremy Avigad & Henry Towsner - 2009 - Journal of Symbolic Logic 74 (4):1100-1120.
    Extending Gödel's Dialectica interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finite-type functionals defined using transfinite recursion on well-founded trees.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Ordinal numbers and the Hilbert basis theorem.Stephen G. Simpson - 1988 - Journal of Symbolic Logic 53 (3):961-974.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Menger’s theorem in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\Pi^11\tt{-CA}0}}$$\end{document}. [REVIEW]Paul Shafer - 2012 - Archive for Mathematical Logic 51 (3-4):407-423.
    We prove Menger’s theorem for countable graphs in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\Pi^1_1\tt{-CA}_0}}$$\end{document}. Our proof in fact proves a stronger statement, which we call extended Menger’s theorem, that is equivalent to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\Pi^1_1\tt{-CA}_0}}$$\end{document} over \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\tt{RCA}_0}}$$\end{document}.
    Download  
     
    Export citation  
     
    Bookmark   2 citations