Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Journals
  3. The Journal of Symbolic Logic
  4. Volume 28
Journal Home
Refine listing

Refine listing

Access:
Publication date:

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×
< Back to all issues

Volume 28 - December 1963

Contents

Page 3 of 6

Research Article

  • The system CΔ of combinatory logic1

  • Frederic B. Fitch
  • Published online by Cambridge University Press:
    12 March 2014, pp. 87-97

  • The system of combinatory logic to be presented in this paper will be called CΔ. It may be compared to various systems of combinatory logic constructed by Schonfinkel [11], Curry [1], Rosser [10], and Curry and Feys [2], and to the author's systems K′ [3] and S [5], and to extensional modifications of K′ [6], [7], [8], [9]. The present system falls within this latter category of extensional or semi-extensional systems, but it is more perspicuous than the others, and the proof of its consistency is more direct. It contains the theory of combinators in full strength. It also contains operators for disjunction, conjunction, negation, existence (that is, non-emptiness), and universality. A considerable part of classical mathematical analysis can be shown to be derivable in CΔ, just as in K′ [4], but with the added advantage of the availability of a limited extensionality principle.

Reviews

Page 3 of 6