Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Soare, Robert I.
1982.
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets.
Annals of Mathematical Logic,
Vol. 22,
Issue. 1,
p.
69.
Ambos-Spies, Klaus
Fleischhack, Hans
and
Huwig, Hagen
1984.
Automata, Languages and Programming.
Vol. 172,
Issue. ,
p.
58.
Schwarz, Steven
1984.
The quotient semilattice of the recursively enumerable degrees modulo the cappable degrees.
Transactions of the American Mathematical Society,
Vol. 283,
Issue. 1,
p.
315.
Ambos-Spies, Klaus
Jockusch, Carl G.
Shore, Richard A.
and
Soare, Robert I.
1984.
An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees.
Transactions of the American Mathematical Society,
Vol. 281,
Issue. 1,
p.
109.
Ambos-Spies, Klaus
1985.
Cupping and noncapping in the r.e. weak truth table and turing degrees.
Archiv für Mathematische Logik und Grundlagenforschung,
Vol. 25,
Issue. 1,
p.
109.
Jockusch, Carl G.
1985.
Recursion Theory Week.
Vol. 1141,
Issue. ,
p.
203.
Nerode, A.
and
Remmel, J. B.
1985.
Recursion Theory Week.
Vol. 1141,
Issue. ,
p.
271.
Fleischhack, Hans
1986.
Mathematical Foundations of Computer Science 1986.
Vol. 233,
Issue. ,
p.
341.
Nerode, A.
and
Remmel, J.B.
1986.
Generic objects in recursion theory II: Operations on recursive approximation spaces.
Annals of Pure and Applied Logic,
Vol. 31,
Issue. ,
p.
257.
Kučera, Antonín
1986.
Mathematical Foundations of Computer Science 1986.
Vol. 233,
Issue. ,
p.
493.
Ambos-Spies, Klaus
Fleischhack, Hans
and
Huwig, Hagen
1987.
Diagonalizations over polynomial time computable sets.
Theoretical Computer Science,
Vol. 51,
Issue. 1-2,
p.
177.
Kučera, Antonín
1987.
Logic Colloquium '86, Proceedings of the Colloquium held in Hull.
Vol. 124,
Issue. ,
p.
133.
Mohrherr, Jeanleah
1988.
A remark on the length problem.
Theoretical Computer Science,
Vol. 56,
Issue. 2,
p.
243.
Allender, Eric
1992.
Kolmogorov Complexity and Computational Complexity.
p.
4.
Decheng, Ding
1992.
The distribution of the generic recursively enumerable degrees.
Archive for Mathematical Logic,
Vol. 32,
Issue. 2,
p.
113.
Downey, Rod
and
Stob, Michael
1993.
Splitting theorems in recursion theory.
Annals of Pure and Applied Logic,
Vol. 65,
Issue. 1,
p.
1.
Remmel, J. B.
and
Crossley, J. N.
1993.
Logical Methods.
p.
1.
Cholak, Peter
and
Downey, Rod
1994.
Permutations and presentations.
Proceedings of the American Mathematical Society,
Vol. 122,
Issue. 4,
p.
1237.
Harrington, Leo
and
Soare, Robert
1996.
The Δ₃⁰-automorphism method and noninvariant classes of degrees.
Journal of the American Mathematical Society,
Vol. 9,
Issue. 3,
p.
617.
Harrington, Leo
and
Soare, Robert I.
1998.
Definable properties of the computably enumerable sets.
Annals of Pure and Applied Logic,
Vol. 94,
Issue. 1-3,
p.
97.