Skip to main content
SpringerLink
Log in

Exact Pair Theorem for the ω-Enumeration Degrees

  • Conference paper
Computation and Logic in the Real World (CiE 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4497))

Included in the following conference series:

Abstract

In the paper the exact pair theorem for the ω-enumeration degrees is proved. As a corollary an exact pair theorem involving the jump operation for the enumeration degrees is obtained.

Mathematics subject classification: 03D30.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MathSciNet  MATH  Google Scholar 

  2. Soskov, I.N.: The ω-enumereation degrees (To appear)

    Google Scholar 

  3. Soskov, I.N., Kovachev, B.: Uniform regular enumerations. Math.Struct. in Comp.Sci. 16, 901–924 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Spector, C.: On degrees of recursive unsolvability. Ann. of Math(2) 64, 581–592 (1956)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sofia University, Faculty of Mathematics and Informatics 5 James Bourchier blvd. 1164 Sofia, Bulgaria

    Hristo Ganchev

Authors
  1. Hristo Ganchev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Pure Mathematics, University of Leeds, LS2 9JT, Leeds, UK

    S. Barry Cooper

  2. Institue for Logic, Language and Computation (ILLC), Universiteit van Amsterdam, Plantage Muidergracht 24, 1018, TV Amsterdam, The Netherlands

    Benedikt Löwe

  3. Dipartimento di Scienze Matematiche ed Informatiche “R. Magari”, University of Siena, 53100, Siena, Italy

    Andrea Sorbi

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganchev, H. (2007). Exact Pair Theorem for the ω-Enumeration Degrees. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73001-9_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73000-2

  • Online ISBN: 978-3-540-73001-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation