Scholastic and analytic definitions of semantic paradoxes, in terms of groundlessness, circularity, and semantic pathology, are introduced and compared with each other. The fundamental intuitions used in these definitions are the concepts of being true about extralinguistic reality, of making statements about one’s self, and of compatibility with an underlying semantic theory. The three approaches—the groundlessness view, the circularity view, and the semantic pathology view—are shown to differ not only conceptually, but also in their applications. As both a means for (...) showing these differences and as an adequacytest, the so-called two-line puzzles are used, which allows one to address the possibility of making non-paradoxical statements about paradoxical sentences within the same language. (shrink)

Weber, Colyvan, and Priest have advanced glutty approaches to the sorites, on which the truth about the penumbral region of a soritical series is inconsistent. The major benefit of a glut-based approach is maintaining the truth of all sorites premisses while none the less avoiding, in a principled fashion, the absurdity of the sorites conclusion. I agree that this is a major virtue of the target glutty approach; however, I think that it can be had without gluts. If correct, this (...) result weighs heavily against the proposed glutty approach, at least given the default-consistency principle that all target glutty philosophers accept: posit gluts only if there is no consistent theory that enjoys the same virtues as the would-be glutty solution. (shrink)

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)

In this paper, I start by describing and examining the main results about the option of formalizing the Yablo Paradox in arithmetic. As it is known, although it is natural to assume that there is a right representation of that paradox in first order arithmetic, there are some technical results that give rise to doubts about this possibility. Then, I present some arguments that have challenged that Yablo’s construction is non-circular. Just like that, Priest (1997) has argued that such formalization (...) shows that Yablo’s Paradox involves implicit circularity. In the same direction, Beall (2001) has introduced epistemic factors in this discussion. Even more, Priest has also argued that the introduction of infinitary reasoning would be of little help. Finally, one could reject definitions of circularity in term of fixed-point adopting non-well-founded set theory. Then, one could hold that the Yablo paradox and the Liar paradox share the same non-well-founded structure. So, if the latter is circular, the first is too. In all such cases, I survey Cook’s approach (2006, forthcoming) on those arguments for the charge of circularity. In the end, I present my position and summarize the discussion involved in this volume. En este artículo, describo y examino los principales resultados vinculados a la formalización de la paradoja de Yablo en la aritmética. Aunque es natural suponer que hay una representación correcta de la paradoja en la aritmética de primer orden, hay algunos resultados técnicos que hacen surgir dudas acerca de esta posibilidad. Más aún, presento algunos argumentos que han cuestionado que la construcción de Yablo no sea circular. Así, Priest (1997) ha argumentado que la formalización de la paradoja de Yablo en la aritmética de primer orden muestra que la misma involucra implícitamente circularidad. En la misma dirección, Beall (2001) ha introducido factores epistémicos en esta discusión. Más aún, Priest ha también argumentado que la introducción de razonamiento infinitario como complemento de la formalización en la aritmética sería de poca ayuda. Finalmente, se podría rechazar todo intento de dar definiciones de circularidad en términos de puntos fijos adoptando teoría de conjuntos infundados. Entonces, se podría sostener que la paradoja de Yablo y la del mentiroso comparten la misma estructura infundada. Por eso, si la última es circular, también lo es la primera. En todos los casos, presento el enfoque de Roy Cook (2006, en prensa) sobre estos argumentos que atribuyen circularidad a la construcción de Yablo. En el final, presento mi posición y un breve resumen de la discusión involucrada en este volumen. (shrink)

We investigate the properties of Yablo sentences and for- mulas in theories of truth. Questions concerning provability of Yablo sentences in various truth systems, their provable equivalence, and their equivalence to the statements of their own untruth are discussed and answered.

Benardete presents a version of Zeno's dichotomy in which an infinite sequence of gods each intends to raise a barrier iff a traveller reaches the position where they intend to raise their barrier. In this paper, I demonstrate the abstract form of the Benardete Dichotomy. I show that the diagnosis based on that form can do philosophical work not done by earlier papers rejecting Priest's version of the Benardete Dichotomy, and that the diagnosis extends to a paradox not normally classified (...) as a dichotomy. I show how the form is exploited to generate paradox. Introduction The form of the Benardete dichotomy 2.1 The unsatisfiable pair diagnosis Applying the unsatisfiable pair diagnosis 3.1 Perez Laraudogoitia 3.2 Hawthorne 3.3 Angel 3.4 Yablo and Sorensen Exploiting the form. (shrink)

