Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles

DOI10.1002/malq.19960420137zbMath0863.03022OpenAlexW2142744108MaRDI QIDQ5687408

George Tourlakis

Publication date: 27 May 1997

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19960420137

zbMATH Keywords

model of computationoracle computationscomputable functionaltype-1 inputs

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computability of Recursive Functions
• Unnamed Item
• Unnamed Item

This page was built for publication: Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles