RANDOMNESS NOTIONS AND REVERSE MATHEMATICS.

We investigate the strength of a randomness notion ${\cal R}$ as a set-existence principle in second-order arithmetic: for each Z there is an X that is ${\cal R}$ -random relative to Z. We show that the equivalence between 2-randomness and being infinitely often C -incompressible is provable in $...

Descripción completa

Detalles Bibliográficos
Publicado en:Journal of Symbolic Logic Vol. 85; no. 1; pp. 271 - 300
Autores principales: NIES, ANDRÉ, SHAFER, PAUL
Formato: Artículo
Publicado: Cambridge University Press Mar2020
Materias:
Acceso en línea:Ver este registro en EBSCOhost