I have argued that without an adequate solution to the knower paradox Fitch's Proof is- or at least ought to be-ineffective against verificationism. Of course, in order to follow my suggestion verificationists must maintain that there is currently no adequate solution to the knower paradox, and that the paradox continues to provide prima facie evidence of inconsistent knowledge. By my lights, any glimpse at the literature on paradoxes offers strong support for the first thesis, and any honest, non-dogmatic reflection on (...) the knower paradox provides strong support for the second. Whether verificationists want to go the route I've suggested is not for me todecide. As in the previous section my aim has been that of defending the mere viability of verificationism in the face of what many, many philosophers have taken to be its death-knell, namely Fitch's Proof. But, as the final objection makes clear, showing that verificationism can live in the face of Fitch's Proof is one thing; showing that it should live is another project. If nothing else, I hope that this papershows that verificationists still have a project to pursue; Fitch's Proof, contrary to popular opinion, need not bury verificationism.13. (shrink)

José Benardete developed a famous paradox involving a beginningless set of items each member of which satisfies some predicate just in case no earlier member satisfies it. The Grim Reaper version of this paradox has recently been employed in favour of various finitist metaphysical theses, ranging from temporal finitism to causal finitism to the discrete nature of time. Here, I examine a new challenge to these finitist arguments—namely, the challenge of implying that the future cannot be endless. In particular, I (...) develop future-oriented Benardete paradoxes and examine their epistemic symmetry with past-oriented paradoxes. (shrink)

In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n (...) = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it. (shrink)

“Trends in Logic XVI: Consistency, Contradiction, Paraconsistency, and Reasoning - 40 years of CLE” is being organized by the Centre for Logic, Epistemology and the History of Science at the State University of Campinas (CLEUnicamp) from September 12th to 15th, 2016, with the auspices of the Brazilian Logic Society, Studia Logica and the Polish Academy of Sciences. The conference is intended to celebrate the 40th anniversary of CLE, and is centered around the areas of logic, epistemology, philosophy and history of (...) science, while bringing together scholars in the fields of philosophy, logic, mathematics, computer science and other disciplines who have contributed significantly to what Studia Logica is today and to what CLE has achieved in its four decades of existence. It intends to celebrate CLE’s strong influence in Brazil and Latin America and the tradition of investigating formal methods inspired by, and devoted to, philosophical views, as well as philosophical problems approached by means of formal methods. The title of the event commemorates one of the three main areas of CLE, what has been called the “Brazilian school of paraconsistency”, combining such a pluralist view about logic and reasoning. (shrink)

Thought: A Journal of Philosophy, EarlyView.

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

The concept of information has well-known difficulties. Among the many issues that have been discussed is the alethic nature of a semantic conception of information. Floridi :197–222, 2004; Philos Phenomenol Res 70:351–370, 2005; EUJAP 3:31–41, 2007; The philosophy of information, Oxford University Press, Oxford, 2011) argued that semantic information must be truthful. In this article, arguments will be presented in favor of an alethically neutral conception of semantic information and it will be shown that such a conception can withstand Floridi’s (...) criticism. In particular, it is argued that an alethically neutral conception of semantic information can manage the so-called Bar-Hillel Carnap paradox, according to which contradictions have maximum informational content. This issue, as well as some of Floridi’s other arguments, is resolved by disentangling the property of being information from the property of being informative. The essay’s final conclusion is that although semantic information is alethically neutral, a veridical conception of semantic information can, and should, be retained as a subconcept of semantic information, as it is essential for the analysis of informativity, which, unlike the property of being information, depends on truth. (shrink)

The Brandenburger–Keisler paradox is a self-referential paradox in epistemic game theory which can be viewed as a two-person version of Russell’s Paradox. Yablo’s Paradox, according to its author, is a non-self referential paradox, which created a significant impact. This paper gives a Yabloesque, non-self-referential paradox for infinitary players within the context of epistemic game theory. The new paradox advances both the Brandenburger–Keisler and Yablo results. Additionally, the paper constructs a paraconsistent model satisfying the paradoxical statement.

