The decidability of hindley's axioms for strong reduction

DOI10.2307/2271661zbMath0153.00701OpenAlexW2061073460WikidataQ114589117 ScholiaQ114589117MaRDI QIDQ5532529

Bruce Lercher

Publication date: 1967

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2271661

zbMATH Keywords

mathematical logic

Related Items

Normal forms in combinatory logic, A combinatory logic approach to higher-order E-unification, A direct proof of the confluence of combinatory strong reduction, A solution to Curry and Hindley's problem on combinatory strong reduction, Axioms for strong reduction in combinatory logic