SELF-REFERENCE IN ARITHMETIC II.

In this sequel to Self-reference in arithmetic I we continue our discussion of the question: What does it mean for a sentence of arithmetic to ascribe to itself a property? We investigate how the properties of the supposedly self-referential sentences depend on the chosen coding, the formulae expres...

Descripción completa

Detalles Bibliográficos
Publicado en:Review of Symbolic Logic Vol. 7; no. 4; pp. 692 - 713
Autores principales: HALBACH, VOLKER, VISSER, ALBERT
Formato: Artículo
Publicado: Cambridge University Press Dec2014
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=99893678&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 99893678
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        17550203
        8OI1
      jtl: Review of Symbolic Logic
      issn: 17550203
      maglogo: N
    pubinfo:
      dt: Dec2014
      vid: 7
      iid: 4
      pid: 15979
      pub: Cambridge University Press
    artinfo:
      ui:
        99893678
        10.1017/S175502031400029X
      ppf: 692
      ppct: 21
      formats:
      tig:
        atl: SELF-REFERENCE IN ARITHMETIC II.
      aug:
        au:
          HALBACH, VOLKER
          VISSER, ALBERT
        affil:
          Oxford University
          Utrecht University
      su:
        Arithmetic
        Mathematics theorems
        Mathematical formulas
        Sampling theorem
        Number systems
      sug:
        subj:
          Arithmetic
          Mathematics theorems
          Mathematical formulas
          Sampling theorem
          Number systems
      ab: In this sequel to Self-reference in arithmetic I we continue our discussion of the question: What does it mean for a sentence of arithmetic to ascribe to itself a property? We investigate how the properties of the supposedly self-referential sentences depend on the chosen coding, the formulae expressing the properties and the way a fixed point for the expressing formulae are obtained. In this second part we look at some further examples. In particular, we study sentences apparently expressing their Rosser-provability, their own ${\rm{\Sigma }}_n^0$-truth or their own ${\rm{\Pi }}_n^0$-truth. Finally we offer an assessment of the results of both papers.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      dt:
        @attributes:
          year: 2014
    holdings:
      @attributes:
        islocal: N