Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Computer Implication and the Curry Paradox

Wayne Aitken and Jeffrey A. Barrett
Journal of Philosophical Logic
Vol. 33, No. 6 (Dec., 2004), pp. 631-637
Published by: Springer
Stable URL: http://www.jstor.org/stable/30226827
Page Count: 7
  • Download ($43.95)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Computer Implication and the Curry Paradox
Preview not available

Abstract

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.

Page Thumbnails

  • Thumbnail: Page 
[631]
    [631]
  • Thumbnail: Page 
632
    632
  • Thumbnail: Page 
633
    633
  • Thumbnail: Page 
634
    634
  • Thumbnail: Page 
635
    635
  • Thumbnail: Page 
636
    636
  • Thumbnail: Page 
637
    637