Kleene’s Amazing Second Recursion Theorem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3132764 (Why is no real title available?)
- scientific article; zbMATH DE number 3139751 (Why is no real title available?)
- scientific article; zbMATH DE number 3467029 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3070430 (Why is no real title available?)
- Arithmetical Predicates and Function Quantifiers
- Classical descriptive set theory as a refinement of effective descriptive set theory
- Creative sets
- Deduction-preserving "Recursive Isomorphisms" between theories
- Descriptive set theory
- Effective operations on partial recursive functions
- General recursive functions of natural numbers
- Hierarchies of number-theoretic predicates
- On definable sets of positive integers
- 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)
- Projective determinacy
- Provability interpretations of modal logic
- Recursive Predicates and Quantifiers
- Recursive well-orderings
- Recursively enumerable sets of positive integers and their decision problems
- Separation principles in the hierarchies of classical and effective descriptive set theory
- Supercompact cardinals, sets of reals, and weakly homogeneous trees
- Zur Theorie der konstruktiven Wohlordnungen
Cited in
(2)
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 Q3644738)