Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Computer Science Logic

CSL 1988: CSL '88 pp 166–186Cite as

Numberings of R1∪F

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 385))

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. Ershov, Yu.L. Numerations of families of general recursive functions Siberian Mathematical Journal 8, p. 771–778, 1967

    Google Scholar 

  2. Ershov, Yu.L. Theorie der Numerierungen I, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 19 p. 289–388, 1973

    Google Scholar 

  3. Ershov, Yu.L. Theorie der Numerierungen II, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 21 p. 473–584, 1975

    Google Scholar 

  4. Friedberg, R.M. Three Theorems on recursive enumeration. I.Decomposition II. Maximal set III. Enumeration without duplication Journal of Symbolic Logic 23, p. 309–316, 1958

    Google Scholar 

  5. Howard, W.A. and Pour-El, M.B. A structural criterion for recursive enumeration without repetition, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 10, p. 105–114, 1964

    Google Scholar 

  6. Khutoretskij, A.B. On the reducibility of computable numerations, Algebra and Logic 8, p. 145–151, 1970

    Article  Google Scholar 

  7. Kummer, M. Negative results about the length problem, in: Computation Theory and Logic (Ed: Börger, E.), Lecture Notes in Computer Science 270, p. 237–248, 1987

    Google Scholar 

  8. Kummer, M. The length problem for co-r.e. sets, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 34 p.277–282, 1988

    Google Scholar 

  9. Kummer, M. An easy priority-free proof of a theorem of Friedberg, submitted for publication

    Google Scholar 

  10. Kummer, M. Beiträge zur Theorie der Numerierungen, Dissertation, Fakultät für Informatik, Universität Karlsruhe, to appear

    Google Scholar 

  11. Lachlan, A.H. Standard classes of recursively enumerable sets, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 10 p. 23–42, 1964

    Google Scholar 

  12. Lachlan, A.H. On recursive enumeration without repetition, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 11 p. 209–220, 1965

    Google Scholar 

  13. Lachlan, A.H. On recursive enumeration without repetition: A correction Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 13 p. 99–100, 1967

    Google Scholar 

  14. Liu, S. An enumeration of the primitive recursive functions without repetition, Tohoku Mathematical Journal 12, 400–402, 1960

    Google Scholar 

  15. Malcev, A.I. Positive and negative numerations, Soviet Mathematics. Doklady. 6, p. 75–77, 1965

    Google Scholar 

  16. Malcev, A.I. Algorithms and recursive functions, Russian edition: Izdatelstvo Nauka, Moskva 1965, Engl. Transl.: Wolters-Noordhoff Publishing, Groningen, 1970

    Google Scholar 

  17. Marchenkov, S.S. On minimal numerations of systems of recursively enumerable sets, Soviet Mathematics. Doklady. 12, p.843–845, 1971

    Google Scholar 

  18. Marchenkov, S.S. Existence of families without positive numerations, Math. Notes of the Academy of Sciences of the USSR 13, 1973, p.360–363

    Article  Google Scholar 

  19. Mohrherr, J. A remark on the length problem, Theoretical Computer Science 56, p.243–248, 1988

    Article  Google Scholar 

  20. Menzel, W. and Sperschneider, V. Recursively enumerable extensions of R1 by finite functions, in: Logic and Machines: Decision Problems and Complexity, Ed: Börger, E. & Hasenjäger, G. & Roedding, D., Lecture Notes in Computer Science 171 p. 62–76, 1984

    Google Scholar 

  21. Pour-El, M.B. Review of [F], Journal of Symbolic Logic 25, p.165–166, 1960

    Google Scholar 

  22. Pour-El, M.B. and Putnam, H. Recursively enumerable classes and their application to sequences of formal theories, Archiv für mathematische Logik und Grundlagenforschung 8, p.104–121, 1965

    Article  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  25. Sperschneider, V. The length-problem, in: Logic and Machines: Decision Problems and Complexity, Ed: Börger, E. & Hasenjäger, G. & Roedding, D., Lecture Notes in Computer Science 171 p. 88–102, 1984

    Google Scholar 

  26. V'jugin, V.V. On minimal enumerations of computable classes of recursively enumerable sets, Soviet Mathematics. Doklady. 14, p.1338–1340, 1973

    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 1

    Martin Kummer

Authors
  1. Martin Kummer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kummer, M. (1989). Numberings of R1∪F. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '88. CSL 1988. Lecture Notes in Computer Science, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026301

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51659-0

  • Online ISBN: 978-3-540-46736-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation