# Morphisms and Partitions of *V*-sets

## Abstract

The set theoretic connection between functions and partitions is not worthy of further remark. Nevertheless, this connection turns out to have deep consequences for the theory of the Ershov numbering of lambda terms and thus for the connection between lambda calculus and classical recursion theory. Under the traditional understanding of lambda terms as function definitions, there are morphisms of the Ershov numbering of lambda terms which are not definable. This appears to be a serious incompleteness in the lambda calculus. However, we believe, instead, that this indefinability is a defect in our understanding of the functional nature of lambda terms. Below, for a different notion of lambda definition, we shall prove a representation theorem (completeness theorem) for morphisms. This theorem is based on a construction which realizes certain partitions as collections of fibers of morphisms defined by lambda terms in the classical sense of definition.

## Keywords

Point Theorem Recursive Function Recursive Partition Completeness Theorem Standard Reduction## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Barendregt, H.: The Lambda Calculus. North Holland, Amsterdam (1983)Google Scholar
- 2.Rogers, H.: Theory of Recursive Functions. McGraw Hill, New York (1967)zbMATHGoogle Scholar
- 3.Soare, R.: Recursively Enumerable Sets and Degrees. Springer, Heidelberg (1993)Google Scholar
- 4.Statman, R.: On sets of solutions to combinator equations. TCS 66, 99–104 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
- 5.Statman, R.: The Visser fixed point theorem (unpublished manuscript)Google Scholar
- 6.Combinators hereditarily of order two, CMU Math. Dept. Research Report 88-33 (1988)Google Scholar
- 7.Statman, R., Visser, A.: Numerations, lambda calculus, and arithmetic in To H.B. In: Hindley, J.R., Seldin, J.P. (eds.) Curry: Essays On Combinatory Logic, Lambda Calculus, And Formalism, pp. 259–284. Academic Press, London (1972)Google Scholar