Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können kommenden Montag und Dienstag keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted next Monday and Tuesday.)
Type of Publication: | Journal article |
Publication status: | Published |
Author: | Carl, Merlin; Schlicht, Philipp; Welch, Philip |
Year of publication: | 2018 |
Published in: | Annals of Pure and Applied Logic ; 169 (2018), 4. - pp. 312-332. - ISSN 0168-0072. - eISSN 1873-2461 |
ArXiv-ID: | arXiv:1512.06101 |
DOI (citable link): | https://dx.doi.org/10.1016/j.apal.2017.12.007 |
Summary: |
We call a subset of an ordinal λrecognizableif it is the unique subset xof λfor which some Turing machine with ordinal time and tape and an ordinal parameter, that halts for all subsets of λas input, halts with the final state 0. Equivalently, such a set is the unique subset xwhich satisfies a given Σ1formula in L[x]. We further define the recognizable closurefor subsets of λ by closing under relative recognizability for subsets of λ.
We prove several results about recognizable sets and their variants for other types of machines. Notably, we show the following results from large cardinals. •Recognizable sets of ordinals appear in the hierarchy of inner models at least up to the level Woodin cardinals, while computable sets are elements of L. •A subset of a countable ordinal λis in the recognizable closure for subsets of countable ordinals if and only if it is an element of the inner model M∞, which is obtained by iterating the least measure of the least fine structural inner model M1with a Woodin cardinal through the ordinals. |
MSC Classification: | 03D10; 03D32; 03E15; 03E45 |
Subject (DDC): | 510 Mathematics |
Keywords: | Infinite time Turing machines; Algorithmic randomness; Effective descriptive set theory; Woodin cardinals; Inner models |
Bibliography of Konstanz: | Yes |
Refereed: | Unknown |
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
CARL, Merlin, Philipp SCHLICHT, Philip WELCH, 2018. Recognizable sets and Woodin cardinals : Computation beyond the constructible universe. In: Annals of Pure and Applied Logic. 169(4), pp. 312-332. ISSN 0168-0072. eISSN 1873-2461. Available under: doi: 10.1016/j.apal.2017.12.007
@article{Carl2018Recog-32698.2, title={Recognizable sets and Woodin cardinals : Computation beyond the constructible universe}, year={2018}, doi={10.1016/j.apal.2017.12.007}, number={4}, volume={169}, issn={0168-0072}, journal={Annals of Pure and Applied Logic}, pages={312--332}, author={Carl, Merlin and Schlicht, Philipp and Welch, Philip} }