Reducibilities in two models for combinatory logic

DOI10.2307/2273730MaRDI QIDQ3206935zbMATH OpenOpenAlexFDO

Authors Luis E. Sanchis

Publication date 1979

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

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

zbMATH Keywords

combinatory logicgeneralizations of enumeration and Turing reducibilitiesgeneralizations of hyperenumeration and hyperarithmetical reducibilitiesgraph model

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites work

• Category methods in recursion theory
• Enumeration reducibility and partial degrees
• scientific article; zbMATH DE number 3112450 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Hyperenumeration reducibility

Cited in

(2)

• Finite type structures within combinatory algebras
• Ivan Soskov: a life in computability

This page was built for publication: Reducibilities in two models for combinatory logic

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