Skip to main content
SpringerLink
Log in

Uniform Operators

  • 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:

  • 1108 Accesses

Abstract

We present the definition and a normal form of a class of operators on sets of natural numbers which generalize the enumeration operators.

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. Rogers Jr., H.: Theory of recursive functions and effective computability. McGraw-Hill Book Company, New York (1967)

    MATH  Google Scholar 

  2. Selman, A.: Arithmetical reducibilities I. Z. Math. Logik Grundlag. Math. 17, 335–350 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  3. Case, J.: Maximal arithmetical reducibilities. Z. Math. Logik Grundlag. Math. 20, 261–270 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ash, C.: Generalizations of enumeration reducibility using recursive infinitary propositional sentences. Ann. Pure Appl. Logic 58, 173–184 (1992)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Soskov, I.: A jump inversion theorem for the enumeration jump. Arch. Math. Logic 39, 417–437 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Soskov, I., Baleva, V.: Regular enumerations. J. Symbolic Logic 67, 1323–1343 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Computer Science, Sofia University, 5 James Bourchier Blvd., 1164, Sofia, Bulgaria

    Ivan N. Soskov

Authors
  1. Ivan N. Soskov
    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

Soskov, I.N. (2005). Uniform Operators. 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_55

Download citation

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

  • 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