Skip to main content
SpringerLink
Log in
Book cover

Recursion Theory Week pp 255–275Cite as

Recursive enumeration without repetition revisited

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1432))

This is a preview of subscription content, 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   34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Friedberg, R.M. Three theorems on recursive enumeration. I. Decomposition II. Maximal set III. Enumeration without duplication. J. Symbolic Logic 23, p. 309–316, 1958

    Article  MathSciNet  MATH  Google Scholar 

  2. Goncharov, S.S. The problem of the number of non-self-equivalent constructivizations. Sov. Math. Dokl. 21, 411–414, 1980

    MATH  Google Scholar 

  3. Howard, W.A. and Pour-El, M.B. A structural criterion for recursive enumeration without repetition. Z. Math. Logik Grundlag. Math. 10, 105–114, 1964

    Article  MathSciNet  MATH  Google Scholar 

  4. Kummer, M. Numberings of R1∪F. in: CSL'88, (Eds.: E. Börger, H. Kleine Büning, M. M. Richter), Lecture Notes in Computer Science 385, p.166–186, Springer-Verlag, Berlin, 1989.

    Chapter  Google Scholar 

  5. An easy priority-free proof of a theorem of Friedberg. to appear in: Theoretical Computer Science

    Google Scholar 

  6. Beiträge zur Theorie der Numerierungen: Eindeutige Numerierungen. Dissertation, Universität Karlsruhe, Fakultät für Informatik, 1989

    Google Scholar 

  7. Lachlan, A.H. Standard classes of recursively enumerable sets. Z. Math. Logik Grundlag. Math. 10, 23–42, 1964

    Article  MathSciNet  MATH  Google Scholar 

  8. On recursive enumeration without repetition. Z. Math. Logik Grundlag. Math. 11, 209–220, 1965

    Article  MathSciNet  MATH  Google Scholar 

  9. On recursive enumeration without repetition: A correction. Z. Math. Logik Grundlag. Math. 13, 99–100, 1967

    Article  MathSciNet  MATH  Google Scholar 

  10. Liu, S. An enumeration of the primitive recursive functions without repetition. Tohoku Math. J. 12, 400–402, 1960

    Article  MathSciNet  MATH  Google Scholar 

  11. Mal'tsev, A.I. Algorithms and recursive functions. English Translation: Wolters-Noordhoff Publishing, Groningen, 1970; Russian Edition: Izdatelstvo Nauka, Moskva, 1965; German Translation: Vieweg-Verlag, Braunschweig, 1974

    Google Scholar 

  12. Marchenkov, S.S. On minimal numerations of systems of recursively enumerable sets. Sov. Math. Dokl. 12, 843–845, 1971

    MATH  Google Scholar 

  13. Pour-El, M.B. Review of. J. Symbolic Logic 35, 223–229, 1960

    MathSciNet  Google Scholar 

  14. Pour-El, M.B. and Putnam, H. Recursively enumerable classes and their application to sequences of formal theories. Arch. math. Logik und Grundlagenforsch. 8, 104–121, 1965

    Article  MathSciNet  MATH  Google Scholar 

  15. Rogers, H. jr. Theory of recursive functions and effective computability. McGraw-Hill Book Company, New York, 1967

    MATH  Google Scholar 

  16. Soare, R.I. Recursively enumerable sets and degrees. Springer-Verlag, Berlin, 1987

    Book  MATH  Google Scholar 

  17. Wolf, C.E. Standard recursively enumerable classes I. Notices Amer. Math. Soc. 11, 386, 1964

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, Postfach 6980, D-7500, Karlsruhe, Deutschland

    Martin Kummer

Authors
  1. Martin Kummer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Klaus Ambos-Spies Gert H. Müller Gerald E. Sacks

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Kummer, M. (1990). Recursive enumeration without repetition revisited. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0086122

Download citation

  • DOI: https://doi.org/10.1007/BFb0086122

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52772-5

  • Online ISBN: 978-3-540-47142-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation