My aim in this paper is to gather some evident in favor of the view that a general purge of self-reference is possible. I do this by considering a modal-epistemic version of the Liar Paradox introduced by Roy Cook. Using yabloesque techniques, I show that it is possible to transform this circular paradoxical construction (and other constructions as well) into an infinitary construction lacking any sort of circularity. Moreover, contrary to Cook’s approach, I think that this can be done without (...) using any controversial multimodal rules, i.e., the usual rules from normal epistemic and modal logic are enough to show the paradoxicality of the infinitary construction. Mi objetivo en este trabajo es ofrecer cierta evidencia a favor de la tesis según la cual una purga general de la autorreferencia es posible. Hago esto considerando una versión modal-epistémica de la Paradoja del mentiroso introducida por Roy Cook. usando técnicas yablescas, muestro que es posible transformar esta construcción paradójica circular (y también otras construcciones) en una construcción infinitaria que carece de cualquier forma de circularidad. más aún, en contra de la propuesta de Cook, muestro que esto puede hacerse sin utilizar ninguna regla multimodal controversial, esto es, las reglas usuales de la lógica modal y la lógica epistémica son suficientes para mostrar la paradojicidad de la construcción infinitaria. (shrink)

Some years ago, Yablo gave a paradox concerning an infinite sequence of sentences: if each sentence of the sequence is 'every subsequent sentence in the sequence is false', a contradiction easily follows. In this paper we suggest a formalization of Yablo's paradox in algebraic and topological terms. Our main theorem states that, under a suitable condition, any continuous function from 2N to 2N has a fixed point. This can be translated in the original framework as follows. Consider an infinite sequence (...) of sentences, where any sentence refers to the truth values of the subsequent sentences: if the corresponding function is continuous, no paradox arises. (shrink)

This paper provides a procedure which, from any Boolean system of sentences, outputs another Boolean system called the ‘_m_-cycle unwinding’ of the original Boolean system for any positive integer _m_. We prove that for all \(m>1\), this procedure eliminates the direct self-reference in that the _m_-cycle unwinding of any Boolean system must be indirectly self-referential. More importantly, this procedure can preserve the primary periods of Boolean paradoxes: whenever _m_ is relatively prime to all primary periods of a Boolean paradox, this (...) paradox and its _m_-cycle unwinding have the same primary periods. In this way, we can produce an indirectly self-referential Boolean paradox with the same periodic characteristics as a known Boolean paradox. (shrink)

The unwinding that Cook, 767–774 2004) proposed is a simple but powerful method of generating new paradoxes from known ones. This paper extends Cook’s unwinding to a larger class of paradoxes and studies further the basic properties of the unwinding. The unwinding we study is a procedure, by which when inputting a Boolean modal net together with a definable digraph, we get a set of sentences in which we have a ‘counterpart’ for each sentence of the Boolean modal net and (...) each point of the digraph. What is more, whenever a sentence of the Boolean modal net says another sentence is necessary, then the counterpart of the first sentence at a point correspondingly says the counterparts of the second one at all accessible points of that point are all true. The output of the procedure is called ‘the unwinding of a Boolean modal net on a definable digraph’. We prove that the unwinding procedure preserves paradoxicality: a Boolean modal net is paradoxical on a definable digraph, iff the unwinding of it on this digraph is also paradoxical. Besides, the dependence digraph for the unwinding of a Boolean modal net on a definable digraph is proved to be isomorphic to the unwinding of the dependence digraph for the Boolean modal net on the previous definable digraph. So the unwinding of a Boolean modal net on a digraph is self-referential, iff the Boolean modal net is self-referential and the digraph is cyclic. Thus, on the one hand, the unwinding of any Boolean modal net on an acyclic digraph is non-self-referential. In particular, the unwinding of any Boolean modal net on \ is non-self-referential. On the other hand, if a Boolean modal net is paradoxical on a locally finite digraph, the unwinding of it on that digraph must be self-referential. Hence, starting from a Boolean modal paradox, the unwinding can output a non-self-referential paradox only if the digraph is not locally finite. (shrink)

This paper gives a definition of self-reference on the basis of the dependence relation given by Leitgeb (J Philos Logic 34(2):155–192, 2005), and the dependence digraph by Beringer and Schindler (Reference graphs and semantic paradox, 2015. https://www.academia.edu/19234872/reference_graphs_and_semantic_paradox). Unlike the usual discussion about self-reference of paradoxes centering around Yablo’s paradox and its variants, I focus on the paradoxes of finitary characteristic, which are given again by use of Leitgeb’s dependence relation. They are called ‘locally finite paradoxes’, satisfying that any sentence in (...) these paradoxes can depend on finitely many sentences. I prove that all locally finite paradoxes are self-referential in the sense that there is a directed cycle in their dependence digraphs. This paper also studies the ‘circularity dependence’ of paradoxes, which was introduced by Hsiung (Logic J IGPL 22(1):24–38, 2014). I prove that the locally finite paradoxes have circularity dependence in the sense that they are paradoxical only in the digraph containing a proper cycle. The proofs of the two results are based directly on König’s infinity lemma. In contrast, this paper also shows that Yablo’s paradox and its ∀∃\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\forall \exists $$\end{document}-unwinding variant are non-self-referential, and neither McGee’s paradox nor the ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}-cycle liar has circularity dependence. (shrink)

This paper gives a definition of self-reference on the basis of the dependence relation given by Leitgeb (2005), and the dependence digraph by Beringer & Schindler (2015). Unlike the usual discussion about self-reference of paradoxes centering around Yablo's paradox and its variants, I focus on the paradoxes of finitary characteristic, which are given again by use of Leitgeb's dependence relation. They are called 'locally finite paradoxes', satisfying that any sentence in these paradoxes can depend on finitely many sentences. I prove (...) that all locally finite paradoxes are self-referential in the sense that there is a directed cycle in their dependence digraphs. This paper also studies the 'circularity dependence' of paradoxes, which was introduced by Hsiung (2014). I prove that the locally finite paradoxes have circularity dependence in the sense that they are paradoxical only in the digraph containing a proper cycle. The proofs of the two results are based directly on König's infinity lemma. In contrast, this paper also shows that Yablo's paradox and its nested variant are non-self-referential, and neither McGee's paradox nor the omega-cycle liar paradox has circularity dependence. (shrink)

I present a problem for a prominent kind of conservatism, viz., the combination of traditional moral & religious values, patriotic nationalism, and libertarian capitalism. The problem is that these elements sometimes conflict. In particular, I show how libertarian capitalism and patriotic nationalism conflict via a scenario in which the thing that libertarian capitalists love – unregulated market activity – threatens what American patriots love – a strong, independent America. Unrestricted libertarian rights to buy and sell land would permit the sale (...) of all American territory by private individuals to foreign powers. Patriotic nationalists regard this as outrageous, but libertarian capitalists cannot refuse it. (shrink)

In various theories of truth, people have set forth many definitions to clarify in what sense a set of sentences is paradoxical. But what, exactly, is _a_ paradox per se? It has not yet been realized that there is a gap between ‘being paradoxical’ and ‘being a paradox’. This paper proposes that a paradox is a minimally paradoxical set meeting some closure property. Along this line of thought, we give five tentative definitions based upon the folk notion of paradoxicality implied (...) in Tarski’s undefinability theorem of truth and the dependence relation proposed by Leitgeb (J Philos Log 34(2):155–192, 2005). A definition of ‘being a paradox’ is acceptable if its extension must be sufficiently comprehensive to include all known paradoxes on the one hand, and its standard must also be high enough to exclude those that are evidently not paradoxes on the other hand. It turns out that only the last attempt is acceptable: a set of sentences is a paradox if it is paradoxical and self-dependent, and at the same time, it and any of its paradoxical and self-dependent subsets bisimulate each other. In this way, we articulate in what sense a set of sentences is a paradox, and so establish a connection between the notion of a paradox and the notion of paradoxicality. (shrink)

The sentences employed in semantic paradoxes display a wide range of semantic behaviours. However, the main theories of truth currently available either fail to provide a theory of paradox altogether, or can only account for some paradoxical phenomena by resorting to multiple interpretations of the language. In this paper, I explore the wide range of semantic behaviours displayed by paradoxical sentences, and I develop a unified theory of truth and paradox, that is a theory of truth that also provides a (...) unified account of paradoxical sentences. The theory I propose here yields a threefold classification of paradoxical sentences – liar-like sentences, truth-teller-like sentences, and revenge sentences. Unlike existing treatments of semantic paradox, the theory put forward in this paper yields a way of interpreting all three kinds of paradoxical sentences, as well as unparadoxical sentences, within a single model. (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)

The semantic paradoxes are often associated with self-reference or referential circularity. Yablo (Analysis 53(4):251–252, 1993), however, has shown that there are infinitary versions of the paradoxes that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality. In this essay, we lay the groundwork for a general investigation into the nature of reference structures that support the semantic paradoxes and the semantic hypodoxes. We develop (...) a functionally complete infinitary propositional language endowed with a denotation assignment and extract the reference structural information in terms of graph-theoretic properties. We introduce the new concepts of dangerous and precarious reference graphs, which allows us to rigorously define the task: classify the dangerous and precarious directed graphs purely in terms of their graph-theoretic properties. Ungroundedness will be shown to fully characterize the precarious reference graphs and fully characterize the dangerous finite graphs. We prove that an undirected graph has a dangerous orientation if and only if it contains a cycle, providing some support for the traditional idea that cyclic structure is required for paradoxicality. This leaves the task of classifying danger for infinite acyclic reference graphs. We provide some compactness results, which give further necessary conditions on danger in infinite graphs, which in conjunction with a notion of self-containment allows us to prove that dangerous acyclic graphs must have infinitely many vertices with infinite out-degree. But a full characterization of danger remains an open question. In the appendices we relate our results to the results given in Cook (J Symb Log 69(3):767–774, 2004) and Yablo (2006) with respect to more restricted sentences systems, which we call $\mathcal{F}$ -systems. (shrink)

Kripke’s theory of truth succeeded in providing a trivalent semantics for a language that contains its own truth predicate and means of self-reference; but it did so by radically restricting the expressive power of the logic. In Kripke’s analysis, the Liar (e.g. This very sentence is not true) receives the indeterminate truth value; but the logic cannot express the fact that the Liar is something other than true: in order to do so, a weak negation not* would be needed, but (...) it would also make the logic inconsistent (because the ‘Super Liar’ This very sentence is not* true could not be assigned any truth value). Taking a hint from the quantificational form of the problematic sentences (… is something other than true), we define a hierarchy of negations which each quantifies over a domain of truth values, assimilated to ordinals. The resulting logic has as many negations and truth values as there are ordinals. Unlike Kripke’s logic, it enjoys a form of expressive completeness. And although the logic is not monotonic, we show that under broad conditions we can construct a variety of fixed points; one of them emulates Kripke’s ‘least fixed point’, while another one assigns a different truth value to each Super Liar. (shrink)

According to the revision theory of truth, the binary sequences generated by the paradoxical sentences in revision sequence are always unstable. In this paper, we work backwards, trying to reconstruct the paradoxical sentences from some of their binary sequences. We give a general procedure of constructing paradoxes with specific binary sequences through some typical examples. Particularly, we construct what Herzberger called “unstable statements with unpredictably complicated variations in truth value.” Besides, we also construct those paradoxes with infinitely many finite primary (...) periods but without any infinite primary period, those with an infinite critical point but without any finite primary period, and so on. This is the first formal appearance of these paradoxes. Our construction demonstrates that the binary sequences generated by a paradoxical sentence are something like genes from which we can even rebuild the original sentence itself. (shrink)

The aim of this paper is to show that it’s not a good idea to have a theory of truth that is consistent but ω-inconsistent. In order to bring out this point, it is useful to consider a particular case: Yablo’s Paradox. In theories of truth without standard models, the introduction of the truth-predicate to a first order theory does not maintain the standard ontology. Firstly, I exhibit some conceptual problems that follow from so introducing it. Secondly, I show that (...) in second order theories with standard semantics the same procedure yields a theory that doesn’t have models. So, while having an ω- inconsistent theory is a bad thing, having an unsatisfiable theory of truth is actually worse. This casts doubts on whether the predicate in question is, after all, a truthpredicate for that language. Finally, I present some alternatives to prove an inconsistency adding plausible principles to certain theories of truth. (shrink)

We argue that Anselm’s ontological argument (or at least one reconstruction of it) is based on an empirical version of Berry’s paradox. It is invalid, but it takes some understanding of trivalence to see why this is so. Under our analysis, Anselm’s use of the notion of existence is not the heart of the matter; rather, trivalence is.

This article outlines what a formal theory of truth should be like, at least at first glance. As not all of the stated constraints can be satisfied at the same time, in view of notorious semantic paradoxes such as the Liar paradox, we consider the maximal consistent combinations of these desiderata and compare their relative advantages and disadvantages.

The goal of this paper is to present Yabloesque versions of Grelling’s and Zwicker’s paradoxes concerning the notions of “heterological” and “hypergame” respectively. We will offer counterparts of these paradoxes that do not seem to involve self-reference or vicious circularity.El objetivo de este artículo es ofrecer versiones de las paradojas de Grelling y de Zwicker inspiradas en la paradoja de Yablo. Nuestras versiones de estas paradojas no parecen involucrar ni autorreferencia ni circularidad viciosa.

The goal of this paper is to present Yabloesque versions of Grelling’s and Zwicker’s paradoxes concerning the notions of “heterological” and “hypergame” respectively. We will offer counterparts of these paradoxes that do not seem to involve any kind of self-reference or vicious circularity.

The Liar paradox is the directly self-referential Liar statement: This statement is false.or : " Λ: ∼ T 1" The argument that proceeds from the Liar statement and the relevant instance of the T-schema: " T ↔ Λ" to a contradiction is familiar. In recent years, a number of variations on the Liar paradox have arisen in the literature on semantic paradox. The two that will concern us here are the Curry paradox, 2 and the Yablo paradox. 3The Curry paradox (...) demonstrates that neither negation nor a falsity predicate is required in order to generate semantic paradoxes. Given any statement Φ whatsoever, we need merely consider the statement: If this statement is true, then Φor: " Ξ: T → Φ" Here, via familiar reasoning, one can ‘prove’ Φ merely through consideration of statement Ξ and the Ξ-instance of the T-schema.Interestingly, the Liar paradox can be viewed as nothing more than a special case of the Curry paradox. If we define negation in terms of the conditional and a primitive absurdity constant ‘⊥’: 4" ∼ Ψ = df Ψ → ⊥" then the Liar paradox is simply the instance of the Curry paradox obtained by substituting ‘⊥’ for Φ.The Yablo paradox demonstrates that circularity is also not required in order to generate semantic paradox. 5 The paradox proceeds by considering an infinite ω-sequence of statements of the form: S 1: ) S 2: ) S 3: ) : : : : : S i: ) : : : : : :– that is, the set of …. (shrink)