Pseudo-Jump Operators. II: Transfinite Iterations, Hierarchies and Minimal Covers

Journal of Symbolic Logic 49 (4):1205 - 1236 (1984)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

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

Through your library

Similar books and articles

Jump Theorems for REA Operators.Alistair H. Lachlan & Xiaoding Yi - 1993 - Mathematical Logic Quarterly 39 (1):1-6.
Levels of discontinuity, limit-computability, and jump operators.de Brecht Matthew - 2014 - In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter. pp. 79-108.
Some jump-like operations in β-recursion theory.Colin G. Bailey - 2013 - Journal of Symbolic Logic 78 (1):57-71.
A characterization of jump operators.Howard Becker - 1988 - Journal of Symbolic Logic 53 (3):708-728.
2-Minimality, jump classes and a note on natural definability.Mingzhong Cai - 2014 - Annals of Pure and Applied Logic 165 (2):724-741.
Minimal degrees and the jump operator.S. B. Cooper - 1973 - Journal of Symbolic Logic 38 (2):249-271.
Minimal Degrees and the Jump Operator.S. B. Cooper - 1975 - Journal of Symbolic Logic 40 (1):86-87.
A minimal degree not realizing least possible jump.Leonard P. Sasso - 1974 - Journal of Symbolic Logic 39 (3):571-574.

Analytics

Added to PP
2009-01-28

Downloads
64 (#259,144)

6 months
18 (#152,314)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.
Lowness for genericity.Liang Yu - 2006 - Archive for Mathematical Logic 45 (2):233-238.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.

View all 26 citations / 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.
Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20‐22):341-352.
Some applications of forcing to hierarchy problems in arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20-22):341-352.

Add more references