Reducibilities in two models for combinatory logic

DOI10.2307/2273730zbMATH Open0417.03016OpenAlexW2043285104MaRDI QIDQ3206935FDOQ3206935

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Enumeration reducibility and partial degrees
• Category methods in recursion theory
• Hyperenumeration reducibility

Cited In (2)

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

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)