Theoremizing Yablo's Paradox
Abstract
To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some selfreference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided selfreference. We turn Yablo's paradox, the most challenging paradox in the recent years, into a genuine mathematical theorem in Linear Temporal Logic (LTL). Indeed, Yablo's paradox comes in several varieties; and he showed in 2004 that there are other versions that are equally paradoxical. Formalizing these versions of Yablo's paradox, we prove some theorems in LTL. This is the first time that Yablo's paradox(es) become new(ly discovered) theorems in mathematics and logic.
 Publication:

arXiv eprints
 Pub Date:
 June 2014
 DOI:
 10.48550/arXiv.1406.0134
 arXiv:
 arXiv:1406.0134
 Bibcode:
 2014arXiv1406.0134K
 Keywords:

 Mathematics  Logic;
 Computer Science  Information Theory;
 Computer Science  Logic in Computer Science;
 03B44;
 03A05
 EPrint:
 Preprint