This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...) and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter 2 argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic epistemic two-dimensional hyperintensional semantics. Chapter 3 provides an abstraction principle for epistemic (hyper-)intensions. Chapter 4 advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter 5 applies the fixed points of the modal μ-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal μ-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal μ-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter 6 advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter 7 provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters 2 and 4 are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters 8-12 provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter 8 examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of Ω-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter 9 examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter 10 examines the philosophical significance of hyperintensional Ω-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter 11 provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter 12 avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between the interpretational and objective modalities and truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals while bypassing the category of Set in category theory. Chapter 13 examines modal responses to the alethic paradoxes. Chapter 14 examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

This volume includes a target paper, taking up the challenge to revive, within a modern (formal) framework, a medieval solution to the Liar Paradox which did ...

This essay aims to redress the contention that epistemic possibility cannot be a guide to the principles of modal metaphysics. I introduce a novel epistemic two-dimensional truthmaker semantics. I argue that the interaction between the two-dimensional framework and the mereological parthood relation, which is super-rigid, enables epistemic possibilities and truthmakers with regard to parthood to be a guide to its metaphysical profile. I specify, further, a two-dimensional formula encoding the relation between the epistemic possibility and verification of essential properties obtaining (...) and their metaphysical possibility or verification. I then generalize the approach to haecceitistic properties, and examine the Julius Caesar problem as a test case. (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 favor 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)

Benardete paradoxes involve a beginningless set each member of which satisfies some predicate just in case no earlier member satisfies it. Such paradoxes have been wielded on behalf of arguments for the impossibility of an infinite past. These arguments often deploy patchwork principles in support of their key linking premise. Here I argue that patchwork principles fail to justify this key premise.

Higher-order logic, with its type-theoretic apparatus known as the simple theory of types (STT), has increasingly come to be employed in theorizing about properties, relations, and states of affairs—or ‘intensional entities’ for short. This paper argues against this employment of STT and offers an alternative: ordinal type theory (OTT). Very roughly, STT and OTT can be regarded as complementary simplifications of the ‘ramified theory of types’ outlined in the Introduction to Principia Mathematica (on a realist reading). While STT, understood as (...) a theory of intensional entities, retains the Fregean division of properties and relations into a multiplicity of categories according to their adicities and ‘input types’ and discards the division of intensional entities into different ‘orders’, OTT takes the opposite approach: it retains the hierarchy of orders (though with some modifications) and discards the categorisation of properties and relations according to their adicities and input types. In contrast to STT, this latter approach avoids intensional counterparts of the Epimenides and related paradoxes. Fundamental intensional entities lie at the base of the proposed hierarchy and are also given a prominent part to play in the individuation of non-fundamental intensional entities. (shrink)

Special issue in honour of Landon Rabern. This special issue of Discrete Mathematics is dedicated to his memory, as a tribute to his many research achievements. It contains 10 new articles written by his collaborators, friends, and colleagues that showcase his interests.

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)

The No-No Paradox consists of a pair of statements, each of which ?says? the other is false. Roy Sorensen claims that the No-No Paradox provides an example of a true statement that has no truthmaker: Given the relevant instances of the T-schema, one of the two statements comprising the ?paradox? must be true (and the other false), but symmetry constraints prevent us from determining which, and thus prevent there being a truthmaker grounding the relevant assignment of truth values. Sorensen's view (...) is mistaken: situated within an appropriate background theory of truth, the statements comprising the No-No Paradox are genuinely paradoxical in the same sense as is the Liar (and thus, on Sorensen's view, must fail to have truth values). This result has consequences beyond Sorensen's semantic framework. In particular, the No-No Paradox, properly understood, is not only a new paradox, but also provides us with a new type of paradox, one which depends upon a general background theory of the truth predicate in a way that the Liar Paradox and similar constructions do not. (shrink)

The aim of this paper is to provide a minimalist axiomatic theory of truth based on the notion of reference. To do this, we first give sound and arithmetically simple notions of reference, self-reference, and well-foundedness for the language of first-order arithmetic extended with a truth predicate; a task that has been so far elusive in the literature. Then, we use the new notions to restrict the T-schema to sentences that exhibit "safe" reference patterns, confirming the widely accepted but never (...) worked out idea that paradoxes can be characterised in terms of their underlying reference patterns. This results in a strong, ω-consistent, and well-motivated system of disquotational truth, as required by minimalism. (shrink)

