Barendregt's problem \#26 and combinatory strong reduction
type: Item
instance of: scholarly article
title: Barendregt's problem \#26 and combinatory strong reduction
DOI: 10.1007/978-3-031-08740-0_26
publication date: 2022-12-07T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7627938
zbMATH Keywords: simply typed combinatory logic
zbMATH Keywords: strong normalization
zbMATH Keywords: Gödel's koan
author: William R. Stirton
MaRDI profile type: Publication
full work available at URL: 978-3-031-08740-0 26
OpenAlex ID: W4285180909
cites work: Combinatory logic. Vol. II
cites work: Axioms for strong reduction in combinatory logic
cites work: Q3522248
cites work: Q4143279
Recommended article: A solution to Curry and Hindley's problem on combinatory strong reduction
Recommended article: Complete problems and strong polynomial reducibilities
Recommended article: Complete Problems and Strong Polynomial Reducibilities
Recommended article: STRONG REDUCTIONS BETWEEN COMBINATORIAL PRINCIPLES
Recommended article: Strong enumeration reducibilities
Recommended article: Q3715103
Recommended article: A direct proof of the confluence of combinatory strong reduction
Recommended article: Q5075296
Recommended article: Strong and weak reducibility of algorithmic problems
Recommended article: Strong isomorphism reductions in complexity theory
description: scientific article; zbMATH DE number 7627938