Skip to main content
SpringerLink
Log in

On the Problems of Definability in the Enumeration Degrees

  • Conference paper
New Computational Paradigms (CiE 2005)

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

Included in the following conference series:

  • 1113 Accesses

Abstract

Informally, the enumeration degree deg e (A) (or e-degree) of a set A of natural numbers is a class of sets which have the same enumeration difficulty (see [2] for the exact definition).

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

References

  1. Kalimullin, I.S.: Definability of the jump operator in the enumeration degrees. J. Math. Logic. 3(2), 257–267 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazan State University, Kazan, Russia

    Iskander Sh. Kalimullin

Authors
  1. Iskander Sh. Kalimullin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mathematics, University of Leeds, LS2 9JT, Leeds, U.K.

    S. Barry Cooper

  2. Department Mathematik, Universität Hamburg, Bundesstrasse 55, 20146, Hamburg, Germany

    Benedikt Löwe

  3. Universiteit van Amsterdam,  

    Leen Torenvliet

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kalimullin, I.S. (2005). On the Problems of Definability in the Enumeration Degrees. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds) New Computational Paradigms. CiE 2005. Lecture Notes in Computer Science, vol 3526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11494645_27

Download citation

  • DOI: https://doi.org/10.1007/11494645_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26179-7

  • Online ISBN: 978-3-540-32266-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation