Bruce Lercher. Strong reduction and normal form in combinatory logic. The journal of symbolic logic, vol. 32 , pp. 213–223

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

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,611

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

Strong Reduction and Normal Form in Combinatory Logic.Bruce Lercher - 1971 - Journal of Symbolic Logic 36 (1):171-171.
Strong reduction and normal form in combinatory logic.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):213-223.
Normal Forms in Combinatory Logic.Patricia Johann - 1994 - Notre Dame Journal of Formal Logic 35 (4):573-594.
The decidability of Hindley's axioms for strong reduction.Bruce Lercher - 1967 - Journal of Symbolic Logic 32 (2):237-239.
Introduction to combinatory logic.J. Roger Hindley - 1972 - Cambridge [Eng.]: University Press. Edited by B. Lercher & J. P. Seldin.
Axioms for strong reduction in combinatory logic.Roger Hindley - 1967 - Journal of Symbolic Logic 32 (2):224-236.
The Church-Rosser Property in Symmetric Combinatory Logic.Katalin Bimbó - 2005 - Journal of Symbolic Logic 70 (2):536 - 556.
Elements of Combinatory Logic. [REVIEW]Bruce Lercher - 1975 - International Studies in Philosophy 7:203-203.

Analytics

Added to PP
2016-06-30

Downloads
15 (#953,911)

6 months
7 (#441,920)

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