Generators of the recursively enumerable degrees
Part of the Lecture Notes in Mathematics book series (LNM, volume 1141)
- 219 Downloads
KeywordsInductive Hypothesis Finite Collection Minimal Pair Splitting Theorem Infinite Rank
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 1.K. Ambos-Spies, On the structure of the recursively enumerable degrees, Dissertation, Universität München, 1980.Google Scholar
- 3.K. Ambos-Spies, Contiguous r.e. degrees, in Proceedings of Logic Colloquium 83, Springer Lecture Notes in Mathematics, 1104 (1984) 1–37.Google Scholar
- 4.K. Ambos-Spies and M. Lerman, Lattice embeddings into the recursively enumerable degrees, to appear.Google Scholar
- 6.C.G. Jockusch, Jr. and D. Posner, Automorphism bases for degrees of unsolvability, Israel J. Math., to appear.Google Scholar
- 10.M. Lerman, Admissible ordinals and priority arguments,in Proc. Cambridge Summer School in Logic 1971, Lecture Notes in Mathematics, No. 337 (1973), Springer Verlag.Google Scholar
- 12.G.E. Sacks, Degrees of unsolvability, Ann. of Math. Studies 55, rev. ed. 1966, Princeton University Press.Google Scholar
- 14.R.I. Soare, Fundamental methods for constructing recursively enumerable degrees, in Recursion Theory: Its Generalisations and Applications, F.R. Drake and S.S. Wainer, Eds., Cambridge University Press, Lecture Notes 45 (1980), 1–51.Google Scholar
- 17.K. Ambos-Spies and R.I. Soare, The recursively enumerable degrees have infinitely many one types, to appear.Google Scholar
© Springer-Verlag 1985