What kinds of sentences with truth predicate may be inserted plausibly and consistently into the T-scheme? We state an answer in terms of dependence: those sentences which depend directly or indirectly on non-semantic states of affairs (only). In order to make this precise we introduce a theory of dependence according to which a sentence φ is said to depend on a set Φ of sentences iff the truth value of φ supervenes on the presence or absence of the sentences of (...) Φ in/from the extension of the truth predicate. Both φ and the members of Φ are allowed to contain the truth predicate. On that basis we are able define notions such as ungroundedness or self-referentiality within a classical semantics, and we can show that there is an adequate definition of truth for the class of sentences which depend on non-semantic states of affairs. (shrink)

The Yablo Paradox (Cook 2014) is an examination of, well, the Yablo paradox. For space reasons, I’ll assume you’re familiar with the paradox already (sorry!); i.

A novel normal form for propositional theories underlies the logic pdl, which captures some essential features of natural discourse, independent from any particular subject matter and related only to its referential structure. In particular, pdlallows to distinguish vicious circularity from the innocent one, and to reason in the presence of inconsistency using a minimal number of extraneous assumptions, beyond the classical ones. Several, formally equivalent decision problems are identified as potential applications: non-paradoxical character of discourses, admissibility of arguments in argumentation (...) networks, propositional satisfiability, and the existence of kernels of directed graphs. Directed graphs provide the basis for the semantics of pdl and the paper concludes by an overview of relevant graph-theoretical results and their applications in diagnosing paradoxical character of natural discourses. (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)

In this paper, we strengthen Hardy’s [1995] and Ketland’s [2005] arguments on the issues surrounding the self-referential nature of Yablo’s paradox [1993]. We first begin by observing that Priest’s [1997] construction of the binary satisfaction relation in revealing a fixed point relies on impredicative definitions. We then show that Yablo’s paradox is ‘ω-circular’, based on ω-inconsistent theories, by arguing that the paradox is not self-referential in the classical sense but rather admits circularity at the least transfinite countable ordinal. Hence, we (...) both strengthen arguments for the ω-inconsistency of Yablo’s paradox and present a compromise solution of the problem emerged from Yablo’s and Priest’s conflicting theses. (shrink)

There are two paradoxes of satisfaction, and they are of different kinds. The classic satisfaction paradox is a version of Grelling’s: does ‘does not satisfy itself’ satisfy itself? The Unsatisfied paradox finds a predicate, P, such that Px if and only if x does not satisfy that predicate: paradox results for any x. The two are intuitively different as their predicates have different paradoxical extensions. Analysis reduces each paradoxical argument to differing rule sets, wherein their respective pathologies lie. Having different (...) pathologies, they are paradoxes of different kinds. Furthermore, each of these satisfaction paradoxes has an analogue with the same pathology in set theory. Therefore, these analogues are respectively of the same two kinds. This level of abstraction is significant in that it tracks two related but different pathologies. Thus, not all paradoxes of semantics and set theory share the same pathology: there are at least two kinds of paradox cutting across the semantic and set-theoretic distinction. (shrink)

Although there has been a recent swell of interest in theories of truth that attempt solutions to the liar paradox and the other paradoxes affecting our concept of truth, many of these theories have been criticized for generating new paradoxes, called revenge paradoxes. The criticism is that the theories of truth in question are inadequate because they only work for languages lacking in the resources to generate revenge paradoxes. Theorists facing these objections offer a range of replies, and the matter (...) seems now to be at a standoff. I aim, first, to bolster the revenge objections by considering a relation, internalizability, between languages and theories of truth. A theory of truth is internalizable for a language iff there is an extension of that language in which the theory is expressible and for which the theory provides an accurate and complete assignment of semantic values. There are good reasons to think that acceptable theories of truth are internalizable for any language. With this internalizability requirement in hand, I argue that properly formulated revenge objections are decisive and that the replies to them are inadequate. Second, I show that the internalizability requirement can be met by a certain theory of truth. The central claim of this theory is that truth is an inconsistent concept and should be replaced with a pair of consistent concepts that can then be used to provide a semantics for our truth predicates. This theory is compatible with classical logic, does not give rise to revenge paradoxes of any kind, and satisfies the internalizability requirement. (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)