The paper provides an alternative interpretation of ‘pair points’, discussed in Beall et al., "On the ternary relation and conditionality", J. of Philosophical Logic 41(3), 595-612. Pair points are seen as points viewed from two different ‘perspectives’ and the latter are explicated in terms of two independent valuations. The interpretation is developed into a semantics using pairs of Kripke models (‘pair models’). It is demonstrated that, if certain conditions are fulfilled, pair models are validity-preserving copies of positive substructural models. This (...) yields a general soundness and completeness result for a variety of (positive) substructural logics with respect to multimodal Kripke frames with binary accessibility relations. In addition, an epistemic interpretation of pair models is provided. (shrink)

In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...) of our PIF account of truth-talk, we demonstrate a few advantages it offers over T-deflationist accounts that do not explicitly acknowledge pretense at work in the discourse. In turning to the Liar Paradox, we explain how the quasi-anaphoric functioning that our account attributes to truth-talk provides a diagnosis of the Liar Paradox (and other instances of semantic pathology) as having no content—in the sense of not specifying any of what we call M-conditions. At the same time, however, we vindicate the intuition that we can understand liar sentences, thereby avoiding one standard objection to “meaningless strategy” responses to the Liar Paradox. With this diagnosis in place, we then, by way of treatment, introduce a new predicate, ‘semantically defective’, and show how the explanation we give for its application allows for a consistent, yet revenge-immune, (dis)solution of the Liar Paradox, and semantic pathology generally. (shrink)

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)

In 1964 José Benardete invented the “New Zeno Paradox” about an infinity of gods trying to prevent a traveller from reaching his destination. In this paper it is argued, contra Priest and Yablo, that the paradox must be resolved by rejecting the possibility of actual infinity. Further, it is shown that this paradox has the same logical form as Yablo’s Paradox. It is suggested that constructivism can serve as the basis of a common solution to New Zeno and the paradoxes (...) of truth, and a constructivist interpretation of Kripke’s theory of truth is given. (shrink)

We use two logical resources, namely, the notion of recursively defined function and the Benardete-Yablo paradox, together with some inherent features of causality and time, as usually conceived, to derive two results: that no ungrounded causal chain exists and that time has a beginning.

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under the interpretation. (...) The second yields a strong, finitary, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically computable Tarskian truth values to the formulas of PA under the interpretation. We situate our investigation within a broad analysis of quantification vis a vis: * Hilbert's epsilon-calculus * Goedel's omega-consistency * The Law of the Excluded Middle * Hilbert's omega-Rule * An Algorithmic omega-Rule * Gentzen's Rule of Infinite Induction * Rosser's Rule C * Markov's Principle * The Church-Turing Thesis * Aristotle's particularisation * Wittgenstein's perspective of constructive mathematics * An evidence-based perspective of quantification. By showing how these are formally inter-related, we highlight the fragility of both the persisting, theistic, classical/Platonic interpretation of quantification grounded in Hilbert's epsilon-calculus; and the persisting, atheistic, constructive/Intuitionistic interpretation of quantification rooted in Brouwer's belief that the Law of the Excluded Middle is non-finitary. We then consider some consequences for mathematics, mathematics education, philosophy, and the natural sciences, of an agnostic, evidence-based, finitary interpretation of quantification that challenges classical paradigms in all these disciplines. (shrink)

The book provides a historical and systematic exposition of the semantic theory of truth formulated by Alfred Tarski in the 1930s. This theory became famous very soon and inspired logicians and philosophers. It has two different, but interconnected aspects: formal-logical and philosophical. The book deals with both, but it is intended mostly as a philosophical monograph. It explains Tarski’s motivation and presents discussions about his ideas as well as points out various applications of the semantic theory of truth to philosophical (...) problems. (shrink)

A common argument in support of a beginning of the universe used by advocates of the kalām cosmological argument (KCA) is the argument against the possibility of an actual infinite, or the “Infinity Argument”. However, it turns out that the Infinity Argument loses some of its force when compared with the achievements of set theory and it brings into question the view that God predetermined an endless future. We therefore defend a new formal argument, based on the nature of time (...) (just as geometrical reasoning is based on the nature of space), which addresses more directly the question of beginningless time. (shrink)

