Minimal upper bounds for sequences of -degrees

Journal of Symbolic Logic 43 (3):502-507 (1978)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273527

Links

PhilArchive



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

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

Minimal Upper Bounds for Sequences of $Delta^1_{2n}$-Degrees.Alexander S. Kechris - 1978 - Journal of Symbolic Logic 43 (3):502-507.
Minimal upper bounds for ascending sequences of α-recursively enumerable degrees.C. T. Chong - 1976 - Journal of Symbolic Logic 41 (1):250-260.
Upper bounds on ideals in the computably enumerable Turing degrees.George Barmpalias & André Nies - 2011 - Annals of Pure and Applied Logic 162 (6):465-473.
More about uniform upper Bounds on ideals of Turing degrees.Harold T. Hodes - 1983 - Journal of Symbolic Logic 48 (2):441-457.
Minimal upper Bounds for arithmetical degrees.Masahiro Kumabe - 1994 - Journal of Symbolic Logic 59 (2):516-528.
Least upper bounds for minimal pairs of α-R.E. α-degrees.Manuel Lerman - 1974 - Journal of Symbolic Logic 39 (1):49-56.
Minimal complementation below uniform upper Bounds for the arithmetical degrees.Masahiro Kumabe - 1996 - Journal of Symbolic Logic 61 (4):1158-1192.
A high c.e. degree which is not the join of two minimal degrees.Matthew B. Giorgi - 2010 - Journal of Symbolic Logic 75 (4):1339-1358.
Bounding and Nonbounding Minimal Pairs in the Enumeration Degrees.S. Barry Cooper, Angsheng Li, Andrea Sorbi & Yue Yang - 2005 - Journal of Symbolic Logic 70 (3):741 - 766.
Models of arithmetic and upper Bounds for arithmetic sets.Alistair H. Lachlan & Robert I. Soare - 1994 - Journal of Symbolic Logic 59 (3):977-983.
A Hyperimmune Minimal Degree and an ANR 2-Minimal Degree.Mingzhong Cai - 2010 - Notre Dame Journal of Formal Logic 51 (4):443-455.
Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy.Harold T. Hodes - 1981 - Journal of Symbolic Logic 46 (4):753-760.
Low upper bounds of ideals.Antonín Kučera & Theodore A. Slaman - 2009 - Journal of Symbolic Logic 74 (2):517-534.
Low upper bounds in the LR degrees.David Diamondstone - 2012 - Annals of Pure and Applied Logic 163 (3):314-320.
Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.

Analytics

Added to PP
2009-01-28

Downloads
22 (#669,532)

6 months
5 (#544,079)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Some descriptive set theory and core models.P. D. Welch - 1988 - Annals of Pure and Applied Logic 39 (3):273-290.

Add more citations

References found in this work

Add more references