Conjectures and questions from Gerald Sacks's Degrees of Unsolvability

Archive for Mathematical Logic 36 (4-5):233-253 (1997)
  Copy   BIBTEX

Abstract

We describe the important role that the conjectures and questions posed at the end of the two editions of Gerald Sacks's Degrees of Unsolvability have had in the development of recursion theory over the past thirty years.

Categories

Keywords

Reprint years

DOI

10.1007/s001530050063

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Degrees of unsolvability: local and global theory.Manuel Lerman - 1983 - New York: Springer Verlag.
Degrees of unsolvability: structure and theory.Richard L. Epstein - 1979 - New York: Springer Verlag.
Initial segments of the degrees of unsolvability part II: Minimal degrees.C. E. M. Yates - 1970 - Journal of Symbolic Logic 35 (2):243-266.
Degrees of unsolvability.Joseph Robert Shoenfield - 1972 - New York,: American Elsevier.
A criterion for completeness of degrees of unsolvability.Richard Friedberg - 1957 - Journal of Symbolic Logic 22 (2):159-160.
Ω*1 as an initial segment of the c-degrees.Marcia Groszek - 1994 - Journal of Symbolic Logic 59 (3):956 - 976.
The Sacks density theorem and Σ2-bounding.Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (2):450 - 467.
Degrees of continuous functionals.Peter G. Hinman - 1973 - Journal of Symbolic Logic 38 (3):393-395.
On non-wellfounded iterations of the perfect set forcing.Vladimir Kanovei - 1999 - Journal of Symbolic Logic 64 (2):551-574.
Generalized cohesiveness.Tamara Hummel & Carl G. Jockusch - 1999 - Journal of Symbolic Logic 64 (2):489-516.
On degrees of unsolvability and complexity properties.Ivan Marques - 1975 - Journal of Symbolic Logic 40 (4):529-540.
Index sets and degrees of unsolvability.Michael Stob - 1982 - Journal of Symbolic Logic 47 (2):241-248.
Local initial segments of the Turing degrees.Bjørn Kjos-Hanssen - 2003 - Bulletin of Symbolic Logic 9 (1):26-36.
Busy Beaver sets and the degrees of unsolvability.Robert P. Daley - 1981 - Journal of Symbolic Logic 46 (3):460-474.

Analytics

Added to PP
2013-10-30

Downloads
27 (#572,408)

6 months
6 (#522,885)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Classical recursion theory: the theory of functions and sets of natural numbers.Piergiorgio Odifreddi - 1989 - New York, N.Y., USA: Sole distributors for the USA and Canada, Elsevier Science Pub. Co..
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
Saturated model theory.Gerald E. Sacks - 1972 - Reading, Mass.,: W. A. Benjamin.

View all 38 references / Add more references