This dissertation concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The dissertation demonstrates how phenomenal consciousness and gradational possible-worlds models in Bayesian perceptual psychology relate to epistemic modal space. The dissertation demonstrates, then, how epistemic modality relates to the computational theory of mind; metaphysical modality; deontic modality; logical modality; the types of mathematical modality; to the (...) epistemic status of undecidable propositions and abstraction principles in the philosophy of mathematics; to the apriori-aposteriori distinction; to the modal profile of rational propositional intuition; and to the types of intention, when the latter is interpreted as a modal mental state. Examining the nature of epistemic logic itself, I develop a novel approach to conditions of self-knowledge in the setting of the modal μ-calculus, as well as novel epistemicist solutions to Curry's, the liar, and the knowability paradoxes. Solutions to previously intransigent issues concerning the first-person concept; the distinction between fundamental and derivative truths; and the unity of intention and its role in decision theory, are developed along the way. (shrink)

The notion of a proposition is central to philosophy. But it is subject to paradoxes. A natural response is a hierarchical account and, ever since Russell proposed his theory of types in 1908, this has been the strategy of choice. But in this paper I raise a problem for such accounts. While this does not seem to have been recognized before, it would seem to render existing such accounts inadequate. The main purpose of the paper, however, is to provide a (...) new hierarchical account that solves the problem. (shrink)

The aim of the paper is to argue that all—or almost all—logical rules have exceptions. In particular, it is argued that this is a moral that we should draw from the semantic paradoxes. The idea that we should respond to the paradoxes by revising logic in some way is familiar. But previous proposals advocate the replacement of classical logic with some alternative logic. That is, some alternative system of rules, where it is taken for granted that these hold without exception. (...) The present proposal is quite different. According to this, there is no such alternative logic. Rather, classical logic retains the status of the ‘one true logic’, but this status must be reconceived so as to be compatible with (almost) all of its rules admitting of exceptions. This would seem to have significant repercussions for a range of widely held views about logic: e.g. that it is a priori, or that it is necessary. Indeed, if the arguments of the paper succeed, then such views must be given up. (shrink)

We introduce a variant of pointer structures with denotational semantics and show its equivalence to systems of boolean equations: both have the same solutions. Taking paradoxes to be statements represented by systems of equations (or pointer structures) having no solutions, we thus obtain two alternative means of deciding paradoxical character of statements, one of which is the standard theory of solving boolean equations. To analyze more adequately statements involving semantic predicates, we extend propositional logic with the assertion operator and give (...) its complete axiomatization. This logic is a sub-logic of statements in which the semantic predicates become internalized (for instance, counterparts of Tarski’s definitions and T-schemata become tautologies). Examples of analysis of self-referential paradoxes are given and the approach is compared to the alternative ones. (shrink)

A paradox is usually described as an apparently false statement supported by an apparently good argument which departs from premises that most people would find trivially true. This survey article presents a brief overview of three different contemporary perspectives on paradoxes. According to the epistemic view, paradoxes play a crucial role in the progress of science and cannot be regarded as sound proofs of a false statement. According to the dialetheist view, the conclusion of some paradoxical reasonings is both, true (...) and false, what means that there must be some true contradictions. Finally, the mystic view understands recalcitrant paradoxes as unsolvable problems which show the limits of human thought and cognition. The last section of this paper focuses on the paradoxes of self-reference, a family of paradoxes which have had a deep impact in the development of science during the twentieth century. Keywords: paradox, veridic paradox, falsidic paradox, antinomy, dialetheism, selfreference, circularity, inclosure schema. (shrink)

We identify a class of paradoxes that is neither set-theoretical nor semantical, but that seems to depend on intensionality. In particular, these paradoxes arise out of plausible properties of propositional attitudes and their objects. We try to explain why logicians have neglected these paradoxes, and to show that, like the Russell Paradox and the direct discourse Liar Paradox, these intensional paradoxes are recalcitrant and challenge logical analysis. Indeed, when we take these paradoxes seriously, we may need to rethink the commonly (...) accepted methods for dealing with the logical paradoxes. (shrink)

