Kleene's amazing second recursion theorem

DOI10.2178/BSL/1286889124MaRDI QIDQ3161629zbMATH OpenOpenAlexFDO

Authors Yiannis N. Moschovakis

Publication date 15 October 2010

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2178/bsl/1286889124

zbMATH Keywords

computable functionseffective descriptive set theoryrecursion theorem

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45) Descriptive set theory (03E15)

Recommendations

• Kleene’s Amazing Second Recursion Theorem
• Effectivity questions for Kleene's recursion theorem
• The Mathematical Work of S.C.Kleene
• scientific article; zbMATH DE number 65747
• Program self-reference in constructive Scott subdomains

Cites work

• Alternative proof of a theorem of Kleene
• Borel extractions of converging sequences in compact sets of Borel functions
• Classical descriptive set theory as a refinement of effective descriptive set theory
• Creative sets
• Effective operations on partial recursive functions
• Effective properties in compact sets of Borel functions
• Hierarchies of number-theoretic predicates
• scientific article; zbMATH DE number 194101 (Why is no real title available?)
• scientific article; zbMATH DE number 3467029 (Why is no real title available?)
• scientific article; zbMATH DE number 3232606 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Invariant descriptive set theory
• Many-one degrees of the predicates \(H_ a(x)\)
• On notation for ordinal numbers
• On the Forms of the Predicates in the Theory of Constructive Ordinals
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• On the interpretation of intuitionistic number theory
• Projective determinacy
• Provability interpretations of modal logic
• Recursive well-orderings
• Recursively enumerable sets of positive integers and their decision problems
• Supercompact cardinals, sets of reals, and weakly homogeneous trees
• Uncomplemented C(X)-Subalgebras of C(X)
• Zur Theorie der konstruktiven Wohlordnungen
• 𝐴𝐷 and the very fine structure of 𝐿(ℝ)

Cited in

(21)

• Recursion theorems and effective domains
• Intuitionism and effective descriptive set theory
• Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
• Fixed point theorems for precomplete numberings
• From Turing machines to computer viruses
• Hyperarithmetical Sets
• On the diagonal lemma of Gödel and Carnap
• Kleene’s Amazing Second Recursion Theorem
• Monoidal computer. I: Basic computability by string diagrams
• Polish group actions and effectivity
• GENERALIZATIONS OF THE RECURSION THEOREM
• The Mathematical Work of S.C.Kleene
• Fixpoints and relative precompleteness
• Classes of Polish spaces under effective Borel isomorphism
• Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
• Classical descriptive set theory as a refinement of effective descriptive set theory
• Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
• Algebra of self-replication
• Smullyan's truth and provability
• Fixed point theorems in computability theory
• The noneffectivity of Arslanov's completeness criterion and related theorems

This page was built for publication: Kleene's amazing second recursion theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3161629)