On the interpretation of combinators with weak reduction

Journal of Symbolic Logic 48 (3):558-563 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273446

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,343

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

Some results on combinators in the system TRC.Thomas Jech - 1999 - Journal of Symbolic Logic 64 (4):1811-1819.
Systems of illative combinatory logic complete for first-order propositional and predicate calculus.Henk Barendregt, Martin Bunder & Wil Dekkers - 1993 - Journal of Symbolic Logic 58 (3):769-788.
Introduction to Combinators and λ-Calculus.J. Roger Hindley & Jonathan P. Seldin - 1988 - Journal of Symbolic Logic 53 (3):985-986.
Consistency and completeness of the theory of combinators.Haskell B. Curry - 1941 - Journal of Symbolic Logic 6 (2):54-61.
Dual combinators bite the dust.R. K. Meyer, K. Bimbó & J. M. Dunn - 1998 - Bulletin of Symbolic Logic 4:463-464.
Combinator logics.Lou Goble - 2004 - Studia Logica 76 (1):17 - 66.
Quine W. V.. Reduction to a dyadic predicate. [REVIEW]Wilhelm Ackermann - 1957 - Journal of Symbolic Logic 22 (3):297-297.

Analytics

Added to PP
2009-01-28

Downloads
30 (#787,710)

6 months
7 (#469,699)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The completeness of combinatory logic with discriminators.John T. Kearns - 1973 - Notre Dame Journal of Formal Logic 14 (3):323-330.

Add more references