Switch to: Citations

Add references

You must login to add references.
  1. Nonprovability of Certain Combinatorial Properties of Finite Trees.Stephen G. Simpson - 1990 - Journal of Symbolic Logic 55 (2):868-869.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • 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  
  • Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.
    Download  
     
    Export citation  
     
    Bookmark   72 citations  
  • The metamathematics of scattered linear orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
    Pursuing the proof-theoretic program of Friedman and Simpson, we begin the study of the metamathematics of countable linear orderings by proving two main results. Over the weak base system consisting of arithmetic comprehension, II 1 1 -CA0 is equivalent to Hausdorff's theorem concerning the canonical decomposition of countable linear orderings into a sum over a dense or singleton set of scattered linear orderings. Over the same base system, ATR0 is equivalent to a version of the Continuum Hypothesis for linear orderings, (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • On Fraïssé's Order Type Conjecture.Richard Laver & Saharon Shelah - 1987 - Journal of Symbolic Logic 52 (2):571-574.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Up to Equimorphism, Hyperarithmetic Is Recursive.Antonio Montalbán - 2005 - Journal of Symbolic Logic 70 (2):360 - 378.
    Two linear orderings are equimorphic if each can be embedded into the other. We prove that every hyperarithmetic linear ordering is equimorphic to a recursive one. On the way to our main result we prove that a linear ordering has Hausdorff rank less than $\omega _{1}^{\mathit{CK}}$ if and only if it is equimorphic to a recursive one. As a corollary of our proof we prove that, given a recursive ordinal α, the partial ordering of equimorphism types of linear orderings of (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Computability theory and linear orders.Rod Downey - 1998 - In I︠U︡riĭ Leonidovich Ershov (ed.), Handbook of recursive mathematics. New York: Elsevier. pp. 138--823.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Reverse mathematics and rank functions for directed graphs.Jeffry L. Hirst - 2000 - Archive for Mathematical Logic 39 (8):569-579.
    A rank function for a directed graph G assigns elements of a well ordering to the vertices of G in a fashion that preserves the order induced by the edges. While topological sortings require a one-to-one matching of vertices and elements of the ordering, rank functions frequently must assign several vertices the same value. Theorems stating basic properties of rank functions vary significantly in logical strength. Using the techniques of reverse mathematics, we present results that require the subsystems ${\ensuremath{\vec{RCA}_0}}$ , (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations