The weakness of the pigeonhole principle under hyperarithmetical reductions

Journal of Mathematical Logic 21 (3):2150013 (2020)
  Copy   BIBTEX

Abstract

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...

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,326

External links

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

Through your library

Analytics

Added to PP
2020-10-02

Downloads
37 (#483,544)

6 months
29 (#135,697)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Partition Genericity and Pigeonhole Basis Theorems.Benoit Monin & Ludovic Patey - 2024 - Journal of Symbolic Logic 89 (2):829-857.

Add more citations

References found in this work

On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
Ramsey's theorem and recursion theory.Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (2):268-280.
Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
RT₂² does not imply WKL₀.Jiayi Liu - 2012 - Journal of Symbolic Logic 77 (2):609-620.

View all 10 references / Add more references