THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY.

The article discusses the computational content of intrinsic density and proves that sets with intrinsic density 0 exist either high Turing degrees or compute a diagonally non-computable function. It proves that sets with intrinsic lower density 0 exist in every noncomputable Turing degree and sets...

Descripción completa

Detalles Bibliográficos
Publicado en:Journal of Symbolic Logic Vol. 83; no. 2; pp. 817 - 829
Autor principal: ASTOR, ERIC P.
Formato: Artículo
Publicado: Cambridge University Press Jun2018
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=131027271&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 131027271
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00224812
        3TY
      jtl: Journal of Symbolic Logic
      issn: 00224812
      maglogo: N
    pubinfo:
      dt: Jun2018
      vid: 83
      iid: 2
      pid: 15979
      pub: Cambridge University Press
    artinfo:
      ui:
        131027271
        10.1017/jsl.2018.4
      ppf: 817
      ppct: 12
      formats:
      tig:
        atl: THE COMPUTATIONAL CONTENT OF INTRINSIC DENSITY.
      aug:
        au: ASTOR, ERIC P.
        affil: DEPARTMENT OF MATHEMATICS UNIVERSITY OF CONNECTICUT 341 MANSFIELD RD U-1009 STORRS, CT 06269-1009, USAURL: http://www.math.uconn.edu/∼astor
      su:
        Density functionals
        Set theory
        Computational statistics
        Unsolvability (Mathematical logic)
        Reverse mathematics
      sug:
        subj:
          Density functionals
          Set theory
          Computational statistics
          Unsolvability (Mathematical logic)
          Reverse mathematics
      keyword:
        03D28
        intrinsic density
        reverse mathematics
        Turing degrees
      ab: The article discusses the computational content of intrinsic density and proves that sets with intrinsic density 0 exist either high Turing degrees or compute a diagonally non-computable function. It proves that sets with intrinsic lower density 0 exist in every noncomputable Turing degree and sets with intrinsic desnity 0 have more computational content.It uses reverse mathematics to demonstrate existence of set with intrinsic 0.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2018
    holdings:
      @attributes:
        islocal: N