Yablo Without Gödel
We prove Yablo’s paradox without the diagonal lemma or the recursion theorem. Only a disquotation schema and axioms for a serial and transitive ordering are used in the proof. e consequences for the discussion on whether Yablo’s paradox is circular or involves self-reference are evaluated. yablo ’s paradox in arithmetic Yablo (1985, 1993) formulated his paradox as an innite list of sentences. One way to state the paradox is the following: For all k > , Sk is not true. (S) For all k > , Sk is not true. (S) For all k > , Sk is not true. (S)