Skip to main content
SpringerLink
Log in
Book cover

Computation Theory and Logic pp 14–19Cite as

Primitive recursive word-functions of one variable

  • Chapter
  • First Online:

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

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.

References

  • Asser G (1960) Rekursive Wortfunktionen. Z Math Logik Grundl Math 6:258–278

    Google Scholar 

  • Malcew AI (1974) Algorithmen und rekursive Funktionen. Akademie-Verlag, Berlin

    Google Scholar 

  • Péter R (1951) Rekursive Funktionen. Akadémial Kiado, Budapest

    Google Scholar 

  • Robinson RM (1947) Primitive recursive functions. Bull Amer Math Soc 53:925–943

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sektion Mathematik der Ernst-Moritz-Arndt-Universität, DDR-2200, Greifswald, German Democratic Republic

    Günter Asser

Authors
  1. Günter Asser
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Asser, G. (1987). Primitive recursive word-functions of one variable. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_150

Download citation

  • DOI: https://doi.org/10.1007/3-540-18170-9_150

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47795-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation