Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-22T05:33:58.278Z Has data issue: false hasContentIssue false
  • English
  • Français

Combinatory Logic and Whitehead's Theory of Prehensions

Published online by Cambridge University Press:  14 March 2022

Frederic B. Fitch
Frederic B. Fitch*
Affiliation:
Yale University
Get access Rights & Permissions [Opens in a new window]

Extract

In this paper I wish to reformulate in my own way some parts of Whitehead's theory of prehensions. This reformulation will deviate in various respects from Whitehead's own detailed views and terminology, but the main inspiration is from Whitehead (1).

Type
Research Article
Information
Philosophy of Science , Volume 24 , Issue 4 , October 1957 , pp. 331 - 335
Copyright
Copyright © 1957, The Williams & Wilkins Company

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. This paper was presented at a meeting of the American Philosophical Association, Eastern Division, at the University of Pennsylvania on December 27, 1956.Google Scholar
2. Combinatory logic has been developed mainly by Moses Schönfinkel, H. B. Curry, and J. B. Rosser. See, for example, M. Schönfinkel, Über die Bausteine der mathematischen Logik, Mathematische Annalen, vol. 92 (1924), pp. 305–316; Curry, H. B., Consistency and completeness of the theory of combinators, Journal of Symbolic Logic, vol. 6 (1941), pp. 54–61; Rosser, J. B., New sets of postulates for combinatory logics, ibid., vol. 7 (1942), pp. 18–27. Curry has written very extensively on the subject. The present writer's work in “basic logic” bears close affinity to combinatory logic and so does the work of Alonzo Church and S. C. Kleene on λ-definability.Google Scholar