GENERICITY AND RANDOMNESS WITH ITTMS.

We study genericity and randomness with respect to ITTMs, continuing the work initiated by Carl and Schlicht. To do so, we develop a framework to study randomness in the constructible hierarchy. We then answer several of Carl and Schlicht's question. We also ask a new question one the equality of tw...

Descripción completa

Detalles Bibliográficos
Publicado en:Journal of Symbolic Logic Vol. 84; no. 4; pp. 1670 - 1711
Autores principales: MONIN, BENOÎT, D'AURIAC, PAUL-ELLIOT ANGLÈS
Formato: Artículo
Publicado: Cambridge University Press Dec2019
Materias:
Acceso en línea:Ver este registro en EBSCOhost
Descripción
Sumario:We study genericity and randomness with respect to ITTMs, continuing the work initiated by Carl and Schlicht. To do so, we develop a framework to study randomness in the constructible hierarchy. We then answer several of Carl and Schlicht's question. We also ask a new question one the equality of two classes of randoms. Although the natural intuition would dictate that the two classes are distinct, we show that things are not as simple as they seem. In particular we show that the categorical analogues of these two classes coincide, in contradiction with the natural intuition. Even though we are not able to answer the question for randomness in this article, we delineate and sharpen its contour and outline.