Notre Dame Journal of Formal Logic

The Church Rosser theorem for strong reduction in combinatory logic.

Kenneth Loewen

Full-text: Open access

Article information

Source
Notre Dame J. Formal Logic Volume 9, Number 4 (1968), 299-302.

Dates
First available in Project Euclid: 30 August 2004

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1093893514

Digital Object Identifier
doi:10.1305/ndjfl/1093893514

Mathematical Reviews number (MathSciNet)
MR0248024

Zentralblatt MATH identifier
0191.30803

Subjects
Primary: 02.85

Citation

Loewen, Kenneth. The Church Rosser theorem for strong reduction in combinatory logic. Notre Dame J. Formal Logic 9 (1968), no. 4, 299--302. doi:10.1305/ndjfl/1093893514. https://projecteuclid.org/euclid.ndjfl/1093893514.


Export citation