The Church Rosser theorem for strong reduction in combinatory logic

DOI10.1305/NDJFL/1093893514zbMath0191.30803OpenAlexW2041732871MaRDI QIDQ2537972

Kenneth Loewen

Publication date: 1968

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1093893514

zbMATH Keywords

constructive mathematicsrecursion theory

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Related Items (1)

A solution to Curry and Hindley's problem on combinatory strong reduction

This page was built for publication: The Church Rosser theorem for strong reduction in combinatory logic