Hyperarithmetic sets
Abstract
We introduce de hyperarithmet sets. We do it from the viewpoint of computable structure theory, defining them as computably-infinitary definable sets. We prove many of the classical results, and, in particular, their connection with jump hierarchies along computable ordinals.
Fields of Study & Subjects
Computability
Logic
AI Algorithms
Advanced Topology and Set Theory
semigroups and automata theory
Publication details
- Journal / source
- Cambridge University Press eBooks
- Pages
- 69–84
- Publication date
- 30 January 2026
- Document type
- Book chapter