Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C.T. CHONG, "Generic sets and minimal covers", preprint.
R.M. FRIEDBERG, "A criterion for completeness of degrees of unsolvability", J. Symbolic Logic 22 (1957), 159–160.
C.G. JOCKUSCH, Jr., "Simple proofs of some theorems on high degrees of unsolvability", Canad. J. Math. 29 (1977), 1072–1080.
C.G. JOCKUSCH, Jr., "Degrees of generic sets", in Recursion Theory: Its Generalisations and Applications, (F.R. Drake and S.S. Wainer, eds.), Cambridge University Press, Cambridge, 1980.
C.G. JOCKUSCH, Jr. and D.B. POSNER, "Automorphism bases for degrees of unsolvability", Israel J. Math. 40 (1981), 150–164.
C.G. JOCKUSCH, Jr. and D.B. POSNER, "Double jumps of minimal degrees", J. Symbolic Logic 43 (1978), 715–724.
M. LERMAN, Degrees of Unsolvability, Springer Verlag, 1983.
D.A. MARTIN, "Measure, category and degrees of unsolvability", unpublished preprint, 1967.
D.B. POSNER, High Degrees, Doctoral Dissertation, University of California, Berkeley, 1977.
D.B. POSNER and R.W. ROBINSON, "Degrees joining to 0′," J. Symbolic Logic 46 (1981), 714–722.
C.E.M. YATES, "Density and incomparability in the degrees less than 0(1)" (abstract), J. Symbolic Logic 31 (1966), 301.
C.E.M. YATES, "Banach-Mazur games, comeager sets, and degrees of unsolvability", Math. Proc. Camb. Phil. Soc. 79 (1976), 195–220.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag
About this paper
Cite this paper
Chong, C.T., Jockusch, C.G. (1984). Minimal degrees and 1-generic sets below 0′. In: Börger, E., Oberschelp, W., Richter, M.M., Schinzel, B., Thomas, W. (eds) Computation and Proof Theory. Lecture Notes in Mathematics, vol 1104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0099479
Download citation
DOI: https://doi.org/10.1007/BFb0099479
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13901-0
Online ISBN: 978-3-540-39119-7
eBook Packages: Springer Book Archive