Kleene’s Amazing Second Recursion Theorem
From MaRDI portal
Publication:3644738
DOI10.1007/978-3-642-04027-6_5zbMath1257.03064MaRDI QIDQ3644738
Publication date: 12 November 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04027-6_5
03E15: Descriptive set theory
03D20: Recursive functions and relations, subrecursive hierarchies
03D45: Theory of numerations, effectively presented structures
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical descriptive set theory as a refinement of effective descriptive set theory
- Provability interpretations of modal logic
- General recursive functions of natural numbers
- Zur Theorie der konstruktiven Wohlordnungen
- Arithmetical Predicates and Function Quantifiers
- Hierarchies of number-theoretic predicates
- Recursive well-orderings
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Effective operations on partial recursive functions
- Separation principles in the hierarchies of classical and effective descriptive set theory
- Projective determinacy
- Supercompact cardinals, sets of reals, and weakly homogeneous trees
- Deduction-preserving "Recursive Isomorphisms" between theories
- On notation for ordinal numbers
- On definable sets of positive integers
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- Recursive Predicates and Quantifiers
- Recursively enumerable sets of positive integers and their decision problems
- Creative sets
