Jump to content

Yablo's paradox

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 84.215.54.187 (talk) at 05:55, 22 October 2011 (rm unsourced original research (not obviously true, the claim is about S_k not S)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Yablo's paradox is of type similar to the liar paradox published by Stephen Yablo in 1993.[1]

The paradox arises from considering the following infinite set of sentences:

  • (S1): for all k > 1, Sk is false
  • (S2): for all k > 2, Sk is false
  • (S3): for all k > 3, Sk is false
  • ...
  • ...

The set is paradoxical, because it is unsatisfiable (contradictory), but this unsatisfiability defies immediate intuition.

Moreover, none of the sentences refers to itself, but only to the subsequent sentences; this leads Yablo to claim that his paradox does not rely on self-reference.

References

  1. ^ "Paradox Without Self-Reference" (PDF). Analysis. 53 (4): 251–252. 1993. doi:10.1093/analys/53.4.251.
Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=Yablo%27s_paradox&oldid=456787531"