Barendregt's problem \#26 and combinatory strong reduction

DOI10.1007/978-3-031-08740-0_26OpenAlexW4285180909MaRDI QIDQ2104281FDOQ2104281

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

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
• scientific article; zbMATH DE number 7526284
• Strong and weak reducibility of algorithmic problems
• Strong isomorphism reductions in complexity theory

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)

Cites Work

• Title not available (Why is that?)
• Combinatory logic. Vol. II
• Title not available (Why is that?)
• Axioms for strong reduction in combinatory logic

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)