Reducibilities in two models for combinatory logic

DOI10.2307/2273730zbMath0417.03016OpenAlexW2043285104MaRDI QIDQ3206935

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 logicgraph modelgeneralizations of enumeration and Turing reducibilitiesgeneralizations of hyperenumeration and hyperarithmetical reducibilities

Mathematics Subject Classification ID

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

Related Items (1)

Finite type structures within combinatory algebras

Cites Work

• Unnamed Item
• Unnamed Item
• Category methods in recursion theory
• Hyperenumeration reducibility
• Enumeration reducibility and partial degrees

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