Paradoxes, Misc

It is a platitude that when we reason, we often take things for granted, sometimes even justifiably so. The chemist might reason from the fact that a substance turns litmus paper red to that substance being an acid. In so doing, they take for granted, reasonably enough, that this test for acidity is valid. We ordinarily reason from things looking a certain way to their being that way. We take for granted, reasonably enough, that things are as they look Although (...) it is a platitude that we often take things for granted when we reason—whether justifiably or not—one might think that we do not have to. In fact, it is a natural expectation that were we not pressed by time, lack of energy or focus, we could always in principle make explicit in the form of premises every single presupposition we make in the course of our reasoning. In other words, it is natural to expect it to be true that presuppositionless reasoning is possible. In this essay, I argue that it is false: presuppositionless reasoning is impossible. Indeed, I think this is one of the lessons of a long-standing paradox about inference and reasoning known as Lewis Carroll’s (1985) regress of the premises. Many philosophers agree that Carroll’s regress teaches us something foundational about reasoning. I part ways about what it is that it teaches us. What it teaches us is that the structure of reasoning is constitutively presuppositional. (shrink)

In this essay we introduce a new tool for studying the patterns of sentential reference within the framework introduced in [2] and known as the language of paradox $\mathcal {L}_{\mathsf {P}}$ : strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms. In particular, we show that (i) strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms between $\mathcal {L}_{\mathsf {P}}$ constructions preserve paradoxicality, (ii) many (but not all) earlier results regarding the paradoxicality of $\mathcal {L}_{\mathsf {P}}$ constructions can be recast as special cases of our central result regarding (...) strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms, and (iii) that we can use strong $\mathcal {L}_{\mathsf { P}}$ -homomorphisms to provide a simple demonstration of the paradoxical nature of a well-known paradox that has not received much attention in this context: the McGee paradox. In addition, along the way we will highlight how strong $\mathcal {L}_{\mathsf {P}}$ -homomorphisms highlight novel connections between the graph-theoretic analyses of paradoxes mobilized in the $\mathcal {L}_{\mathsf {P}}$ framework and the methods and tools of category theory. (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)

Although formal analysis provides us with interesting tools for treating Curry’s paradox, it certainly does not exhaust every possible reading of it. Thus, we suggest that this paradox should be analysed with non-formal tools coming from pragmatics. In this way, using Grice’s logic of conversation, we will see that Curry’s sentence can be reinterpreted as a peculiar conditional sentence implying its own consequent.

Morgenbesser's Coin is a thought experiment that exemplifies a widespread disposition to infer counterfactual independence from causal independence. I argue that this disposition is mistaken by analysing a closely related thought experiment.

در تکوین نظریه محاسبات از اوایل قرن بیستم پارادکسها و خود ارجاعی نقش ویژه ای را بازی کرده اند. هر چند نظریه محاسبات عام بر اساس تعریف ماشین تورینگ، فرض تورینگ_چرچ و کاربردهای آن بنا شده ،اما از همان ابتدا تا به امروز منطق و حوزه های مختلف این علم در ارتباط تنگاتنگ با این تیوری و در ابتدا نظریه محاسبات خاص بوده و این ارتباط روز به روز گسترده و گسترده تر گشته است. از تاثیر پارادوکس دروغگو و پارادکس (...) بری در تمایز میان مفهوم محاسبه پذیر و محاسبه پذیر شمارایانه، قضایای گودل و قضیه چیتین همه جا شاهد این تاثیر و تاثر متقابل هستیم. در این مقال می خواهیم بعد از معرفی اجمالی مطالب باال، تاثیر یک پارادوکس دیگر، پارادوکس اعدام غیر منتظره، را بر این نظریه بررسی نماییم. (shrink)

The Nothing from Infinity paradox arises when the combination of two infinitudes of point particles meet in a supertask and disappear. Corral-Villate claims that my arguments for disappearance fail and concedes that this failure also produces an extreme kind of indeterminism, which I have called plenitudinous. So my supertask at least poses a dilemma of extreme indeterminism within Newtonian point particle mechanics. Plenitudinous indeterminism might be trivial, although easy attempts to prove it so seem to fail in the face of (...) plausible continuity principles. However, the question of its triviality is here moot, since I show that, except in one case, Corral-Villate’s disproofs fail, and with a correction, the original arguments are unrefuted. Consequently, of the two contenders for the outcome of my supertask, the Nothing from Infinity paradox has won out. (shrink)

