A minimal degree not realizing least possible jump

Journal of Symbolic Logic 39 (3):571-574 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
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.
2-Minimality, jump classes and a note on natural definability.Mingzhong Cai - 2014 - Annals of Pure and Applied Logic 165 (2):724-741.
A 1-generic degree which Bounds a minimal degree.Masahiro Kumabe - 1990 - Journal of Symbolic Logic 55 (2):733-743.
On very high degrees.Keng Meng Ng - 2008 - Journal of Symbolic Logic 73 (1):309-342.

Analytics

Added to PP
2009-01-28

Downloads
7 (#1,413,139)

6 months
17 (#161,763)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.
Degrees which do not bound minimal degrees.Manuel Lerman - 1986 - Annals of Pure and Applied Logic 30 (3):249-276.
A 2-minimal non-gl2 degree.Mingzhong Cai - 2010 - Journal of Mathematical Logic 10 (1):1-30.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.

View all 6 citations / Add more citations

References found in this work

No references found.

Add more references