Computer Implication and the Curry Paradox.

There are theoretical limitations to what can be implemented by a computer program. In this paper we are concerned with a limitation on the strength of computer implemented deduction. We use a version of the Curry paradox to arrive at this limitation.

Detalles Bibliográficos
Publicado en:Journal of Philosophical Logic Vol. 33; no. 6; pp. 631 - 638
Autores principales: Aitken, Wayne, Barrett, Jeffrey A.
Formato: Artículo
Publicado: Springer Nature Dec2004
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=14885066&site=ehost-live
header:
  @attributes:
    shortDbName: hlh
    uiTerm: 14885066
    longDbName: Humanities International Complete
    uiTag: AN
  controlInfo:
    bkinfo:
    jinfo:
      jid:
        00223611
        JPH
      jtl: Journal of Philosophical Logic
      issn: 00223611
      maglogo: N
    pubinfo:
      dt: Dec2004
      vid: 33
      iid: 6
      pid: 237
      pub: Springer Nature
    artinfo:
      ui:
        14885066
        10.1023/B:LOGI.0000046077.72722.61
      ppf: 631
      ppct: 7
      formats:
        fmt:
          @attributes:
            type: P
            size: 61KB
      tig:
        atl: Computer Implication and the Curry Paradox.
      aug:
        au:
          Aitken, Wayne
          Barrett, Jeffrey A.
        affil:
          Cal. State, San Marcos, CA 92096, USA e-mail:
          UC Irvine, Irvine, CA 92697, USA e-mail:
      su:
        Computer software
        Paradox
        Logic
        Computer logic
        Mathematical logic
        Philosophy
      sug:
        subj:
          Computer software
          Paradox
          Logic
          Computer logic
          Mathematical logic
          Philosophy
      keyword:
        Curry paradox
        implication
        modus ponens
        theory of algorithms
      ab: There are theoretical limitations to what can be implemented by a computer program. In this paper we are concerned with a limitation on the strength of computer implemented deduction. We use a version of the Curry paradox to arrive at this limitation.
      pubtype: Academic Journal
      doctype: Article
      src: R
    language: English
    refInfo:
    copyright:
      @attributes:
        flag: Y
      custom: Journal of Philosophical Logic is a copyright of Springer, 2004. All Rights Reserved.
      item: Journal of Philosophical Logic
      holder: Springer Nature
      dt:
        @attributes:
          year: 2004
    holdings:
      @attributes:
        islocal: N