Skip to main content
SpringerLink
Log in

Complements for enumeration Π 01 -degrees

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

We consider the question of the existence of complements for the enumeration degrees of cocomputably enumerable sets in the local structure of e-degrees.

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. Cooper S. B., “Enumeration reducibility, nondeterministic computations and relative computability of partial functions,” Lecture Notes Math., 1432, 57–110 (1990).

    Article  Google Scholar 

  2. Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Comp., New York, St. Louis, San Francisco, Toronto, London, and Sydney (1972).

    MATH  Google Scholar 

  3. Cooper S. B., “Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ 02 sets are dense,” J. Symbolic Logic, 49, 503–513 (1984).

    Article  MATH  MathSciNet  Google Scholar 

  4. Epstein E. L., Minimal Degrees of Unsolvability and the Full Approximation Construction, Amer. Math. Soc., Providence, RI (1974) (Mem. Amer. Math. Soc.; V. 162).

    Google Scholar 

  5. Posner D. B., “The upper semilattice of degrees ≤ 0′ is complemented,” J. Symbolic Logic, 46, 705–713 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  6. Posner D. B. and Robinson R. W., “Degrees joining to 0′,” J. Symbolic Logic, 46, 714–722 (1981).

    Article  MATH  MathSciNet  Google Scholar 

  7. Cooper S. B., Sorbi A., and Yi X., “Cupping and noncupping in the enumeration degrees of Σ 02 -sets,” Ann. Pure Appl. Log., 82, 317–342 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  8. Kalimullin I. Sh., “Relative complements in Δ02 -degrees with respect to enumerability,” Algebra and Logic, 39, No. 5, 313–323 (2000).

    Article  MathSciNet  Google Scholar 

  9. Kalimullin I. Sh., Structural Properties of the Enumeration Degree Upper Semilattice Diss. Kand. Fiz.-Mat. Nauk, Kazan, 2001.

    Google Scholar 

  10. Soare R. I., Recursively Enumerable Sets and Degrees, Springer-Verlag, Heidelberg (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazan (Volga Region) Federal University, Kazan, Russia

    M. Kh. Faizrahmanov

Authors
  1. M. Kh. Faizrahmanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Kh. Faizrahmanov.

Additional information

Original Russian Text Copyright © 2013 Faizrahmanov M.Kh.

The author was supported by the Russian Foundation for Basic Research (Grant 12-01-31389 mol a), the Federal Target Program “Scientific and Scientific-Pedagogical Personnel of Innovative Russia” (State Contract 14.A18.21.1127), and the President of the Russian Federation (Grant MK-6106.2012.1). Kazan

__________

Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 54, No. 6, pp. 1388–1398, November–December, 2013.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Faizrahmanov, M.K. Complements for enumeration Π 01 -degrees. Sib Math J 54, 1104–1109 (2013). https://doi.org/10.1134/S0037446613060177

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0037446613060177

Keywords

Search

Navigation