Uniform enumeration operations

Journal of Symbolic Logic 40 (3):401-409 (1975)
  Copy   BIBTEX

Abstract

Sacks [2] has asked whether there exists a uniform solution to Post's problem, i.e. an enumeration operation W such that $\mathbf{d} for every degree d. It is shown here that if such an operation W exists it cannot itself in a particular technical sense be uniform. In fact, the jump operation is characterized amongst such uniform enumeration operations by the condition: $\mathbf{d} for all d. In addition, it is proved that the only other uniform enumeration operations such that d ≤ W (d) for all d are those which equal the identity operation above some fixed degrees

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

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

Through your library

Analytics

Added to PP
2009-01-28

Downloads
27 (#504,088)

6 months
4 (#315,908)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Conjectures and questions from Gerald Sacks's Degrees of Unsolvability.Richard A. Shore - 1997 - Archive for Mathematical Logic 36 (4-5):233-253.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references