Skip to main content Accessibility help
×
Home

A simplification of combinatory logic1

  • Nicolas D. Goodman (a1)

Extract

The usual formulations of combinatory logic, as in Church [1] or Curry and Feys [2], have no straightforward semantics. This lack complicates the proofs of basic metasystematic results, prevents the perspicuous formalization of combinatory logic as a deductive theory, and makes the combinators unnecessarily difficult to apply to recursion theory or to the foundations of mathematics. In the present paper we shall give a new formulation of combinatory logic, thought of as an abstract theory of rules. At each stage in the development we shall give a precise semantic interpretation for our axioms. We begin with an abstract treatment of the syntax and semantics of a theory of rules. We then specialize to the theory of the combinators and prove a completeness theorem connecting our axioms with our semantics. On this basis we treat functional abstraction, truth-functions, and the representation of partial recursive functions. In the spirit of Church [1, pp. 62–71], we conclude by extending our methods to the treatment of intensional identity.

The theories developed here are part of a simplification of the theory of constructions described in [3]. Their semantics are motivated by the intended interpretation of the theory of constructions. The present paper is selfcontained and can be read without any familiarity with the theory of constructions, although the motivation of several of the notions considered here is given in [3]. In a future publication we will use the results of the present paper as the basis for a detailed study of a simplified form of the theory in [3].

Copyright

Footnotes

Hide All
1

This work was supported in part by NSF Grant GP-13019.

Footnotes

References

Hide All
[1]Church, A., The calculi of lambda-conversion, Annals of Mathematics Studies, no. 6, Princeton University Press, Princeton, N.J., 1941.
[2]Curry, H. B. and Feys, R., Combinatory logic, vol. 1, North-Holland, Amsterdam, 1958.
[3]Goodman, N. D., A theory of constructions equivalent to arithmetic, Intuitionism and proof theory (Kino, A., Myhill, J. and Vesley, R. E., Editors), North-Holland, Amsterdam, 1970, pp. 101120.
[4]Kleene, S. C., Introduction to metamathematics, Van Nostrand, New York, 1952.

A simplification of combinatory logic1

  • Nicolas D. Goodman (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.