Journal of Logic, Language and Information

, Volume 22, Issue 1, pp 23–31

Equiparadoxicality of Yablo’s Paradox and the Liar



It is proved that Yablo’s paradox and the Liar paradox are equiparadoxical, in the sense that their paradoxicality is based upon exactly the same circularity condition—for any frame \({\mathcal{K}}\), the following are equivalent: (1) Yablo’s sequence leads to a paradox in \({\mathcal{K}}\); (2) the Liar sentence leads to a paradox in \({\mathcal{K}}\); (3) \({\mathcal{K}}\) contains odd cycles. This result does not conflict with Yablo’s claim that his sequence is non-self-referential. Rather, it gives Yablo’s paradox a new significance: his construction contributes a method by which we can eliminate the self-reference of a paradox without changing its circularity condition.


Circularity Equiparadoxical Liar paradox T-schema Yablo’s paradox 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2012

Authors and Affiliations

  1. 1.School of Politics and AdministrationSouth China Normal UniversityGuangzhouPeople’s Republic of China

Personalised recommendations