Propositions are central to at least most theorizing about the connection between our mental lives and the world: we use them in our theories of an array of attitudes including belief, desire, hope, fear, knowledge, and understanding. Unfortunately, when we press on these theories, we encounter a relatively neglected family of paradoxes first studied by Arthur Prior. I argue that these paradoxes present a fatal problem for most familiar resolutions of paradoxes. In particular, I argue that truth-value gap, contextualist, situation (...) theoretic, revision theoretic, ramified, and dialetheist approaches to the paradoxes must deny us the conceptual resources that they themselves make use of, on pain of contradiction. I then detail the costs of the extant strategies that avoid this issue: Hartry Field’s paracomplete approach; Andrew Bacon’s classical treatment of indeterminacy; a generalization of ideas from Prior, Nicholas J.J. Smith, and Hartley Slater; and free logics as recently explored by Bacon, John Hawthorne, and Gabriel Uzquiano. I argue that none of these is perfect, and that each restricts the theories we can endorse in a variety of areas of philosophy. I spell these restrictions out, showing, I hope, that the further investigation of these paradoxes must be a part of future research on propositional attitudes. (shrink)

This is a reply to the considerations advanced by Schroeder-Heister and Tranchini as prima facie problematic for the proof-theoretic criterion of paradoxicality, as originally presented in Tennant and subsequently amended in Tennant. Countering these considerations lends new importance to the parallelized forms of elimination rules in natural deduction.

I propose an anti-realist account of truth and paradox according to which the logico-semantic paradoxes are not genuine inconsistencies. The ‘global’ proofs of absurdity associated with these paradoxes cannot be brought into normal form. The account combines epistemicism about truth with a proof-theoretic diagnosis of paradoxicality. The aim is to combine a substantive philosophical account of truth with a more rigorous and technical diagnosis of the source of paradox for further consideration by logicians. Core Logic plays a central role in (...) the account on offer. It is shown that the account is not prey to the problem of revenge paradox. (shrink)

Cook (forthcoming) presents a paradox which he says is not circular. I see no reasons to doubt the non-circularity claim, but I do have some concerns regarding its paradoxicality. My point will be that his proposal succeeds in offering a formalization, but fails in providing a formal paradox, at least of the same type and strength as the Liar. Cook (en prensa) presenta una paradoja que según él no es circular. No veo motivos para cuestionar la pretensión de no circularidad, (...) pero sí me resulta algo problemática la cuestión de su paradojicidad. El punto que intentaré defender será que la propuesta de Cook es exitosa en ofrecer una formalización, pero fracasa en proveer una paradoja formal, al menos del mismo tipo y fuerza que el mentiroso. (shrink)

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 traditional equating of the a priori and the necessary was challenged by Kripke, who indicated the possibility of a priori knowledge of contingently true sentences, as well as a posteriori knowledge of necessarily true sentences. This note discusses a new species of sentences with such properties. One example of this is (1) This sentence is necessarily false which appears to be a contingently false sentence, known a priori, although it is hard to see when it might be true. Further (...) examples are considered, and it is argued that the notions of being known a priori and aposteriori should be examined further, along with the notions of necessary and contingent truths. (shrink)

The ?no???no? paradox (so-called by Sorensen) consists of a pair of propositions each of which says of the other that it is false. It is not immediately paradoxical, since it has a solution in which one proposition is true, the other false. However, that is itself paradoxical, since there is no clear ground for determining which is which. The two propositions should have the same truth-value. The paper shows how a proposal by the medieval thinker Thomas Bradwardine solves not only (...) the Liar paradox, but also symmetric paradoxes like the ?no???no?, the descending ?no???no?, and the Truth-teller paradoxes. (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)

In this paper I present two new paradoxes, a definability paradox (related to the paradoxes of Berry, Richard and König), and a paradox about extensions (related to Russell’s paradox). However, unlike the familiar definability paradoxes and Russell’s paradox, these new paradoxes involve no self-reference or circularity.

In this paper I present a novel supertask in a Newtonian universe that destroys and creates infinite masses and energies, showing thereby that we can have infinite indeterminism. Previous supertasks have managed only to destroy or create finite masses and energies, thereby giving cases of only finite indeterminism. In the Nothing from Infinity paradox we will see an infinitude of finite masses and an infinitude of energy disappear entirely, and do so despite the conservation of energy in all collisions. I (...) then show how this leads to the Infinity from Nothing paradox, in which we have the spontaneous eruption of infinite mass and energy out of nothing. I conclude by showing how our supertask models at least something of an old conundrum, the question of what happens when the immovable object meets the irresistible force. (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)

