Recursion on the countable functionals
From MaRDI portal
Publication:1145694
zbMath0446.03034MaRDI QIDQ1145694
Publication date: 1980
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
topologiescontinuous functionalsdegrees of unsolvabilityassociatescountable functionalsKleene computability
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other degrees and reducibilities in computability and recursion theory (03D30) Higher-type and set recursion theory (03D65) Hierarchies of computability and definability (03D55)
Related Items (30)
The fixed-point property for represented spaces ⋮ Comparing Cartesian closed categories of (core) compactly generated spaces ⋮ Limit spaces with approximations ⋮ A constructive manifestation of the Kleene-Kreisel continuous functionals ⋮ Reverse mathematics and parameter-free transfer ⋮ Effective discontinuity and a characterisation of the superjump ⋮ Axiomatic recursion theory and the continuous functionals ⋮ Term extraction and Ramsey's theorem for pairs ⋮ The hereditary partial effective functionals and recursion theory in higher types ⋮ Partial morphisms in categories of effective objects ⋮ Priority arguments in the continuous r.e. degrees ⋮ The Mathematical Work of S.C.Kleene ⋮ To be or not to be constructive, that is not the question ⋮ Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces ⋮ Proof theory of higher-order equations: Conservativity, normal forms and term rewriting. ⋮ On the main scientific achievements of Victor Selivanov ⋮ A Computable Solution to Partee’s Temperature Puzzle ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Higher-order equational logic for specification, simulation and testing ⋮ Computability of Continuous Solutions of Higher-Type Equations ⋮ Computability in higher types, P\(\omega\) and the completeness of type assignment ⋮ On uniform weak König's lemma ⋮ Speed-up theorems in type-2 computations using oracle Turing machines ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ On the Computability of the Fan Functional ⋮ Pincherle's theorem in reverse mathematics and computability theory ⋮ Reduction of higher type levels by means of an ordinal analysis of finite terms ⋮ The strength of compactness in computability theory and nonstandard analysis ⋮ From axiomatics to intrinsic characterization: some open problems in computable analysis
This page was built for publication: Recursion on the countable functionals
