|
4
|
The canonical Ramsey theorem and computability theory
– Joseph R. Mileti
|
|
6
|
Partition Theorems and Computability Theory
– Joseph Roy Mileti
- 2004
|
|
|
The Hilbert problems and Hilbert’s Program
– Stephen G. Simpson
- 2008
|
|
14
|
Combinatorial Principles Weaker than Ramsey's Theorem for Pairs
– Denis R. Hirschfeldt, Richard A. Shore
|
|
4
|
A Survey of Recursive Combinatorics
– William Gasarch
|
|
7
|
Computability-Theoretic and Proof-Theoretic Aspects of Partial and Linear Orderings
– Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, D. Reed Solomon
|
|
3
|
Forcing in Proof Theory
– Jeremy Avigad, Jeremy Avigad
|
|
9
|
Number theory and elementary arithmetic
– Jeremy Avigad
- 2003
|
|
15
|
Ramsey's theorem and the pigeonhole principle in intuitionistic mathematics
– Wim Veldman, Marc Bezem
- 1992
|
|
2
|
Soare, Bounding homogeneous models
– Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare
|
|
2
|
Ramsey’s Theorem and cone avoidance, this
– Damir D. Dzhafarov, Carl, G. Jockusch
|
|
1
|
LOW UPPER BOUNDS OF IDEALS
– Antonín Kučera, Theodore, A. Slaman
|
|
3
|
The atomic model theorem
– Denis R. Hirschfeldt, Richard A. Shore, Theodore A. Slaman
|
|
|
THE STRENGTH OF THE RAINBOW RAMSEY THEOREM
– Barbara F. Csima, Joseph, R. Mileti
- 2009
|
|
3
|
Reverse Mathematics and Recursive Graph Theory
– William Gasarch, Jeffry L. Hirst
- 1998
|
|
8
|
Elimination of Skolem functions for monotone formulas in analysis
– Ulrich Kohlenbach
|
|
|
Cupping and Noncupping in the Enumeration Degrees of ... Sets
– S. Barry Cooper, Ls Jt England, Andrea Sorbi, Xiaoding Yi
|
|
|
Mathematical Definability
– Theodore A. Slaman
|
|
|
OPEN QUESTIONS IN REVERSE MATHEMATICS
– Antonio Montalbán
- 2010
|
