Tarski's theorem essentially says that the Liar paradox is paradoxical in the minimal reflexive frame. We generalise this result to the Liar-like paradox $\lambda^\alpha$ for all ordinal $\alpha\geq 1$. The main result is that for any positive integer $n = 2^i(2j+1)$, the paradox $\lambda^n$ is paradoxical in a frame iff this frame contains at least a cycle the depth of which is not divisible by $2^{i+1}$; and for any ordinal $\alpha \geq \omega$, the paradox $\lambda^\alpha$ is paradoxical in a frame (...) iff this frame contains at least an infinite walk which has an arbitrarily large depth. We thus get that $\lambda^n$ has a degree of paradoxicality no more than $\lambda^m$ iff the multiplicity of 2 in the (unique) prime factorisation of $n$ is no more than that in the prime factorisation of $m$; and all tranfinite $\lambda^\alpha$ has the same degree of paradoxcality but has a higher degree of paradoxicality than any $\lambda^n$. (shrink)

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: For each k > i, s(k) is false (or equivalently: For no k > i is s(k) true). We generalize Yablo's (...) results along two dimensions. First, we study the behavior of generalized Yablo-series in which each sentence s(i) has the form: For Q k > i, s(k) is true, where Q is a generalized quantifier (e.g., no, every, infinitely many, etc). We show that under broad conditions all the sentences in the series must have the same truth value, and we derive a characterization of those values of Q for which the series is paradoxical. Second, we show that in the Strong Kleene trivalent logic Yablo's results are a special case of a more general fact: under certain conditions, any semantic phenomenon that involves self-reference can be emulated without self-reference. Various translation procedures that eliminate self-reference from a non-quantificational language are defined and characterized. An Appendix sketches an extension to quantificational languages, as well as a new argument that Yablo's paradox and the translations we offer do not involve self-reference. (shrink)

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. (shrink)

Many topics have not been covered, in most cases because I don't know quite what to say about them. Would it be possible to add a decidability predicate to the language? What about stronger connectives, like exclusion negation or Lukasiewicz implication? Would an expanded language do better at expressing its own semantics? Would it contain new and more terrible paradoxes? Can the account be supplemented with a workable notion of inherent truth (see note 36)? In what sense does stage semantics (...) lie “between” fixed point and stability semantics? In what sense, exactly, are our semantical rules inconsistent? In what sense, if any, does their inconsistency resolve the problem of the paradoxes?The ideals of strength, grounding, and closure together define an intuitively appealing conception of truth. Nothing would be gained by insisting that it was the intuitive conception of truth, and in fact recent developments make me wonder whether such a thing exists. However that may be, until the alternatives are better understood it would be foolish to attempt to decide between them. Truth gives up her secrets slowly and grudgingly, and loves to confound our presumptions. (shrink)

A relativized version of Tarski's T-scheme is introduced as a new principle of the truth predicate. Under the relativized T-scheme, the paradoxical objects, such as the Liar sentence and Jourdain's card sequence, are found to have certain relative contradictoriness. That is, they are contradictory only in some frames in the sense that any valuation admissible for them in these frames will lead to a contradiction. It is proved that for any positive integer n, the n-jump liar sentence is contradictory in (...) and only in those frames containing at least an n-jump odd cycle. In particular, the Liar sentence is contradictory in and only in those frames containing at least an odd cycle. The Liar sentence is also proved to be less contradictory than Jourdain's card sequence: the latter must be contradictory in those frames where the former is so, but not vice versa. Generally, the relative contradictoriness is the common characteristic of the paradoxical objects, but different paradoxical objects may have different relative contradictoriness. (shrink)

We begin with a prepositional languageLpcontaining conjunction (Λ), a class of sentence names {Sα}αϵA, and a falsity predicateF. We (only) allow unrestricted infinite conjunctions, i.e., given any non-empty class of sentence names {Sβ}βϵB,is a well-formed formula (we will useWFFto denote the set of well-formed formulae).The language, as it stands, is unproblematic. Whether various paradoxes are produced depends on which names are assigned to which sentences. What is needed is a denotation function:For example, theLPsentence “F(S1)” (i.e.,Λ{F(S1)}), combined with a denotation functionδsuch (...) thatδ(S1)“F(S1)”, provides the (or, in this context, a)Liar Paradox.To give a more interesting example,Yablo's Paradox[4] can be reconstructed within this framework.Yablo's Paradoxconsists of an ω-sequence of sentences {Sk}kϵωwhere, for eachnϵω:WithinLPan equivalent construction can be obtained using infinite conjunction in place of universal quantification - the sentence names are {Si}iϵωand the denotation function is given by:We can express this in more familiar terms as:etc. (shrink)