Skip to main content
×
Home
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 26
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    2016. Algebraic Computability and Enumeration Models.


    Ambos-Spies, Klaus and Fejer, Peter A. 2014. Computational Logic.


    CHONG, C. T. LI, WEI and YANG, YUE 2014. NONSTANDARD MODELS IN RECURSION THEORY AND REVERSE MATHEMATICS. The Bulletin of Symbolic Logic, Vol. 20, Issue. 02, p. 170.


    Li, Angsheng 2009. Elementary differences among jump classes. Theoretical Computer Science, Vol. 410, Issue. 11, p. 1042.


    Cooper, S. Barry and Li, Angsheng 2008. On Lachlan’s major sub-degree problem. Archive for Mathematical Logic, Vol. 47, Issue. 4, p. 341.


    Chong, C.T. Li, A. and Yang, Y. 2006. The existence of high nonbounding degrees in the difference hierarchy. Annals of Pure and Applied Logic, Vol. 138, Issue. 1-3, p. 31.


    Downey, Rod Li, Angsheng and Wu, Guohua 2004. Complementing cappable degrees in the difference hierarchy. Annals of Pure and Applied Logic, Vol. 125, Issue. 1-3, p. 101.


    Downey, R. and Stob, M. 1997. Minimal pairs in initial segments of the recursively enumerable degrees. Israel Journal of Mathematics, Vol. 100, Issue. 1, p. 7.


    Downey, Rod and Shore, Richard A. 1996. Lattice embeddings below a nonlow2 recursively enumerable degree. Israel Journal of Mathematics, Vol. 94, Issue. 1, p. 221.


    Yi, Xiaoding 1996. Splittings of 0' into the Recursively Enumerable Degrees. Mathematical Logic Quarterly, Vol. 42, Issue. 1, p. 249.


    Downey, Rodney G. Lempp, Steffen and Shore, Richard A. 1993. Highness and bounding minimal pairs. Mathematical Logic Quarterly, Vol. 39, Issue. 1, p. 475.


    Downey, Rod and Stob, Michael 1993. Splitting theorems in recursion theory. Annals of Pure and Applied Logic, Vol. 65, Issue. 1, p. 1.


    Downey, Rod 1990. Lattice nonembeddings and initial segments of the recursively enumerable degrees. Annals of Pure and Applied Logic, Vol. 49, Issue. 2, p. 97.


    Shoenfield, J.R. 1990. Non-bounding constructions. Annals of Pure and Applied Logic, Vol. 50, Issue. 2, p. 191.


    Ambos-Spies, Klaus and Soare, Robert I. 1989. The recursively enumerable degrees have infinitely many one-types. Annals of Pure and Applied Logic, Vol. 44, Issue. 1-2, p. 1.


    Downey, R.G. 1989. Intervals and sublattices of the r.e. weak truth table degrees, part II: Nonbounding. Annals of Pure and Applied Logic, Vol. 44, Issue. 3, p. 153.


    Downey, R.G. and Remmel, J.B. 1989. Classifications of degree classes associated with r.e. subspaces. Annals of Pure and Applied Logic, Vol. 42, Issue. 2, p. 105.


    Downey, R.G. 1989. Intervals and sublattices of the R.E. weak truth table degrees, part I: Density. Annals of Pure and Applied Logic, Vol. 41, Issue. 1, p. 1.


    Fejer, Peter A. 1989. Embedding Lattices with Top Preserved Below Non-GL2 Degrees. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, Vol. 35, Issue. 1, p. 3.


    Shore, Richard A. 1988. A non-inversion theorem for the jump operator. Annals of Pure and Applied Logic, Vol. 40, Issue. 3, p. 277.


    ×

Bounding minimal pairs

  • A. H. Lachlan (a1)
  • DOI: http://dx.doi.org/10.2307/2273300
  • Published online: 01 March 2014
Abstract

A minimal pair of recursively enumerable (r.e.) degrees is a pair of degrees a, b of nonrecursive r.e. sets with the property that if ca and cb then c = 0. Lachlan [2] and Yates [4] independently proved the existence of minimal pairs. It was natural to ask whether for an arbitrary nonzero r.e. degree c there is a minimal pair a, b with ac and bc. In 1971 Lachlan and Ladner proved that a minimal pair below c cannot be obtained in a uniformly effective way from c for r.e. c ≠ 0. but the result was never published. More recently Cooper [1] showed that if c is r.e. and c′ = 0″ then there is a minimal pair below c.

In this paper we prove two results:

Theorem 1. There exists a nonzero r.e. degree with no minimal pair below it.

Theorem 2. There exists a nonzero r.e. degree c such that, if d is r.e. and 0 < d ≤ c, then there is a minimal pair below d.

The second theorem is a straightforward variation on the original minimal pair construction, but the proof of the first theorem has some novel features. After some preliminaries in §1, the first theorem is proved in §2 and the second in §3.

I am grateful to Richard Ladner who collaborated with me during the first phase of work on this paper as witnessed by our joint abstract [3]. The many discussions we had about the construction required in Theorem 1 were of great help to me.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×