Skip to main content
SpringerLink
Log in

C-Quasi-Minimal enumeration degrees below c'

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

This paper is dedicated to the study of properties of the operations ∪ and ∩ in the upper semilattice of the e-degrees as well as in the interval (c,c') e for any e-degree c.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Case, J.: Enumeration reducibility and partial degrees. Ann. Math. Logic 2 (4), 419–439 (1971)

    Article  MathSciNet  Google Scholar 

  2. Fridberg, R., Rogers, H.: Reducibility and completness for sets of integers. Z. Math. Logic Grundl. Math. 5, 117–125 (1959)

    Google Scholar 

  3. Goetse, B.G.: The structure of the lattice of recursive sets. Z. math. Log. und Grundl. Math. 22 (2), 187–191 (1976)

    Article  Google Scholar 

  4. McEvoy, K.: Jumps of quasi-minimal enumeration degrees. J. Symb. Logic 50, 839–848 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  5. Medvedev, Yu.T.: Degrees of difficulty of the mass problem. Dokl. Acad. Nauk SSSR 104 (4), 501–504 (1955)

    Google Scholar 

  6. Rogers, H., Jr.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967

  7. Sasso, L.P.: A survey of partial degrees. J. Symb. Logic 40, 130–140 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  8. Shoenfield, J.R.: On degrees of unsolvability. Ann. Math. 69 (2), 644–653 (1959)

    Article  MathSciNet  Google Scholar 

  9. Soar Robert, I.: Recursively Enumerable Sets and Degrees, Springer-Verlag, Berlin, Heidelberg, New York, London, 1987

Download references

Author information

Authors and Affiliations

  1. Dpt of Mathematics, ISUCT, h.7, Fr. Engels ave, Ivanovo, Russia, 153460

    Boris Solon

Authors
  1. Boris Solon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Boris Solon.

Additional information

The work was supported by grant IR-97-139 of INTAS-RFBR.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Solon, B. C-Quasi-Minimal enumeration degrees below c'. Arch. Math. Logic 45, 505–517 (2006). https://doi.org/10.1007/s00153-005-0318-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-005-0318-7

Keywords

Search

Navigation