Skip to main content
SpringerLink
Log in

On subrecursiveness in weak combinatory logic

  • Conference paper
  • First Online:
λ-Calculus and Computer Science Theory (LCCST 1975)

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

Included in the following conference series:

Abstract

In this paper weak combinatory logic as an algorithmic language is considered and various notions of structural and computational complexity are introduced. Particular attention is devoted to the definitional power of a system of combinators,that is to the concept of “subbase”. Some results concerning the relations between specific subbases and their generative power are presented.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Curry,H.B., R. Feys, Combinatory logic, vol. 1, North Holland (1974)

    Google Scholar 

  2. Ausiello, G., Computational complexity — Main results and a commentary, Séminaires IRIA (1972).

    Google Scholar 

  3. Strong,H.R., Depth-bounded computation, J.C.S.S., Vol. 4, n. 1 (1970).

    Google Scholar 

  4. Curry, H.B., J.R. Hindley, J.P. Seldin, Combinatory logic, vol. 2, North Holland (1972).

    Google Scholar 

  5. Blum, M., On the size of machines, Information and Control 2 (1967).

    Google Scholar 

  6. Blum, M., A machine independent theory of the complexity of recursive functions, J.A.C.M. 14 (April 1967).

    Google Scholar 

  7. Ausiello, G., Abstract computational complexity and cycling computations, J.C.S.S. Vol. 5 (1971).

    Google Scholar 

  8. Barendregt, H., Normed uniformly reflexive structures, (in these proceedings).

    Google Scholar 

  9. Böhm, C., W. Gross, Introduction to the CUCH, Automata Theory (ed. Caianiello) N.Y. (1966).

    Google Scholar 

  10. Grzegorczyk, A., Some classes of recursive functions, Rozprawy Matematyczne (1953).

    Google Scholar 

  11. Rosenbloom, P., The elements of mathematical logic, Dover (1950).

    Google Scholar 

  12. Batini, C., A. Pettorossi, Some properties of subbases in weak combinatory logic, Rapporto dell'Istituto di Automatica — Università di Roma (1975).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centro di Studio dei Sistemi di Controllo e Calcolo Automatici, C.N.R., Roma

    Carlo Batini & Alberto Pettorossi

  2. Istituto di Automatica dell'Università di Roma, Italy

    Carlo Batini & Alberto Pettorossi

Authors
  1. Carlo Batini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Pettorossi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

C. Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Batini, C., Pettorossi, A. (1975). On subrecursiveness in weak combinatory logic. In: Böhm, C. (eds) λ-Calculus and Computer Science Theory. LCCST 1975. Lecture Notes in Computer Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029533

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07416-8

  • Online ISBN: 978-3-540-37944-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation