Theoremizing Yablo's Paradox
نویسندگان
چکیده
To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some self–reference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided self–reference. 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. vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv 2010 Mathematics Subject Classification: 03B44 o 03A05.
منابع مشابه
IPM-Isfahan workshop on Various Aspects of Modality
Paradoxes are amazing puzzles in philosophy (and mathematics), and they can be interesting when turned into proofs and theorems (in mathematics and logic). For example, Russell's paradox, which collapsed Frege's foundations of mathematics, is now a classical theorem in set theory, and implies that no set of all sets can exist. Or, as another example, the Liar paradox has turned into Tarski's th...
متن کاملDiagonal arguments and fixed points
A universal schema for diagonalization was popularized by N.S. Yanofsky (2003), based on a pioneering work of F.W. Lawvere (1969), in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function. It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema. Here, we fi...
متن کاملThe Elimination of Self-Reference: Generalized Yablo-Series and the Theory of Truth
Although it was traditionally thought that self-reference is a crucial ingredient of semantic paradoxes, Yablo (1993, 2004) showed that this was not so by displaying an infinite series of sentences none of which is self-referential but which, taken together, are paradoxical. Yablo's paradox consists of a countable series of linearly ordered sentences s(0), s(1), s(2), ... , where each s(i) says...
متن کاملABSTRACTS A1.1 Mathematical Logic On Implicational Connectives of Quantum Logics for Non-commutative Substructural Logics formulated Gentzen-style Natural Deduction
S A1.1 Mathematical Logic On Implicational Connectives of Quantum Logics for Non-commutative Substructural Logics formulated Gentzen-style Natural Deduction Takeshi Ueno, Food Science and Human Wellnes, Rakuno-Gakuen University, Ebetsu, JAPAN See below for abstract. A theory for systems of propositions referring to each other Denis Saveliev, Institute for Information Transmission Problems, Russ...
متن کاملHow to eliminate self-reference: a précis
We provide a systematic recipe for eliminating self-reference from a simple language in which semantic paradoxes (whether purely logical or empirical) can be expressed. We start from a non-quantificational language L which contains a truth predicate and sentence names, and we associate to each sentence F of L an infinite series of translations h0(F), h1(F), ..., stated in a quantificational lan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1406.0134 شماره
صفحات -
تاریخ انتشار 2014