Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
1992.
Vol. 125,
Issue. ,
p.
603.
Shore, Richard A.
1999.
Handbook of Computability Theory.
Vol. 140,
Issue. ,
p.
169.
Ambos-Spies, Klaus
Hirschfeldt, Denis R.
and
Shore, Richard A.
2000.
Undecidability and 1-types in intervals of the computably enumerable degrees.
Annals of Pure and Applied Logic,
Vol. 106,
Issue. 1-3,
p.
1.
Nies, André
2001.
Interpreting N in the computably enumerable weak truth table degrees.
Annals of Pure and Applied Logic,
Vol. 107,
Issue. 1-3,
p.
35.
Miller, Russell
Nies, Andre
and
Shore, Richard
2003.
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable.
Transactions of the American Mathematical Society,
Vol. 356,
Issue. 8,
p.
3025.
Mytilinaios, Michael~E.
and
Slaman, Theodore A.
2003.
Differences between Resource Bounded Degree Structures.
Notre Dame Journal of Formal Logic,
Vol. 44,
Issue. 1,
Greenberg, Noam
and
Montalbán, Antonio
2003.
Embedding and Coding below a 1-Generic Degree.
Notre Dame Journal of Formal Logic,
Vol. 44,
Issue. 4,
Jockusch, Carl
Li, Angsheng
and
Yang, Yue
2004.
A join theorem for the computably enumerable degrees.
Transactions of the American Mathematical Society,
Vol. 356,
Issue. 7,
p.
2557.
Greenberg, Noam
Montalbán, Antonio
and
Shore, Richard A.
2004.
Generalized high degrees have the complementation property.
Journal of Symbolic Logic,
Vol. 69,
Issue. 4,
p.
1200.
Greenberg, Noam
2005.
The Role of True Finiteness in the Admissible Recursively Enumerable Degrees.
Bulletin of Symbolic Logic,
Vol. 11,
Issue. 3,
p.
398.
Yu, Liang
and
Yang, Yue
2005.
On the definable ideal generated by nonbounding c.e. degrees.
Journal of Symbolic Logic,
Vol. 70,
Issue. 1,
p.
252.
GREENBERG, NOAM
SHORE, RICHARD A.
and
SLAMAN, THEODORE A.
2006.
THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES.
Journal of Mathematical Logic,
Vol. 06,
Issue. 01,
p.
49.
Downey, Rod
and
Greenberg, Noam
2006.
Theory and Applications of Models of Computation.
Vol. 3959,
Issue. ,
p.
46.
Chong, C.T.
Li, A.
and
Yang, Y.
2006.
The existence of high nonbounding degrees in the difference hierarchy.
Annals of Pure and Applied Logic,
Vol. 138,
Issue. 1-3,
p.
31.
Shore, Richard A.
2006.
Degree Structures: Local and Global Investigations.
Bulletin of Symbolic Logic,
Vol. 12,
Issue. 3,
p.
369.
COLE, JOSHUA A.
and
SIMPSON, STEPHEN G.
2007.
MASS PROBLEMS AND HYPERARITHMETICITY.
Journal of Mathematical Logic,
Vol. 07,
Issue. 02,
p.
125.
DOWNEY, ROD
GREENBERG, NOAM
and
WEBER, REBECCA
2007.
TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES.
Journal of Mathematical Logic,
Vol. 07,
Issue. 02,
p.
145.
Li, Angsheng
2007.
Theory and Applications of Models of Computation.
Vol. 4484,
Issue. ,
p.
79.
SHORE, RICHARD A.
2007.
DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP.
Journal of Mathematical Logic,
Vol. 07,
Issue. 02,
p.
229.
Ganchev, Hristo
2009.
Mathematical Theory and Computational Practice.
Vol. 5635,
Issue. ,
p.
242.