We investigate what happens when ‘truth’ is replaced with ‘provability’ in Yablo’s paradox. By diagonalization, appropriate sequences of sentences can be constructed. Such sequences contain no sentence decided by the background consistent and sufficiently strong arithmetical theory. If the provability predicate satisfies the derivability conditions, each such sentence is provably equivalent to the consistency statement and to the Gödel sentence. Thus each two such sentences are provably equivalent to each other. The same holds for the arithmetization of the existential Yablo (...) paradox. We also look at a formulation which employs Rosser’s provability predicate. (shrink)

Abstract: A Liar would express a proposition that is true and not true. A Liar Paradox would, per impossibile, demonstrate the reality of a Liar. To resolve a Liar Paradox it is sufficient to make out of its demonstration a reductio of the existence of the proposition that would be true and not true, and to "explain away" the charm of the paradoxical contrary demonstration. Persuasive demonstrations of the Liar Paradox in this paper trade on allusive scope-ambiguities of English definite (...) descriptions, and can seem confirmed by symbolizations in a Fregean theory in which scopes of definite descriptions are determinate. Symbolizing instead in a Russellian description theory in which alternative scopes are possible reveals that however the scope-ambiguities of the demonstration are settled the result is unsound. (shrink)

Self-reference has played a prominent role in the development of metamathematics in the past century, starting with Gödel’s first incompleteness theorem. Given the nature of this and other results in the area, the informal understanding of self-reference in arithmetic has sufficed so far. Recently, however, it has been argued that for other related issues in metamathematics and philosophical logic a precise notion of self-reference and, more generally, reference is actually required. These notions have been so far elusive and are surrounded (...) by an aura of scepticism that has kept most philosophers away. In this paper I suggest we shouldn’t give up all hope. First, I introduce the reader to these issues. Second, I discuss the conditions a good notion of reference in arithmetic must satisfy. Accordingly, I then introduce adequate notions of reference for the language of first-order arithmetic, which I show to be fruitful for addressing the aforementioned issues in metamathematics. (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)

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)

