Switch to: References

Add citations

You must login to add citations.
  1. Nonstandard Models in Recursion Theory and Reverse Mathematics.C. T. Chong, Wei Li & Yue Yang - 2014 - Bulletin of Symbolic Logic 20 (2):170-200.
    We give a survey of the study of nonstandard models in recursion theory and reverse mathematics. We discuss the key notions and techniques in effective computability in nonstandard models, and their applications to problems concerning combinatorial principles in subsystems of second order arithmetic. Particular attention is given to principles related to Ramsey’s Theorem for Pairs.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • On Notions of Computability-Theoretic Reduction Between Π21 Principles.Denis R. Hirschfeldt & Carl G. Jockusch - 2016 - Journal of Mathematical Logic 16 (1):1650002.
    Several notions of computability-theoretic reducibility between [Formula: see text] principles have been studied. This paper contributes to the program of analyzing the behavior of versions of Ramsey’s Theorem and related principles under these notions. Among other results, we show that for each [Formula: see text], there is an instance of RT[Formula: see text] all of whose solutions have PA degree over [Formula: see text] and use this to show that König’s Lemma lies strictly between RT[Formula: see text] and RT[Formula: see (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Annals of Pure and Applied Logic.Itay Neeman - 2003 - Bulletin of Symbolic Logic 9 (3):414-416.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  • Degrees Bounding Principles and Universal Instances in Reverse Mathematics.Ludovic Patey - 2015 - Annals of Pure and Applied Logic 166 (11):1165-1185.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Algorithmic Randomness, Reverse Mathematics, and the Dominated Convergence Theorem.Jeremy Avigad, Edward T. Dean & Jason Rute - 2012 - Annals of Pure and Applied Logic 163 (12):1854-1864.
    We analyze the pointwise convergence of a sequence of computable elements of L1 in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA0, each is equivalent to the assertion that every Gδ subset of Cantor space with positive measure has an element. This last statement is, in turn, equivalent to weak weak Königʼs lemma relativized to the Turing jump of any set. It is also equivalent to the (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Open Questions About Ramsey-Type Statements in Reverse Mathematics.Ludovic Patey - 2016 - Bulletin of Symbolic Logic 22 (2):151-169.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Cohesive Sets and Rainbows.Wei Wang - 2014 - Annals of Pure and Applied Logic 165 (2):389-408.
    We study the strength of RRT32, Rainbow Ramsey Theorem for colorings of triples, and prove that RCA0 + RRT32 implies neither WKL0 nor RRT42 source. To this end, we establish some recursion theoretic properties of cohesive sets and rainbows for colorings of pairs. We show that every sequence admits a cohesive set of non-PA Turing degree; and that every ∅′-recursive sequence admits a low3 cohesive set.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   3 citations