Yablo’s Paradox in Second-Order Languages: Consistency and Unsatisfiability

Studia Logica 101 (3):601-617 (2013)
  Copy   BIBTEX

Abstract

Stephen Yablo [23,24] introduces a new informal paradox, constituted by an infinite list of semi-formalized sentences. It has been shown that, formalized in a first-order language, Yablo’s piece of reasoning is invalid, for it is impossible to derive falsum from the sequence, due mainly to the Compactness Theorem. This result casts doubts on the paradoxical character of the list of sentences. After identifying two usual senses in which an expression or set of expressions is said to be paradoxical, since second-order languages are not compact, I study the paradoxicality of Yablo’s list within these languages. While non-paradoxical in the first sense, the second-order version of the list is a paradox in our second sense. I conclude that this suffices for regarding Yablo’s original list as paradoxical and his informal argument as valid

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2012-10-12

Downloads
71 (#226,074)

6 months
10 (#257,583)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Lavinia Maria Picollo
National University of Singapore

References found in this work

Saving truth from paradox.Hartry H. Field - 2008 - New York: Oxford University Press.
Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
Paradox without Self-Reference.Stephen Yablo - 1993 - Analysis 53 (4):251-252.

View all 27 references / Add more references