Curry's paradox

Abstract Curry's paradox, so named for its discoverer, namely Haskell B. Curry, is a paradox within the family of so-called paradoxes of self-reference (or paradoxes of circularity). Like the liar paradox (e.g., ‘this sentence is false’) and Russell's paradox , Curry's paradox challenges familiar naive theories, including naive truth theory (unrestricted T-schema) and naive set theory (unrestricted axiom of abstraction), respectively. If one accepts naive truth theory (or naive set theory), then Curry's paradox becomes a direct challenge to one's theory of logical implication or entailment. Unlike the liar and Russell paradoxes Curry's paradox is negation-free; it may be generated irrespective of one's theory of negation. An intuitive version of the paradox runs as follows.
Keywords No keywords specified (fix it)
Categories
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,672
External links
  •   Try with proxy.
  • Through your library Only published papers are available at libraries

    Similar books and articles

    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    60 ( #15,950 of 549,068 )

    Recent downloads (6 months)

    4 ( #19,186 of 549,068 )

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums