Roger Hindley. Axioms for strong reduction in combinatory logic. The journal of symbolic logic, vol. 32 , pp. 224–236. - Bruce Lercher. The decidability of Hindley's axioms for strong reduction. The journal of symbolic logic, vol. 32 , pp. 237–239 [Book Review]

Journal of Symbolic Logic 36 (1):171-172 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

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

Through your library

Similar books and articles

The decidability of Hindley's axioms for strong reduction.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):237-239.
Axioms for strong reduction in combinatory logic.Roger Hindley - 1967 - Journal of Symbolic Logic 32 (2):224-236.
Strong reduction and normal form in combinatory logic.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):213-223.
Strong Reduction and Normal Form in Combinatory Logic.Bruce Lercher - 1971 - Journal of Symbolic Logic 36 (1):171-171.
Combinatory Logic.Haskell B. Curry, J. Roger Hindley & Jonathan P. Seldin - 1977 - Journal of Symbolic Logic 42 (1):109-110.
Introduction to combinatory logic.J. Roger Hindley - 1972 - Cambridge [Eng.]: University Press. Edited by B. Lercher & J. P. Seldin.
Errata in "Strong Axioms of Infinity in NFU".M. Holmes - 2001 - Journal of Symbolic Logic 66 (4):1974-1974.

Analytics

Added to PP
2013-11-03

Downloads
23 (#584,438)

6 months
1 (#1,040,386)

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

No references found.

Add more references