Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
CrossRef.
Csima, Barbara F.
Dzhafarov, Damir D.
Hirschfeldt, Denis R.
Jockusch, Jr., Carl G.
Solomon, Reed
and
Brown Westrick, Linda
2018.
The reverse mathematics of Hindman’s Theorem for sums of exactly two elements.
Computability,
p.
1.
Patey, Ludovic
and
Yokoyama, Keita
2018.
The proof-theoretic strength of Ramsey's theorem for pairs and two colors.
Advances in Mathematics,
Vol. 330,
Issue. ,
p.
1034.
Eastaugh, Benedict
2017.
Book Reviews.
Studia Logica,
Vol. 105,
Issue. 4,
p.
873.
Astor, Eric P.
Dzhafarov, Damir D.
Solomon, Reed
and
Suggs, Jacob
2017.
The uniform content of partial and linear orders.
Annals of Pure and Applied Logic,
Vol. 168,
Issue. 6,
p.
1153.
Hirschfeldt, Denis R.
2017.
Computability and Complexity.
Vol. 10010,
Issue. ,
p.
22.
Dzhafarov, Damir D.
and
Patey, Ludovic
2017.
Coloring trees in reverse mathematics.
Advances in Mathematics,
Vol. 318,
Issue. ,
p.
497.
Jockusch, Carl G.
2017.
Computability and Complexity.
Vol. 10010,
Issue. ,
p.
127.
Frittaion, Emanuele
and
Patey, Ludovic
2017.
Coloring the rationals in reverse mathematics.
Computability,
Vol. 6,
Issue. 4,
p.
319.
Igusa, Gregory
and
Towsner, Henry
2017.
Computable Ramsey’s theorem for pairs needs infinitely many $$\Pi ^0_2$$ Π 2 0 sets.
Archive for Mathematical Logic,
Vol. 56,
Issue. 1-2,
p.
155.
Patey, Ludovic
2017.
Partial orders and immunity in reverse mathematics.
Computability,
p.
1.
Chong, C.T.
Slaman, Theodore A.
and
Yang, Yue
2017.
The inductive strength of Ramsey's Theorem for Pairs.
Advances in Mathematics,
Vol. 308,
Issue. ,
p.
121.
Berardi, Stefano
and
Tatsuta, Makoto
2017.
Equivalence of inductive definitions and cyclic proofs under arithmetic.
p.
1.
Dzhafarov, Damir D.
Jockusch, Carl G.
Solomon, Reed
and
Westrick, Linda Brown
2017.
Computability and Complexity.
Vol. 10010,
Issue. ,
p.
134.
PATEY, LUDOVIC
2016.
OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS.
The Bulletin of Symbolic Logic,
Vol. 22,
Issue. 02,
p.
151.
Patey, Ludovic
2016.
Controlling iterated jumps of solutions to combinatorial problems.
Computability,
Vol. 6,
Issue. 1,
p.
47.
Patey, Ludovic
2016.
The weakness of being cohesive, thin or free in reverse mathematics.
Israel Journal of Mathematics,
Vol. 216,
Issue. 2,
p.
905.
Steila, Silvia
and
Yokoyama, Keita
2016.
Reverse mathematical bounds for the Termination Theorem.
Annals of Pure and Applied Logic,
Vol. 167,
Issue. 12,
p.
1213.
Hirschfeldt, Denis R.
and
Jockusch, Carl G.
2016.
On notions of computability-theoretic reduction between Π21 principles.
Journal of Mathematical Logic,
Vol. 16,
Issue. 01,
p.
1650002.
Patey, Ludovic
2016.
Pursuit of the Universal.
Vol. 9709,
Issue. ,
p.
353.
Gasarch, William
2015.
Vol. 97,
Issue. ,
p.
147.