A standardization theorem for strong reduction

DOI10.1305/NDJFL/1093893462MaRDI QIDQ2539219zbMATH OpenOpenAlexFDO

Authors Kenneth Loewen

Publication date 1968

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1093893462

zbMATH Keywords

recursion theory, constructive mathematicsstandardization theoremstrong reduction

Mathematics Subject Classification ID

Computability and recursion theory (03D99)

Cited in

(3)

• A solution to Curry and Hindley's problem on combinatory strong reduction
• Standardization theorem revisited
• scientific article; zbMATH DE number 2207691 (Why is no real title available?)

This page was built for publication: A standardization theorem for strong reduction

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