Several authors have investigated the question of whether canonical logic-based accounts of belief revision, and especially the theory of AGM revision operators, are compatible with the dynamics of Bayesian conditioning. Here we show that Leitgeb's stability rule for acceptance, which has been offered as a possible solution to the Lottery paradox, allows to bridge AGM revision and Bayesian update: using the stability rule, we prove that AGM revision operators emerge from Bayesian conditioning by an application of the principle of maximum (...) entropy. In situations of information loss, or whenever the agent relies on a qualitative description of her information state - such as a plausibility ranking over hypotheses, or a belief set - the dynamics of AGM belief revision are compatible with Bayesian conditioning; indeed, through the maximum entropy principle, conditioning naturally generated AGM revision operators. This mitigates an impossibility theorem of Lin and Kelly for tracking Bayesian conditioning with AGM revision, and suggests an approach to the compatibility problem that highlights the information loss incurred by acceptance rules in passing from probabilistic to qualitative representations of beliefs. (shrink)

Bertrand’s paradox ) can be considered as a cautionary memento, to practitioners and students of probability calculus alike, of the possible ambiguous meaning of the term ‘at random’ when the sample space of events is continuous. It deals with the existence of different possible answers to the following question: what is the probability that a chord, drawn at random in a circle of radius R, is longer than the side of an inscribed equilateral triangle? Physics can help to remove the (...) ambiguity by identifying an actual experiment, whose outcome is obviously unique and prescribes the physical variables to which the term ‘random’ can be correctly applied. In this paper, after briefly describing Bertrand’s paradox, we associate it with an experiment, which is basically a variation of the famous Buffon’s needle experiment for estimating the value of π. Its outcome is compared with the analytic predictions of probability calculus, that is with the probability distribution of variables whose uniform distribution can be considered a sound implementation of complete randomness. (shrink)

This paper introduces two new paradoxes for standard deontic logic (SDL). They are importantly related to, but distinct from Ross' paradox. These two new paradoxes for SDL are the simple weakening paradox and the complex weakening paradox. Both of these paradoxes arise in virtue of the underlaying logic of SDL and are consequences of the fact that SDL incorporates the principle known as weakening. These two paradoxes then show that SDL has counter-intuitive implications related to disjunctive obligations that arise in (...) virtue of deontic weakening and in virtue of decisions concerning how to discharge such disjunctive obligations. The main result here is then that theorem T1 is a problematic component of SDL that needs to be addressed. (shrink)

Thought experiments are common where infinitely many entities acting in concert give rise to strange results. Some of these cases, however, can be generalized to yield almost omnipotent systems from limited materials. This paper discusses one of these cases, bringing out one aspect of what seems so troubling about "New Zeno" cases. -/- This paper is in memory of Josh Parsons.

We present a revenge argument for non-reflexive theories of semantic notions – theories which restrict the rule of assumption, or initial sequents of the form φ ⊩ φ. Our strategy follows the general template articulated in Murzi and Rossi [21]: we proceed via the definition of a notion of paradoxicality for non-reflexive theories which in turn breeds paradoxes that standard non-reflexive theories are unable to block.

In the literature on self-referential paradoxes one of the hardest and most challenging problems is that of revenge. This problem can take many shapes, but, typically, it besets non-classical accounts of some semantic notion, such as truth, that depend on a set of classically defined meta-theoretic concepts, like validity, consistency, and so on. A particularly troubling form of revenge that has received a lot of attention lately involves the concept of validity. The difficulty lies in that the non-classical logician cannot (...) accept her own definition of validity because it is given in a classical meta-theory. It is often suggested that this mismatch between the consequence relation of the account being espoused and the consequence relation of the meta-theory is a serious embarrassment. The main goal of the paper is to explore whether certain substructural accounts of the paradoxes can avoid this sort of embarrassment. Typically, these accounts are expressively incomplete, since they cannot assert in the object language that certain invalid arguments are in fact invalid. To overcome this difficulty I develop a novel type of hybrid proof-procedure, one that takes invalidities to be just as fundamental as validities. I prove that this proof-procedure enjoys a number of interesting properties and I analyze the prospects of applying it to languages capable of expressing self-referential statements. (shrink)

