THE FULL BINARY TREE CANNOT BE INTERPRETED IN A CHAIN.

We show that for no chain C there is a monadic-second order interpretation of the full binary tree in C.

Detalles Bibliográficos
Publicado en:Journal of Symbolic Logic Vol. 75; no. 4; pp. 1489 - 1499
Autor principal: RABINOVICH, ALEXANDER
Formato: Artículo
Publicado: Cambridge University Press Dec2010
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=57214037&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 57214037
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00224812
        3TY
      jtl: Journal of Symbolic Logic
      issn: 00224812
      maglogo: N
    pubinfo:
      dt: Dec2010
      vid: 75
      iid: 4
      pid: 15979
      pub: Cambridge University Press
    artinfo:
      ui:
        57214037
        10.2178/jsl/1286198158
      ppf: 1489
      ppct: 10
      formats:
      tig:
        atl: THE FULL BINARY TREE CANNOT BE INTERPRETED IN A CHAIN.
      aug:
        au: RABINOVICH, ALEXANDER
        affil: The Blavatnik School Of Computer Science, Tel Aviv University, Tel Aviv 69978, Israel
      su:
        Binary number system
        Computer arithmetic
        Mathematics
        Number systems
        Mathematical logic
      sug:
        subj:
          Binary number system
          Computer arithmetic
          Mathematics
          Number systems
          Mathematical logic
      ab: We show that for no chain C there is a monadic-second order interpretation of the full binary tree in C.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2010
    holdings:
      @attributes:
        islocal: N