On subrecursiveness in weak combinatory logic
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.
Unable to display preview. Download preview PDF.
- Curry,H.B., R. Feys, Combinatory logic, vol. 1, North Holland (1974)Google Scholar
- Ausiello, G., Computational complexity — Main results and a commentary, Séminaires IRIA (1972).Google Scholar
- Strong,H.R., Depth-bounded computation, J.C.S.S., Vol. 4, n. 1 (1970).Google Scholar
- Curry, H.B., J.R. Hindley, J.P. Seldin, Combinatory logic, vol. 2, North Holland (1972).Google Scholar
- Blum, M., On the size of machines, Information and Control 2 (1967).Google Scholar
- Blum, M., A machine independent theory of the complexity of recursive functions, J.A.C.M. 14 (April 1967).Google Scholar
- Ausiello, G., Abstract computational complexity and cycling computations, J.C.S.S. Vol. 5 (1971).Google Scholar
- Barendregt, H., Normed uniformly reflexive structures, (in these proceedings).Google Scholar
- Böhm, C., W. Gross, Introduction to the CUCH, Automata Theory (ed. Caianiello) N.Y. (1966).Google Scholar
- Grzegorczyk, A., Some classes of recursive functions, Rozprawy Matematyczne (1953).Google Scholar
- Rosenbloom, P., The elements of mathematical logic, Dover (1950).Google Scholar
- Batini, C., A. Pettorossi, Some properties of subbases in weak combinatory logic, Rapporto dell'Istituto di Automatica — Università di Roma (1975).Google Scholar