Adjointness in recursion

DOI10.1016/0168-0072(86)90056-4zbMath0627.03026OpenAlexW1971319015MaRDI QIDQ581396

Philip S. Mulry

Publication date: 1986

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(86)90056-4

zbMATH Keywords

Scott topologyadjointnessreflective subcategorycomplete \(f_ 0\) spacescompletion functorcomputable functionalsrecursive naturalityrecursive topos

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Categories of machines, automata (18B20) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

A categorial approach to the theory of computation

Cites Work

• Unnamed Item
• Unnamed Item
• Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
• Generalized Banach-Mazur functionals in the topos of recursive sets

This page was built for publication: Adjointness in recursion