Skip to main content
SpringerLink
Log in
Book cover

Computation Theory and Logic pp 154–165Cite as

A setting for generalized computability

  • 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

  1. A. Church, An unsolvable problem for elementary number theory, Preliminary Report (abstract), Bull. Amer. Math. Soc. 41 (1935), 332–333.

    Google Scholar 

  2. A. Church, An unsolvable problem for elementary number theory, Amer. J. Math. 58 (1936), 345–363.

    Google Scholar 

  3. S. Eilenberg and C.C. Elgot, Iteration and recursion, Proc. Nat. Acad. Sci. U.S.A. 61 (1968), 378–379.

    Google Scholar 

  4. S. Eilenberg and C.C. Elgot, Recursiveness, New York, 1970.

    Google Scholar 

  5. K. Gödel, Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I, Monatsh. Math. Phys. 38 (1931), 173–198.

    Google Scholar 

  6. K. Gödel, On undecidable propositions of formal mathematical systems, (mimeography) Institute for Advanced Study, Princeton N.J., 1934.

    Google Scholar 

  7. G. Germano and S. Mazzanti, Primitive iteration and unary functions, Ann. Pure Appl. Logic, to appear.

    Google Scholar 

  8. G. Germano and S. Mazzanti, General iteration and unary functions, Preliminary Report.

    Google Scholar 

  9. G. Germano and A. Maggiolo-Schettini, Markov's algorithms without concluding formulas, 4th Congress for Logic, Methodology and Philosophy of Science, Bucharest 1971.

    Google Scholar 

  10. G. Germano and A. Maggiolo-Schettini, A characterization of partial recursive functions via sequence functions, Notices Amer. Math. Soc. 19 (1972), 332.

    Google Scholar 

  11. G. Germano and A. Maggiolo-Schettini, Quelques caracterizations des fonctions récursives partielles, C.R. Acad. Sci. Paris, Ser. A 276 (1973), 1325–1327.

    Google Scholar 

  12. G. Germano and A. Maggiolo-Schettini, Sequence-to-sequence recursiveness, Inform. Processing Lett. 4 (1975), 1–6.

    Google Scholar 

  13. H. Rogers, Theory of recursive functions and effective computability, New York, 1967.

    Google Scholar 

  14. S.C. Kleene, General recursive functions of natural numbers, Math. Ann. 112 (1936), 727–742.

    Google Scholar 

  15. S.C. Kleene, Recursive predicates and quantifiers, Trans. Amer. Math. Soc. 53 (1943), 41–73.

    Google Scholar 

  16. S. Mac Lane, Categories for the working mathematicians, New York, 1971.

    Google Scholar 

  17. M. L. Minsky, Recursive unsolvability of Post's problem of “Tag” and other topics in the theory of Turing Machines, Annals of Math. 74 (1961), 437–455.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Universita di Pisa, Corso Italia 40, 56100, Pisa, Italy

    G. Germano & S. Mazzanti

Authors
  1. G. Germano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Mazzanti
    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

Germano, G., Mazzanti, S. (1987). A setting for generalized computability. 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_163

Download citation

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

  • 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