To borrow a colorful phrase from Kant, this dissertation offers a prolegomenon to any future semantic theory. The dissertation investigates Yablo's omega-liar paradox and draws the following consequence. Any semantic theory that accepts the existence of semantic objects must face Yablo's paradox. The dissertation endeavors to position Yablo's omega-liar in a role analogous to that which Russell's paradox has for the foundations of mathematics. Russell's paradox showed that if we wed mathematics to sets, then because of the many different possible (...) restrictions available for blocking the paradox, mathematics fractionates. There would be different mathematics. This is intolerable. It is similarly intolerable to have restrictions on the `objects' of Intentionality. Hence, in the light of Yablo's omega-liar, Intentionality cannot be wed to any theory of semantic objects. We ought, therefore, to think of Yablo's paradox as a natural language paradox, and as such we must accept its implications for the semantics of natural language, namely that those entities which are `meanings' must not be construed as objects. To establish our result, Yablo's paradox is examined in light of the criticisms of Priest. Priest maintains that Yablo's original omega-liar is flawed in its employment of a Tarski-style T-schema for its truth-predicate. Priest argues that the paradox is not formulable unless it employs a "satisfaction" predicate in place of its truth-predicate. Priest is mistaken. However, it will be shown that the omega-liar paradox depends essentially on the assumption of semantic objects. No formulation of the paradox is possible without this assumption. Given this, the dissertation looks at three different sorts of theories of propositions, and argues that two fail to specify a complete syntax for the Yablo sentences. Purely intensional propositions, however, are able to complete the syntax and thus generate the paradox. In the end, however, the restrictions normally associated with purely intensional propositions begin to look surprisingly like the hierarchies that Yablo sought to avoid with his paradox. The result is that while Yablo's paradox is syntactically formable within systems with formal hierarchies, it is not semantically so. (shrink)

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

In the discussion about Yablo’s Paradox, a debated topic is the status of infinitary proofs. It is usually considered that, although a realist could (with some effort) accept them, an anti-realist could not do it at all. In this paper I will argue that there are plausible reasons for an anti-realist to accept infinitary proofs and rules of inference. En la discusión sobre la Paradoja de Yablo, un tópico debatido es el estatus de las pruebas infinitarias. Se suele considerar que, (...) aunque un realista podría (con cierto esfuerzo) aceptarlas, un anti-realista no podría hacerlo en absoluto. En este artículo, argumento que hay razones plausibles para que un anti-realista acepte pruebas y reglas de inferencia infinitarias. (shrink)

The blame for the semantic and set-theoretic paradoxes is often placed on self-reference and circularity. Some years ago, Yablo [1985; 1993] challenged this diagnosis, by producing a paradox that's liar-like but does not seem to involve circularity. But is Yablo's paradox really non-circular? In a recent paper, Beall [2001] has suggested that there are no means available to refer to Yablo's paradox without invoking descriptions, and since Priest [1997] has shown that any such description is circular, Beall concludes that Yablo's (...) paradox itself is circular. In this paper, we argue that Beall's conclusion is unwarranted, given that (1) descriptions are not the only way to refer to Yablo's paradox, and (ii) we have no reason to believe that because the description involves self-reference, the denotation of the description is also circular. As a result, for all that's been said so far, we have no reason to believe that Yablo's paradox is circular. (shrink)

This paper examines the paradox of revisability. This paradox was proposed by Jerrold Katz as a problem for Quinean naturalised epistemology. Katz employs diagonalisation to demonstrate what he takes to be an inconsistency in the constitutive principles of Quine's epistemology. Specifically, the problem seems to rest with the principle of universal revisability which states that no statement is immune to revision. In this paper it is argued that although there is something odd about employing universal revisability to revise itself, there (...) is nothing paradoxical about this. At least, there is no paradox along the lines suggested by Katz. (shrink)

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 Surprise Exam Paradox continues to perplex and torment despite the many solutions that have been offered. This paper proposes to end the intrigue once and for all by refuting one of the central pillars of the Surprise Exam Paradox, the 'No Friday Argument,' which concludes that an exam given on the last day of the testing period cannot be a surprise. This refutation consists of three arguments, all of which are borrowed from the literature: the 'Unprojectible Announcement Argument,' the (...) 'Wright & Sudbury Argument,' and the 'Epistemic Blindspot Argument.' The reason that the Surprise Exam Paradox has persisted this long is not because any of these arguments is problematic. On the contrary, each of them is correct. The reason that it has persisted so long is because each argument is only part of the solution. The correct solution requires all three of them to be combined together. Once they are, we may see exactly why the No Friday Argument fails and therefore why we have a solution to the Surprise Exam Paradox that should stick. (shrink)

The Lottery Paradox and the Preface Paradox both involve the thesis that high probability is sufficient for rational acceptability. The standard solution to these paradoxes denies that rational acceptability is deductively closed. This solution has a number of untoward consequences. The present paper suggests that a better solution to the paradoxes is to replace the thesis that high probability suffices for rational acceptability with a somewhat stricter thesis. This avoids the untoward consequences of the standard solution. The new solution will (...) be defended against a seemingly obvious objection. 1 The paradoxes of rational acceptability 2 The standard solution 3 A new solution to the paradoxes 4 Basic assumptions 5 The new solution defended 6 Conclusion 7 Appendix. (shrink)

JSTOR is a not-for-profit organization founded in 1995 to build trusted digital archives for scholarship. We work with the scholarly community to preserve their work and the materials they rely upon, and to build a common research platform that promotes the discovery and use of these resources. For more information about JSTOR, please contact [email protected].

Ebbhinghaus, H., J. Flum, and W. Thomas. 1984. Mathematical Logic. New York, NY: Springer-Verlag. Forster, T. Typescript. The significance of Yablo’s paradox without self-reference. Available from http://www.dpmms.cam.ac.uk. Gold, M. 1965. Limiting recursion. Journal of Symbolic Logic 30: 28–47. Karp, C. 1964. Languages with Expressions of Infinite Length. Amsterdam.

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.