Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Jockusch, Carl G.
and
Soare, Robert I.
1972.
Π⁰₁ classes and degrees of theories.
Transactions of the American Mathematical Society,
Vol. 173,
Issue. 0,
p.
33.
Kobzev, G. N.
1973.
On btt-reducibilities. II.
Algebra and Logic,
Vol. 12,
Issue. 4,
p.
242.
McLaughlin, T. G.
1974.
Closed Basic Retracing Functions and Hyperimmune Sets.
Mathematical Logic Quarterly,
Vol. 20,
Issue. 4-6,
p.
49.
Jockusch, Carl G.
and
Simpson, Stephen G.
1976.
A degree-theoretic definition of the ramified analytical hierarchy.
Annals of Mathematical Logic,
Vol. 10,
Issue. 1,
p.
1.
Jockusch, Carl G.
and
Paterson, Michael S.
1976.
Completely Autoreducible Degrees.
Mathematical Logic Quarterly,
Vol. 22,
Issue. 1,
p.
571.
Solovay, Robert M.
1978.
Hyperarithmetically encodable sets.
Transactions of the American Mathematical Society,
Vol. 239,
Issue. 0,
p.
99.
Daley, Robert P.
1978.
On the Simplicity of Busy Beaver Sets.
Mathematical Logic Quarterly,
Vol. 24,
Issue. 13-14,
p.
207.
1992.
Vol. 125,
Issue. ,
p.
603.
Cholak, P.
Downey, R.
and
Stob, M.
1992.
Automorphisms of the lattice of recursively enumerable sets: promptly simple sets.
Transactions of the American Mathematical Society,
Vol. 332,
Issue. 2,
p.
555.
Fenner, Stephen
and
Schaefer, Marcus
1999.
Bounded Immunity and Btt‐Reductions.
Mathematical Logic Quarterly,
Vol. 45,
Issue. 1,
p.
3.
Blass, Andreas
2001.
Needed reals and recursion in generic reals.
Annals of Pure and Applied Logic,
Vol. 109,
Issue. 1-2,
p.
77.
Mildenberger, Heike
and
Shelah, Saharon
2004.
On needed reals.
Israel Journal of Mathematics,
Vol. 141,
Issue. 1,
p.
1.
Cintioli, Patrizio
2005.
Sets without Subsets of Higher Many-One Degree.
Notre Dame Journal of Formal Logic,
Vol. 46,
Issue. 2,
Heinatsch, Christoph
2009.
$${\Pi^1_2}$$ -comprehension and the property of Ramsey.
Archive for Mathematical Logic,
Vol. 48,
Issue. 3-4,
p.
323.
Cholak, Peter A.
Dzhafarov, Damir D.
and
Soskova, Mariya I.
2016.
Genericity for Mathias forcing over general Turing ideals.
Israel Journal of Mathematics,
Vol. 216,
Issue. 2,
p.
583.
Cooper, S. Barry
2017.
Logic Colloquium '98.
p.
154.
Fokina, Ekaterina
Rossegger, Dino
San Mauro, Luca
Brattka, Vasco
Downey, Rod
Knight, Julia F.
and
Lempp, Steffen
2019.
Measuring the complexity of reductions between equivalence relations.
Computability,
Vol. 8,
Issue. 3-4,
p.
265.
Dzhafarov, Damir
Flood, Stephen
Solomon, Reed
and
Westrick, Linda
2021.
Effectiveness for the Dual Ramsey Theorem.
Notre Dame Journal of Formal Logic,
Vol. 62,
Issue. 3,
LI, ANG
2023.
INTROENUMERABILITY, AUTOREDUCIBILITY, AND RANDOMNESS.
The Journal of Symbolic Logic,
p.
1.