Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Curry's paradox
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
===Sentential logic=== The example in the previous section used unformalized, natural-language reasoning. Curry's paradox also occurs in some varieties of [[formal logic]]. In this context, it shows that if we assume there is a formal sentence (''X'' β ''Y''), where ''X'' itself is equivalent to (''X'' β ''Y''), then we can prove ''Y'' with a formal proof. One example of such a formal proof is as follows. For an explanation of the logic notation used in this section, refer to the [[Logic notation|list of logic symbols]]. # ''X'' := (''X'' β ''Y'')<br>{{block indent| ''assumption'', the starting point, equivalent to "If this sentence is true, then ''Y''"}} # ''X'' β ''X''<br>{{block indent|''[[law of identity]]''}} # ''X'' β (''X'' β ''Y'')<br>{{block indent|''substitute right side of 2'', since ''X'' is equivalent to ''X'' β ''Y'' by 1}} # ''X'' β ''Y''<br>{{block indent|from 3 by ''[[rule of contraction|contraction]]''}} # ''X''<br>{{block indent|''substitute 4'', by 1}} # ''Y''<br>{{block indent|from 5 and 4 by ''[[modus ponens]]''}} An alternative proof is via ''[[Peirce's law]]''. If ''X'' = ''X'' β ''Y'', then (''X'' β ''Y'') β ''X''. This together with Peirce's law ((''X'' β ''Y'') β ''X'') β ''X'' and ''[[modus ponens]]'' implies ''X'' and subsequently ''Y'' (as in above proof). The above derivation shows that, if ''Y'' is an unprovable statement in a formal system, then there is no statement ''X'' in that system such that ''X'' is equivalent to the implication (''X'' β ''Y''). In other words, step 1 of the previous proof fails. By contrast, the previous section shows that in natural (unformalized) language, for every natural language statement ''Y'' there is a natural language statement ''Z'' such that ''Z'' is equivalent to (''Z'' β ''Y'') in natural language. Namely, ''Z'' is "If this sentence is true then ''Y''".
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)