On subrecursiveness in weak combinatory logic

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Other literature type 01 Jan 1975 English Publisher:Springer Berlin Heidelberg

Authors: Carlo Batini; Alberto Pettorossi;

doi: 10.1007/bfb0029533

On subrecursiveness in weak combinatory logic

- Summary
- Metrics

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.

Related Organizations

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	4
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average