Recognizable sets and Woodin cardinals: computation beyond the constructible universe☆
Under an Elsevier user license
open archive
MSC
03D10
03D32
03E15
03E45
Keywords
Infinite time Turing machines
Algorithmic randomness
Effective descriptive set theory
Woodin cardinals
Inner models
Cited by (0)
- ☆
Work on this paper was partially done whilst the authors were visiting at the Isaac Newton Institute for Mathematical Sciences in the programme ‘Mathematical, Foundational and Computational Aspects of the Higher Infinite’ (HIF), to which they are grateful. This program was funded by EPSRC grant EP/K032208/1. In addition the second author was partially supported by DFG-grant LU2020/1-1. Moreover, the last author was a Simons Foundation Fellow during this period and gratefully acknowledges that Foundation's support.
© 2017 Elsevier B.V.