Highness and bounding minimal pairs

Mathematical Logic Quarterly 39 (1):475-491 (1993)

Abstract

This article has no associated abstract. (fix it)

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,879

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
2013-12-01

Downloads
30 (#386,131)

6 months
1 (#386,016)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Minimal Pairs and High Recursively Enumerable Degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
[Omnibus Review].Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
Working Below a Low2 Recursively Enumerably Degree.Richard A. Shore & Theodore A. Slaman - 1990 - Archive for Mathematical Logic 29 (3):201-211.

View all 8 references / Add more references

Citations of this work

Tracing and Domination in the Turing Degrees.George Barmpalias - 2012 - Annals of Pure and Applied Logic 163 (5):500-505.
There is No Fat Orbit.Rod Downey & Leo Harrington - 1996 - Annals of Pure and Applied Logic 80 (3):277-289.
The Computably Enumerable Degrees Are Locally Non-Cappable.Matthew B. Giorgi - 2004 - Archive for Mathematical Logic 43 (1):121-139.
Nonhemimaximal Degrees and the High/Low Hierarchy.Fang Chengling & Wu Guohua - 2012 - Journal of Symbolic Logic 77 (2):433-446.
Nonbounding and Slaman Triples.Steven D. Leonhardi - 1996 - Annals of Pure and Applied Logic 79 (2):139-163.

View all 10 citations / Add more citations

Similar books and articles

Bounding Non- GL ₂ and R.E.A.Klaus Ambos-Spies, Decheng Ding, Wei Wang & Liang Yu - 2009 - Journal of Symbolic Logic 74 (3):989-1000.
Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
Complementation in the Turing Degrees.Theodore A. Slaman & John R. Steel - 1989 - Journal of Symbolic Logic 54 (1):160-176.
Antibasis Theorems for {\ Pi^ 0_1} Classes and the Jump Hierarchy.Ahmet Çevik - 2013 - Archive for Mathematical Logic 52 (1-2):137-142.
A Minimal Pair Joining to a Plus Cupping Turing Degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
Minimal Pairs and High Recursively Enumerable Degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Some More Minimal Pairs of Α‐Recursively Enumerable Degrees.Richard A. Shore - 1978 - Mathematical Logic Quarterly 24 (25‐30):409-418.
Bounding Minimal Degrees by Computably Enumerable Degrees.Angsheng Li & Dongping Yang - 1998 - Journal of Symbolic Logic 63 (4):1319-1347.
Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Splittings of 0' Into the Recursively Enumerable Degrees.Xiaoding Yi - 1996 - Mathematical Logic Quarterly 42 (1):249-269.