Hyperarithmetical Sets
From MaRDI portal
Publication:3305318
DOI10.1007/978-3-319-41842-1_5zbMath1439.03079OpenAlexW4249326771MaRDI QIDQ3305318
Publication date: 6 August 2020
Published in: Outstanding Contributions to Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-41842-1_5
Descriptive set theory (03E15) History of mathematics in the 20th century (01A60) Undecidability and degrees of sets of sentences (03D35) History of mathematical logic and foundations (03-03) Other degrees and reducibilities in computability and recursion theory (03D30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical descriptive set theory as a refinement of effective descriptive set theory
- On degrees of recursive unsolvability
- Elementary induction on abstract structures
- Many-one degrees of the predicates \(H_ a(x)\)
- General recursive functions of natural numbers
- Zur Theorie der konstruktiven Wohlordnungen
- Kleene's Amazing Second Recursion Theorem
- 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)
- Recursive Functionals and Quantifiers of Finite Types I
- Separation principles in the hierarchies of classical and effective descriptive set theory
- Hyperarithmetical quantifiers
- Constructive Versions of Ordinal Number Classes
- Many-One Reducibility Within the Turning Degrees of the Hyperarithmetic Sets H a (x)
- Forcing with tagged trees
- Recursive Unsolvability of a problem of Thue
- Some applications of the notions of forcing and generic sets
- A note on the hyperarithmetical hierarchy
- Abstract First Order Computability. I
- On notation for ordinal numbers
- On definable sets of positive integers
- Recursive Predicates and Quantifiers
- Recursively enumerable sets of positive integers and their decision problems
- Creative sets
This page was built for publication: Hyperarithmetical Sets
