Hyperarithmetical Sets
From MaRDI portal
Recommendations
- Intrinsically Hyperarithmetical Sets
- Hierarchies of hyperarithmetical sets and functions
- scientific article; zbMATH DE number 3851066
- Index sets in the hyperarithmetical hierarchy
- Cantor-type sets in hyperbolic numbers
- Representing hyper-arithmetical sets by equations over sets of integers
- Hyperarithmetical Index Sets in Recursion Theory
- Arithmetical set theory
- A theory of hyperfinite sets
- scientific article; zbMATH DE number 1126840
Cites work
- A note on the hyperarithmetical hierarchy
- Abstract First Order Computability. I
- Arithmetical Predicates and Function Quantifiers
- Classical descriptive set theory as a refinement of effective descriptive set theory
- Constructive Versions of Ordinal Number Classes
- Creative sets
- Descriptive set theory
- Elementary induction on abstract structures
- Forcing with tagged trees
- General recursive functions of natural numbers
- Hierarchies of number-theoretic predicates
- scientific article; zbMATH DE number 3139751 (Why is no real title available?)
- scientific article; zbMATH DE number 3176053 (Why is no real title available?)
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 3250555 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3316894 (Why is no real title available?)
- scientific article; zbMATH DE number 3329894 (Why is no real title available?)
- scientific article; zbMATH DE number 3188506 (Why is no real title available?)
- scientific article; zbMATH DE number 3045417 (Why is no real title available?)
- scientific article; zbMATH DE number 3057484 (Why is no real title available?)
- scientific article; zbMATH DE number 3070430 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Hyperarithmetical quantifiers
- Kleene's amazing second recursion theorem
- Many-one degrees of the predicates \(H_ a(x)\)
- Many-One Reducibility Within the Turning Degrees of the Hyperarithmetic Sets H a (x)
- On definable sets of positive integers
- On degrees of recursive unsolvability
- On notation for ordinal numbers
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Recursive Functionals and Quantifiers of Finite Types I
- Recursive Predicates and Quantifiers
- Recursive unsolvability of a problem of Thue
- 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
- Some applications of the notions of forcing and generic sets
- Zur Theorie der konstruktiven Wohlordnungen
Cited in
(6)- Multi-dimensional sets recognizable in all abstract numeration systems
- Mapping Sets and Hypersets into Numbers
- scientific article; zbMATH DE number 4059386 (Why is no real title available?)
- Ordinal analysis of partial combinatory algebras
- scientific article; zbMATH DE number 7332477 (Why is no real title available?)
- Martin Davis: an overview of his work in logic, computer science, and philosophy
This page was built for publication: Hyperarithmetical Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3305318)