We provide a systematic recipe for eliminating self-reference from a simple language in which semantic paradoxes (whether purely logical or empirical) can be expressed. We start from a non-quantificational language L which contains a truth predicate and sentence names, and we associate to each sentence F of L an infinite series of translations h 0(F), h 1(F), ..., stated in a quantificational language L *. Under certain conditions, we show that none of the translations is self-referential, but that any one (...) of them perfectly mirrors the semantic behavior of the original. The result, which can be seen as a generalization of recent work by Yablo (1993, Analysis, 53, 251–252; 2004, Self-reference, CSLI) and Cook (2004, Journal of Symbolic Logic, 69(3), 767–774), shows that under certain conditions self-reference is not essential to any of the semantic phenomena that can be obtained in a simple language. (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.

Interesting as they are by themselves in philosophy and mathematics, paradoxes can be made even more fascinating when turned into proofs and theorems. For example, Russell’s paradox, which overthrew Frege’s logical edifice, is now a classical theorem in set theory, to the effect that no set contains all sets. Paradoxes can be used in proofs of some other theorems—thus Liar’s paradox has been used in the classical proof of Tarski’s theorem on the undefinability of truth in sufficiently rich languages. This (...) paradox (as well as Richard’s paradox) appears implicitly in Gödel’s proof of his celebrated first incompleteness theorem. In this paper, we study Yablo’s paradox from the viewpoint of first- and second-order logics. We prove that a formalization of Yablo’s paradox (which is second order in nature) is non-first-orderizable in the sense of George Boolos (1984). (shrink)

Should we explicate truth in terms of meaning, or meaning in terms of truth? Ramsey, Prior and Strawson all favoured the former approach: a statement is true if and only if things are as the speaker, in making the statement, states them to be; similarly, a belief is true if and only if things are as a thinker with that belief thereby believes them to be. I defend this explication of truth against a range of objections.Ramsey formalized this account of (...) truth as follows: B is true =df ∃P; in §i, I defend this formula against the late Peter Geach's objection that its right‐hand side is ill‐formed. Davidson held that Ramsey and co. had the whole matter back to front: on his view, we should explicate meaning in terms of truth, not vice versa. In §ii, I argue that Ramsey's approach opens the way to a more promising approach to semantic theorizing than Davidson's. Ramsey presents his formula as a definition of truth, apparently contradicting Tarski's theorem that truth is indefinable. In §iii, I show that the contradiction is only apparent: Tarski assumes that the Liar‐like inscription he uses to prove his theorem has a content, but Ramsey can and should reject that assumption. As I explain in §iv, versions of the Liar Paradox may be generated without making any assumptions about truth: paradox arises when the impredicativity that is found when a statement's content depends on the contents of a collection of statements to which it belongs turns pathological. Since they do not succeed in saying anything, such pathological utterances or inscriptions pose no threat to the laws of logic, when these are understood as universal principles about the ways things may be said or thought to be. There is, though, a call for rules by following which we can be sure that any conclusion deduced from true premisses is true, and hence says something. Such rules cannot be purely formal, but in §v I propose a system of them: this opens the way to the construction of deductive theories even in circumstances where producing a well‐formed formula is no guarantee of saying anything. (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)

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.

In his Quadratura, Paul of Venice considers a sophism involving time and tense which appears to show that there is a valid inference which is also invalid. Consider this inference concerning some proposition A : A will signify only that everything true will be false, so A will be false. Call this inference B. A and B are the basis of an insoluble-that is, a Liar-like paradox. Like the sequence of statements in Yablo's paradox, B looks ahead to a moment (...) when A will be false, yet that moment may never come. In the Quadratura, Paul follows the solution to insolubles found in the collection of elementary treatises known as the Logica Oxoniensis, which posits an implicit assertion of its own truth in insolubles like B. However, in the treatise on insolubles in his Logica Magna, Paul develops and endorses a different solution that takes insolubles at face value. We consider how both types of solution apply to A and B : on both, B is valid. But on one, B has true premises and false conclusion, and contradictories can be false together; on the other (following the Logica Oxoniensis), the counterexample is rejected. (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)