Barendregt's problem \#26 and combinatory strong reduction

DOI10.1007/978-3-031-08740-0_26MaRDI QIDQ2104281zbMATH OpenOpenAlexFDO

Authors William R. Stirton

Publication date 7 December 2022

Full work available at URL https://doi.org/10.1007/978-3-031-08740-0_26

zbMATH Keywords

strong normalization[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=G%EF%BF%BD%EF%BF%BDdel%27s+koan&go=Go G��del's koan]simply typed combinatory logic

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• A solution to Curry and Hindley's problem on combinatory strong reduction
• Complete problems and strong polynomial reducibilities
• Complete Problems and Strong Polynomial Reducibilities
• Strong reductions between combinatorial principles
• Strong enumeration reducibilities
• scientific article; zbMATH DE number 3943800
• A direct proof of the confluence of combinatory strong reduction
• Reducibility among combinatorial problems (1972)
• Strong and weak reducibility of algorithmic problems
• Strong isomorphism reductions in complexity theory

Cites work

• scientific article; zbMATH DE number 5318491 (Why is no real title available?)
• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• Axioms for strong reduction in combinatory logic
• Combinatory logic. Vol. II

Cited in

(1)

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

This page was built for publication: Barendregt's problem \#26 and combinatory strong reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104281)