The aim of this volume is to open up new perspectives and to raise new research questions about a unified approach to truth, modalities, and propositional attitudes. The volume's essays are grouped thematically around different research questions. The first theme concerns the tension between the theoretical role of the truth predicate in semantics and its expressive function in language. The second theme of the volume concerns the interaction of truth with modal and doxastic notions. The third theme covers higher-order solutions (...) to the semantic and modal paradoxes, providing an alternative to first-order solutions embraced in the first two themes. This book will be of interest to researchers working in epistemology, logic, philosophy of logic, philosophy of language, philosophy of mathematics, and semantics. (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)

In this paper, I examine the deep theological faultline generated by divergent understandings of the divine attributes among two early antagonistic Muslim groups – the traditionalists (main...

A new computational methodology allowing one to work in a new way with infinities and infinitesimals is presented in this paper. The new approach, among other things, gives the possibility to calculate the number of elements of certain infinite sets, avoids indeterminate forms and various kinds of divergences. This methodology has been used by the author as a starting point in developing a new kind of computer – the Infinity Computer – able to execute computations and to store in its (...) memory not only finite numbers but also infinite and infinitesimal ones. (shrink)

A computational methodology called Grossone Infinity Computing introduced with the intention to allow one to work with infinities and infinitesimals numerically has been applied recently to a number of problems in numerical mathematics (optimization, numerical differentiation, numerical algorithms for solving ODEs, etc.). The possibility to use a specially developed computational device called the Infinity Computer (patented in USA and EU) for working with infinite and infinitesimal numbers numerically gives an additional advantage to this approach in comparison with traditional methodologies studying (...) infinities and infinitesimals only symbolically. The grossone methodology uses the Euclid’s Common Notion no. 5 ‘The whole is greater than the part’ and applies it to finite, infinite, and infinitesimal quantities and to finite and infinite sets and processes. It does not contradict Cantor’s and non-standard analysis views on infinity and can be considered as an applied development of their ideas. In this paper we consider infinite series and a particular attention is dedicated to divergent series with alternate signs. The Riemann series theorem states that conditionally convergent series can be rearranged in such a way that they either diverge or converge to an arbitrary real number. It is shown here that Riemann’s result is a consequence of the fact that symbol ∞ used traditionally does not allow us to express quantitatively the number of addends in the series, in other words, it just shows that the number of summands is infinite and does not allows us to count them. The usage of the grossone methodology allows us to see that (as it happens in the case where the number of addends is finite) rearrangements do not change the result for any sum with a fixed infinite number of summands. There are considered some traditional summation techniques such as Ramanujan summation producing results where to divergent series containing infinitely many positive integers negative results are assigned. It is shown that the careful counting of the number of addends in infinite series allows us to avoid this kind of results if grossone-based numerals are used. (shrink)

An important suggestion of objective Bayesians is that the maximum entropy principle can replace a principle which is known to get into paradoxical difficulties: the principle of indifference. No one has previously determined whether the maximum entropy principle is better able to solve Bertrand’s chord paradox than the principle of indifference. In this paper I show that it is not. Additionally, the course of the analysis brings to light a new paradox, a revenge paradox of the chords, that is unique (...) to the maximum entropy principle. (shrink)

Systems of illative logic are logical calculi formulated in the untyped λ-calculus supplemented with certain logical constants.1 In this short paper, I consider a paradox that arises in illative logic. I note two prima facie attractive ways of resolving the paradox. The first is well known to be consistent, and I briefly outline a now standard construction used by Scott and Aczel that establishes this. The second, however, has been thought to be inconsistent. I show that this isn’t so, by (...) providing a nonempty class of models that establishes its consistency. I then provide an illative logic which is sound and complete for this class of models. I close by briefly noting some attractive features of the second resolution of this paradox. (shrink)

In this paper, we axiomatize the deontic logic in Fusco 2015, which uses a Stalnaker-inspired account of diagonal acceptance and a two-dimensional account of disjunction to treat Ross’s Paradox and the Puzzle of Free Choice Permission. On this account, disjunction-involving validities are a priori rather than necessary. We show how to axiomatize two-dimensional disjunction so that the introduction/elimination rules for boolean disjunction can be viewed as one-dimensional projections of more general two-dimensional rules. These completeness results help make explicit the restrictions (...) Fusco’s account must place on free-choice inferences. They are also of independent interest, as they raise difficult questions about how to ‘lift’ a Kripke frame for a one- dimensional modal logic into two dimensions. (shrink)

It seems that the most common strategy to solve the liar paradox is to argue that liar sentences are meaningless and, consequently, truth-valueless. The other main option that has grown in recent years is the dialetheist view that treats liar sentences as meaningful, truth-apt and true. In this paper I will offer a new approach that does not belong in either camp. I hope to show that liar sentences can be interpreted as meaningful, truth-apt and false, but without engendering any (...) contradiction. This seemingly impossible task can be accomplished once the semantic structure of the liar sentence is unpacked by a quantified analysis. The paper will be divided in two sections. In the first section, I present the independent reasons that motivate the quantificational strategy and how it works in the liar sentence. In the second section, I explain how this quantificational analysis allows us to explain the truth teller sentence and a counter-example advanced against truthmaker maximalism, and deal with some potential objections. (shrink)

This paper explores the relationship borne by the traditional paradoxes of set theory and semantics to formal incompleteness phenomena. A central tool is the application of the Arithmetized Completeness Theorem to systems of second-order arithmetic and set theory in which various “paradoxical notions” for first-order languages can be formalized. I will first discuss the setting in which this result was originally presented by Hilbert & Bernays (1939) and also how it was later adapted by Kreisel (1950) and Wang (1955) in (...) order to obtain formal undecidability results. A generalization of this method will then be presented whereby Russell’s paradox, a variant of Mirimanoff’s paradox, the Liar, and the Grelling–Nelson paradox may be uniformly transformed into incompleteness theorems. Some additional observations are then framed relating these results to the unification of the set theoretic and semantic paradoxes, the intensionality of arithmetization (in the sense of Feferman, 1960), and axiomatic theories of truth. (shrink)

Aside from bioethics, the main theme of Ronald Green's lifework has been an exploration of the relation between religion and morality, with special emphasis on the philosophies of Immanuel Kant and Søren Kierkegaard. This essay summarizes and assesses his work on this theme by examining, in turn, four of his relevant books. Religious Reason (1978) introduced a new method of comparative religion based on Kant's model of a rational religion. Religion and Moral Reason (1988) expanded on this project, clarifying that (...) religious traditions cannot be reduced to their moral grounding. Kierkegaard and Kant: The Hidden Debt (1992) offered bold new evidence that Kant, not Hegel, was the philosopher whose ideas primarily shaped Kierkegaard's overtly religious philosophy ; both philosophers focused on the problem of how to understand the relation between moral reasoning and historical religion. And Kant and Kierkegaard on Time and Eternity (2011) republished ten essays that explore various aspects of this theme in greater depth. I argue that throughout these works Green defends a " paradox of inwardness " : principles or ideals that are by their nature essentially inward end up requiring outward manifestation in order to be confirmed or fully justified as real. (shrink)

I was invited to contribute this short piece to a book published in Russia, consisting of brief statements on the nature of morality written by approximately 90 scholars. Each essay is published in both English and Russian. My essay offers my considered answer to the question posed in the title, though in the end all contributions were published without titles.

An eternal society with the abilities of ordinary humans in each year of its existence would have had the ability to actualize a logical contradiction. This fact casts doubt on the metaphysical possibility of an infinite past. In addition to using this paradox in an argument against an infinite past, one can also use the paradox mutatis mutandis as a decisive argument against the sempiternality of God.

The strict-tolerant approach to paradox promises to erect theories of naïve truth and tolerant vagueness on the firm bedrock of classical logic. We assess the extent to which this claim is founded. Building on some results by Girard we show that the usual proof-theoretic formulation of propositional ST in terms of the classical sequent calculus without primitive Cut is incomplete with respect to ST-valid metainferences, and exhibit a complete calculus for the same class of metainferences. We also argue that the (...) latter calculus, far from coinciding with classical logic, is a close kin of Priest’s LP. (shrink)

This anthology contains revised versions of selected papers presented at the fourth bi-annual international deontic logic conference, DEON’98. This volume includes our substantial introduction, and an article from me as a contributor. The volume includes papers from all four distinguished invited speakers, David Makinson, Donald Nute, Claudio Pizzi, and the founder of deontic logic, Georg Von Wright. Other notables among the authors are Dov Gabbay (co-editor of the Handbook on Philosophical Logic vols.1-4, and editor of a number of logic book (...) series); Lars Lindahl (author of Position and Change: A Study in Law and Logic); Andrew Jones (past editor of the Norwegian Journal of Philosophical Logic, and the co-author of the entry “Deontic Logic and Contrary-to-Duties” in the 2nd edition of Handbook on Philosophical Logic); and Marek Sergot (a leading researcher at the interface of deontic logic and computer science.). (shrink)

Lewis’s [1968] counterpart theory (LCT for short), motivated by his modal realism, made its appearance within a year of Chisholm’s modal paradox [1967]. We are not modal realists, but we argue that a satisfactory resolution to the paradox calls for a counterpart-theoretic (CT-)semantics. We make our case by showing that the Chandler–Salmon strategy of denying the S4 axiom [◊◊ψ →◊ψ] is inadequate to resolve the paradox – we take on Salmon’s attempts to defend that strategy against objects from Lewis and (...) Williamson. We then consider three substantially different CT-approaches: Lewis’s LCT, Forbes’s (FCT), including his fuzzy version, and Ramachandran’s (RCT). We argue that the best approach is a mish-mash of FCT and RCT. (shrink)

The provability logic of a theory T captures the structural behavior of formalized provability in T as provable in T itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability logics. Where provability logics are the same for all moderately sound theories of some minimal strength, interpretability logics do show variations.The logic IL is defined as the collection of modal principles that are provable in any moderately sound theory of some minimal strength. In this article (...) we raise the previously known lower bound of IL by exhibiting two series of principles which are shown to be provable in any such theory. Moreover, we compute the collection of frame conditions for both series. (shrink)

The problem of hyperintensional contexts, and the problem of logical omniscience, shows the severe limitation of possible-worlds semantics which is employed also in standard epistemic logic. As a solution, we deploy here hyperintensional semantics according to which the meaning of an expression is an abstract structured algorithm, namely Tichý's construction. Constructions determine the denotata of expressions. Propositional attitudes are modelled as attitudes towards constructions of truth values. Such a model of belief is, of course, inferentially restrictive. We therefore also propose (...) a model of implicit knowledge, which is the collection of a possible agent's explicit beliefs which are related through a derivation system mastered by the agent. A derivation system consists of beliefs and derivation rules by means of which the agent may derive beliefs different from the beliefs she is actually related to. Conditions imposed on the set of base beliefs and the set of rules capture the limitations of the agent's deriving capabilities. (shrink)

The logic of paradox, LP, is a first-order, three-valued logic that has been advocated by Graham Priest as an appropriate way to represent the possibility of acceptable contradictory statements. Second-order LP is that logic augmented with quantification over predicates. As with classical second-order logic, there are different ways to give the semantic interpretation of sentences of the logic. The different ways give rise to different logical advantages and disadvantages, and we canvass several of these, concluding that it will be extremely (...) difficult to appeal to second-order LP for the purposes that its proponents advocate, until some deep, intricate, and hitherto unarticulated metaphysical advances are made. (shrink)

Sometimes it is worth using Tarski’s solution rather than merely mentioning it.

This double issue of the Carrollian, the journal of the Lewis Carroll Society, is entirely devoted to Lewis Carroll's famous short paper published in the journal Mind in 1895 under the title ‘What...

“Curry’s paradox”, as the term is used by philosophers today, refers to a wide variety of paradoxes of self-reference or circularity that trace their modern ancestry to Curry (1942b) and Löb (1955). The common characteristic of these so-called Curry paradoxes is the way they exploit a notion of implication, entailment or consequence, either in the form of a connective or in the form of a predicate. Curry’s paradox arises in a number of different domains. Like Russell’s paradox, it can take (...) the form of a paradox of set theory or the theory of properties. But it can also take the form of a semantic paradox, closely akin to the Liar paradox. Curry’s paradox differs from both Russell’s paradox and the Liar paradox in that it doesn’t essentially involve the notion of negation. Common truth-theoretic versions involve a sentence that says of itself that if it is true then an arbitrarily chosen claim is true, or—to use a more sinister instance—says of itself that if it is true then every falsity is true. The paradox is that the existence of such a sentence appears to imply the truth of the arbitrarily chosen claim, or—in the more sinister instance—of every falsity. In this entry, we show how the various Curry paradoxes can be constructed, examine the space of available solutions, and explain some ways Curry’s paradox is significant and poses distinctive challenges. (shrink)

The truth-functional hypothesis states that indicative conditional sentences and the material implication have the same truth conditions. Haze (2011) has rejected this hypothesis. He claims that a self-referential conditional, coupled with a plausible assumption about its truth-values and the assumption that the truth-functional hypothesis is true, lead to a liar’s paradox. Given that neither the self-referential conditional nor the assumption about its truth-values are problematic, the culprit of the paradox must be the truth-functional hypothesis. Therefore, we should reject it. In (...) this paper I argue that, contrary to what Haze thinks, the truth-functional hypothesis is not to blame. In fact, no liar’s paradox emerges when the truth-functional hypothesis is true; it emerges only if it is false. (shrink)

Any theory of truth must find a way around Curry’s paradox, and there are well-known ways to do so. This paper concerns an apparently analogous paradox, about validity rather than truth, which JC Beall and Julien Murzi call the v-Curry. They argue that there are reasons to want a common solution to it and the standard Curry paradox, and that this rules out the solutions to the latter offered by most “naive truth theorists.” To this end they recommend a radical (...) solution to both paradoxes, involving a substructural logic, in particular, one without structural contraction. In this paper I argue that substructuralism is unnecessary. Diagnosing the “v-Curry” is complicated because of a multiplicity of readings of the principles it relies on. But these principles are not analogous to the principles of naive truth, and taken together, there is no reading of them that should have much appeal to anyone who has absorbed the morals of both the ordinary Curry paradox and the second incompleteness theorem. (shrink)

Cantor’s proof that the powerset of the set of all natural numbers is uncountable yields a version of Richard’s paradox when restricted to the full definable universe, that is, to the universe containing all objects that can be defined not just in one formal language but by means of the full expressive power of natural language: this universe seems to be countable on one account and uncountable on another. We argue that the claim that definitional contexts impose restrictions on the (...) scope of quantifiers reveals a natural way out. (shrink)

Este trabajo ofrece una lectura de la Paradoja de Moore que pone énfasis en su relevancia para nuestra comprensión de la racionalidad y de la interpretación lingüística. Mantiene que las oraciones que dan origen a la paradoja no necesitan entenderse en términos de ausencia de una contradicción, sino más bien en términos de ausencia de racionalidad, entendida esta como un término más amplio que el de coherencia y consistencia lógica. Se defenderá tal posición por medio de tres tesis, dos de (...) las cuales se derivan de los enfoques dominantes (aunque insuficientes) a la paradoja: el de Moore, el de Wittgenstein y el de Shoemaker || This paper offers an interpretation of Moore's Paradox that emphasizes its relevance for our understanding of rationality and linguistic interpretation. The sentences that originate the paradox do not need to be thought of in terms of the absence of a contradiction, but in terms of absence of rationality, where rationality is understood as a broader notion than coherence and logical consistency. This is defended through three theses, two of which stem from the dominant (but insufficient) approaches to the paradox: Moore's, Wittgenstein's and Shoemaker's. (shrink)

This paper aims to call into question the customary division of logically revisionary responses to the truth-theoretic paradoxes into those that are “substructural” and those that are “ structural.” I proceed by examining, as a case study, Beall’s recent proposal based on the paraconsistent logic LP. Beall formulates his response to paradox in terms of a consequence relation that obeys all standard structural rules, though at the price of the language’s lacking a detaching conditional. I argue that the same response (...) to paradox can be given using a consequence relation that preserves detachment rules for a conditional, though at the price of restricting structural rules. The question “Is paradox being blocked by invoking a substructural consequence relation?” is thus ill-posed. The lesson of this example, I conclude, is that there is no useful explication of the idea of a substructural approach to paradox. (shrink)