The completeness of combinatory logic with discriminators

Notre Dame Journal of Formal Logic 14 (3):323-330 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1305/ndjfl/1093890995

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,069

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: John T. Kearns, Combinatory Logic with Discriminators. [REVIEW]Jonathan P. Seldin - 1973 - Journal of Symbolic Logic 38 (2):339-340.
John T. Kearns. Combinatory logic with discriminators. The journal of symbolic logic, vol. 34 , pp. 561–575.Jonathan P. Seldin - 1973 - Journal of Symbolic Logic 38 (2):339-340.
John T. Kearns. Quantifiers and universal validity. Logique et analyse, n.s. vol. 9 , pp. 298–309. - George Goe. A reconstruction of formal logic. Notre Dame journal of formal logic, vol. 7 , pp. 129–157. - George Goe. Corrections to my paper “A reconstruction of formal logic.”Notre Dame journal of formal logic, vol. 7 , p. 158. [REVIEW]Theodore Hailperin - 1968 - Journal of Symbolic Logic 33 (1):137-138.
A Henkin completeness theorem for T.M. J. Cresswell - 1967 - Notre Dame Journal of Formal Logic 8:186.
Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5 (3):161-180.
Combinatory and propositional logic.David Meredith - 1974 - Notre Dame Journal of Formal Logic 15 (1):156-160.
Types in combinatory logic.Luis E. Sanchis - 1964 - Notre Dame Journal of Formal Logic 5:161.
Cresswell M. J.. A Henkin completeness theorem for T. Notre Dame journal of formal logic, vol. 8 no. 3 , pp. 186–190.Cresswell M. J.. Alternative completeness theorems for modal systems. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 339–345.Cresswell M. J.. Some proofs of relative completeness in modal logic. Notre Dame journal of formal logic, vol. 9 no. 1 , pp. 62–66. [REVIEW]David Makinson - 1970 - Journal of Symbolic Logic 35 (4):581-582.
A paradox in illative combinatory logic.M. W. Bunder - 1970 - Notre Dame Journal of Formal Logic 11 (4):467-470.
$\Lambda$-elimination in illative combinatory logic.M. W. Bunder - 1979 - Notre Dame Journal of Formal Logic 20 (3):628-630.

Analytics

Added to PP
2010-08-24

Downloads
19 (#825,387)

6 months
6 (#587,779)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

John T. Kearns
State University of New York, Buffalo

Citations of this work

A combinatory account of internal structure.Barry Jay & Thomas Given-Wilson - 2011 - Journal of Symbolic Logic 76 (3):807 - 826.
On the interpretation of combinators with weak reduction.L. V. Shabunin - 1983 - Journal of Symbolic Logic 48 (3):558-563.
The Logic of Calculation.John T. Kearns - 1977 - Mathematical Logic Quarterly 23 (1-6):45-58.

Add more citations

References found in this work

No references found.

Add more references