Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Patey, Ludovic
2016.
Controlling iterated jumps of solutions to combinatorial problems.
Computability,
Vol. 6,
Issue. 1,
p.
47.
Patey, Ludovic
2017.
Iterative forcing and hyperimmunity in reverse mathematics.
Computability,
Vol. 6,
Issue. 3,
p.
209.
Brattka, Vasco
Hendtlass, Matthew
and
Kreuzer, Alexander P.
2018.
On the Uniform Computational Content of the Baire Category Theorem.
Notre Dame Journal of Formal Logic,
Vol. 59,
Issue. 4,
Csima, Barbara F.
Dzhafarov, Damir D.
Hirschfeldt, Denis R.
Jockusch, Jr., Carl G.
Solomon, Reed
Brown Westrick, Linda
Brattka, Vasco
Downey, Rod
Knight, Julia F.
and
Lempp, Steffen
2019.
The reverse mathematics of Hindman’s Theorem for sums of exactly two elements.
Computability,
Vol. 8,
Issue. 3-4,
p.
253.
Sanders, Sam
2019.
Logic, Language, Information, and Computation.
Vol. 11541,
Issue. ,
p.
550.
Sanders, Sam
2019.
Computing with Foresight and Industry.
Vol. 11558,
Issue. ,
p.
253.
Cholak, Peter A.
Igusa, Gregory
Patey, Ludovic
Soskova, Mariya I.
and
Turetsky, Dan
2019.
The Rado path decomposition theorem.
Israel Journal of Mathematics,
Vol. 234,
Issue. 1,
p.
179.
Sanders, Sam
2021.
Nets and reverse mathematics.
Computability,
Vol. 10,
Issue. 1,
p.
31.
Sanders, Sam
2022.
Countable sets versus sets that are countable in reverse mathematics.
Computability,
Vol. 11,
Issue. 1,
p.
9.