Switch to: References

Add citations

You must login to add citations.
  1. The Definability Strength of Combinatorial Principles.Wei Wang - 2016 - Journal of Symbolic Logic 81 (4):1531-1554.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Open Questions About Ramsey-Type Statements in Reverse Mathematics.Ludovic Patey - 2016 - Bulletin of Symbolic Logic 22 (2):151-169.
    Ramsey’s theorem states that for any coloring of then-element subsets of ℕ with finitely many colors, there is an infinite setHsuch that alln-element subsets ofHhave the same color. The strength of consequences of Ramsey’s theorem has been extensively studied in reverse mathematics and under various reducibilities, namely, computable reducibility and uniform reducibility. Our understanding of the combinatorics of Ramsey’s theorem and its consequences has been greatly improved over the past decades. In this paper, we state some questions which naturally arose (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • 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   3 citations  
  • The Weakness of the Pigeonhole Principle Under Hyperarithmetical Reductions.Benoit Monin & Ludovic Patey - 2020 - Journal of Mathematical Logic 21 (3):2150013.
    The infinite pigeonhole principle for 2-partitions asserts the existence, for every set A, of an infinite subset of A or of its complement. In this paper, we study the infinite pigeonhole pr...
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark