Recursion on the countable functionals
From MaRDI portal
topologiescontinuous functionalsdegrees of unsolvabilityassociatescountable functionalsKleene computability
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Hierarchies of computability and definability (03D55) Higher-type and set recursion theory (03D65) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Other degrees and reducibilities in computability and recursion theory (03D30)
Cited in
(30)- The hereditary partial effective functionals and recursion theory in higher types
- Higher-order equational logic for specification, simulation and testing
- Effective discontinuity and a characterisation of the superjump
- Speed-up theorems in type-2 computations using oracle Turing machines
- Computability theory, nonstandard analysis, and their connections
- Partial morphisms in categories of effective objects
- scientific article; zbMATH DE number 1531372 (Why is no real title available?)
- 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
- The Mathematical Work of S.C.Kleene
- The fixed-point property for represented spaces
- The strength of compactness in computability theory and nonstandard analysis
- A constructive manifestation of the Kleene-Kreisel continuous functionals
- Limit spaces with approximations
- Computability in higher types, P and the completeness of type assignment
- On uniform weak König's lemma
- Reverse mathematics and parameter-free transfer
- To be or not to be constructive, that is not the question
- From axiomatics to intrinsic characterization: some open problems in computable analysis
- Term extraction and Ramsey's theorem for pairs
- Computability of continuous solutions of higher-type equations
- Reduction of higher type levels by means of an ordinal analysis of finite terms
- Comparing Cartesian closed categories of (core) compactly generated spaces
- On the computability of the fan functional
- Axiomatic recursion theory and the continuous functionals
- Priority arguments in the continuous r.e. degrees
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- The computational content of nonstandard analysis
- Pincherle's theorem in reverse mathematics and computability theory
This page was built for publication: Recursion on the countable functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1145694)
