RANK AND RANDOMNESS.

We show that for each computable ordinal $\alpha > 0$ it is possible to find in each Martin-Löf random ${\rm{\Delta }}_2^0 $ degree a sequence R of Cantor-Bendixson rank α , while ensuring that the sequences that inductively witness R 's rank are all Martin-Löf random with respect to a single coun...

Descripción completa

Detalles Bibliográficos
Publicado en:Journal of Symbolic Logic Vol. 84; no. 4; pp. 1527 - 1544
Autores principales: HÖLZL, RUPERT, PORTER, CHRISTOPHER P.
Formato: Artículo
Publicado: Cambridge University Press Dec2019
Materias:
Acceso en línea:Ver este registro en EBSCOhost
fields @attributes:
  recordID: 1
pdfLink:
plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=140922290&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 140922290
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00224812
        3TY
      jtl: Journal of Symbolic Logic
      issn: 00224812
      maglogo: N
    pubinfo:
      dt: Dec2019
      vid: 84
      iid: 4
      pid: 15979
      pub: Cambridge University Press
    artinfo:
      ui:
        140922290
        10.1017/jsl.2019.65
      ppf: 1527
      ppct: 17
      formats:
      tig:
        atl: RANK AND RANDOMNESS.
      aug:
        au:
          HÖLZL, RUPERT
          PORTER, CHRISTOPHER P.
        affil:
          INSTITUT 1, FAKULTÄT FÜR INFORMATIK UNIVERSITÄT DER BUNDESWEHR MÜNCHEN WERNER-HEISENBERG-WEG 39, 85579, NEUBIBERG, GERMANY URL: http://hoelzl.fr
          DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE DRAKE UNIVERSITY DES MOINES, IA, 50311, USA URL: http://cpporter.com
      su:
        Algorithmic randomness
        Ranking
        Delta State (Nigeria)
      sug:
        subj:
          Delta State (Nigeria)
          Algorithmic randomness
          Ranking
      keyword:
        03D32
        68Q30
        algorithmic randomness
        Cantor-Bendixson rank
        computable measures
        Martin-Löf randomness
      ab: We show that for each computable ordinal $\alpha > 0$ it is possible to find in each Martin-Löf random ${\rm{\Delta }}_2^0 $ degree a sequence R of Cantor-Bendixson rank α , while ensuring that the sequences that inductively witness R 's rank are all Martin-Löf random with respect to a single countably supported and computable measure. This is a strengthening for random degrees of a recent result of Downey, Wu, and Yang, and can be understood as a randomized version of it.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2019
    holdings:
      @attributes:
        islocal: N