Axioms for strong reduction in combinatory logic

DOI10.2307/2271660zbMath0153.00603OpenAlexW2122498270WikidataQ114589119 ScholiaQ114589119MaRDI QIDQ5532528

Roger Hindley

Publication date: 1967

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

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

zbMATH Keywords

mathematical logic

Related Items (6)

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 ⋮ Une nouvelle C\(\beta\)-réduction dans la logique combinatoire ⋮ Barendregt's problem \#26 and combinatory strong reduction

Cites Work

• The decidability of hindley's axioms for strong reduction

This page was built for publication: Axioms for strong reduction in combinatory logic