We develop a functional abstraction principle for the type-free algorithmic logic introduced in our earlier work. Our approach is based on the standard combinators but is supplemented by the novel use of evaluation trees. Then we show that the abstraction principle leads to a Curry fixed point, a statement C that asserts C ⇒ A where A is any given statement. When A is false, such a C yields a paradoxical situation. As discussed in our earlier work, this situation leaves (...) one no choice but to restrict the use of a certain class of implicational rules including modus ponens. (shrink)

There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. (...) As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally. (shrink)

There are theoretical limitations to what can be implemented by a computer program. In this paper we are concerned with a limitation on the strength of computer implemented deduction. We use a version of the Curry paradox to arrive at this limitation.

We propose contractionless constructive logic which is obtained from Nelson's constructive logic by deleting contractions. We discuss the consistency of a naive set theory based on the proposed logic in relation to Curry's paradox. The philosophical significance of contractionless constructive logic is also argued in comparison with Fitch's and Prawitz's systems.

I consider two puzzles in which an agent undergoes a sequence of decision problems. In both cases it is possible to respond rationally to any given problem yet it is impossible to respond rationally to every problem in the sequence, even though the choices are independent. In particular, although it might be a requirement of rationality that one must respond in a certain way at each point in the sequence, it seems it cannot be a requirement to respond as such (...) at every point for that would be to require the impossible. (shrink)

There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. (...) As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally. (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)

The Lowenheim-Skolem theorems say that if a first-order theory has infinite models, then it has models which are only countably infinite. Cantor's theorem says that some sets are uncountable. Together, these two theorems induce a puzzle known as Skolem's Paradox: the very axioms of (first-order) set theory which prove the existence of uncountable sets can themselves be satisfied by a merely countable model.

Skolem's Paradox involves a seeming conflict between two theorems from classical logic. The Löwenheim Skolem theorem says that if a first order theory has infinite models, then it has models whose domains are only countable. Cantor's theorem says that some sets are uncountable. Skolem's Paradox arises when we notice that the basic principles of Cantorian set theory—i.e., the very principles used to prove Cantor's theorem on the existence of uncountable sets—can themselves be formulated as a collection of first order sentences. (...) How can the very principles which prove the existence of uncountable sets be satisfied by a model which is itself only countable? How can a countable model satisfy the first order sentence which says that there are uncountably many mathematical objects—e.g., uncountably many real numbers? (shrink)

Over the years, Skolem’s Paradox has generated a fairly steady stream of philosophical discussion; nonetheless, the overwhelming consensus among philosophers and logicians is that the paradox doesn’t constitute a mathematical problem (i.e., it doesn’t constitute a real contradiction). Further, there’s general agreement as to why the paradox doesn’t constitute a mathematical problem. By looking at the way firstorder structures interpret quantifiers—and, in particular, by looking at how this interpretation changes as we move from structure to structure—we can give a technically (...) adequate “solution” to Skolem’s Paradox. So, whatever the philosophical upshot of Skolem’s Paradox may be, the mathematical side of Skolem’s Paradox seems to be relatively straightforward. (shrink)

There is a principle in things, about which we cannot be deceived, but must always, on the contrary, recognize the truth – viz. that the same thing cannot at one and the same time be and not be": with these words of the Metaphysics, Aristotle introduced the Law of Non-Contradiction, which was to become the most authoritative principle in the history of Western thought. However, things have recently changed, and nowadays various philosophers, called dialetheists, claim that this Law does not (...) hold unrestrictedly – that in peculiar circumstances the same thing may at the same time be and not be, and contradictions may obtain in the world. This book opens with an examination of the famous logical paradoxes that appear to speak on behalf of contradictions (e.g., the Liar paradox, the set-theoretic paradoxes such as Cantor’s and Russell’s), and of the reasons for the failure of the standard attempts to solve them. It provides, then, an introduction to paraconsistent logics – non-classical logics in which the admission of contradictions does not lead to logical chaos –, and their astonishing applications, going from inconsistent data base management to contradictory arithmetics capable of circumventing Gödel’s celebrated Incompleteness Theorem. The final part of the book discusses the philosophical motivations and difficulties of dialetheism, and shows how to extract from Aristotle’s ancient words a possible reply to the dialetheic challenge. How to Sell a Contradiction will appeal to anyone interested in non-classical logics, analytic metaphysics, and philosophy of mathematics, and especially to those who consider challenging our most entrenched beliefs the main duty of philosophical inquiry. (shrink)

A solution to the paradoxes has two sides: the philosophical and the technical. The paradoxes are, first and foremost, a philosophical problem. A philosophical solution must pinpoint the exact step where the reasoning that leads to contradiction is fallacious, and then explain why it is so.

Consider the following denumerably infinite sequence of sentences: (s1) For all k > 1, sk is not true. (s2) For all k > 2, sk is not true. (s3) For all k > 3, sk is not true.

In his Paradoxes (1995: Cambridge University Press: 149) Mark Sainsbury presents the following pair of sentences: Line 1: The sentence written on Line 1 is nonsense. Line 2: The sentence written on Line 1 is nonsense. Sainsbury (1995: 149, 154) here makes three assertions: (1) The sentence in Line 1 is so viciously self-referential that it falls into the truth-value gap. The sentence is really nonsense. (2) The sentence in Line 2 is by contrast true. For it states precisely that (...) the sentence in Line 1 is nonsense. (3) The two sentences in Lines 1 and 2 are an example of the principle that two sentence tokens of the same sentence-type can have different truth-values, although they have the same reference and state the same property of the object of reference. In this paper, I argue that Sainsbury’s assumptions are false in all three cases. (shrink)

The paradox of knowability and the debate about it are shortly presented. Some assumptions which appear more or less tacitly involved in its discussion are made explicit. They are embedded and integrated in a Russellian framework, where a formal paradox, very similar to the Russell-Myhill paradox, is derived. Its solution is provided within a Russellian formal logic introduced by A. Church. It follows that knowledge should be typed. Some relevant aspects of the typing of knowledge are pointed out.

Consider the following sentences: The neighbouring sentence is not true. The neighbouring sentence is not true. Call these the no-no sentences. Symmetry considerations dictate that the no-no sentences must both possess the same truth-value. Suppose they are both true. Given Tarski’s truth-schema—if a sentence S says that p then S is true iff p—and given what they say, they are both not true. Contradiction! Conclude: they are not both true. Suppose they are both false. Given Tarski’s falsity-schema—if a sentence S (...) says that p then S is false iff not-p—and given what they say, they are both true, and so not false. Contradiction! Conclude: they are not both false. Thus, despite their symmetry, the no-no sentences must differ in truth-value. Such is the no-no paradox.[1] Sorensen (2001, 2005a, 2005b) has argued that: (1) The no-no paradox is not a version of the liar but rather a cousin of the truth-teller paradox. (2) Even so, the no-no paradox is more paradoxical than the truth-teller. (3) The no-no and truth-teller sentences have groundless truthvalues—they are bivalent but give rise to “truthmaker gaps”. (4) It is metaphysically impossible to know these truth-values. (5) A truthmaker gap response to the no-no paradox provides reason to accept a version of epistemicism. In this paper it is shown that a truthmaker gap solution to the no-no and truth-teller paradoxes runs afoul of the dunno-dunno paradox, the strengthened no-no paradox, and the strengthened truth-teller paradox. In consequence, the no-no paradox is best seen as a form of the liar paradox. As such, it cannot provide a case for epistemicism. (shrink)

A new solution to the liar paradox is developed using the insight that it is illegitimate to even suppose (let alone assert) that a liar sentence has a truth-status (true or not) on the grounds that supposing this sentence to be true/not-true essentially defeats the telos of supposition in a readily identifiable way. On that basis, the paradox is blocked by restricting the Rule of Assumptions in Gentzen-style presentations of the sequent-calculus. The lesson of the liar is that not all (...) assumptions are for free. One merit of this proposal is that it is free from the revenge problem. (shrink)

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)

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)

In studying the early history of mathematical logic and set theory one typically reads that Georg Cantor discovered the so-called Burali-Forti (BF) paradox sometime in 1895, and that he offered his solution to it in his famous 1899 letter to Dedekind. This account, however, leaves it something of a mystery why Cantor never discussed the paradox in his writings. Far from regarding the foundations of set theory to be shaken, he showed no apparent concern over the paradox and its implications (...) whatever. Against this account, I will argue here that in fact Cantor never saw any paradox at all, but that his conception of set at that time, and already as far back as 1883, was one in which the paradoxes cannot arise. (shrink)

The expression conditional fallacy identifies a family of arguments deemed to entail odd and false consequences for notions defined in terms of counterfactuals. The antirealist notion of truth is typically defined in terms of what a rational enquirer or a community of rational enquirers would believe if they were suitably informed. This notion is deemed to entail, via the conditional fallacy, odd and false propositions, for example that the Peircean end of inquiry has been reached or that there is necessarily (...) a rational enquirer. If these consequences followed from the antirealist notion of truth, alethic antirealism should probably be rejected. In this paper we analyse the conditional fallacy from a semantic (i.e. model-theoretic) point of view. This allows us to identify with precision the philosophical commitments that ground the validity of this type of arguments. We show that the conditional fallacy arguments against alethic antirealism are valid only if controversial metaphysical assumptions are accepted. We suggest that the antirealist is not committed to the conditional fallacy because she is not committed to some of these assumptions. (shrink)

Jerónimo Pardo's analysis of the problems raised by some popular trinitarian paralogisms is studied in this paper. The purpose is to show how the notions employed by the theologians in order to solve theological problems were introduced into a textbook on logic to deal with some genuinely logical problems. First, the problem, common to all logical approaches, of achieving a fine-grained analysis of the logical form of syllogistical inferences. Second, the problem, typical of the terminist approach to logic, of guaranteeing (...) that Latin is an adequate vehicle for logical analysis. (shrink)

Hartry Field's revised logic for the theory of truth in his new book, Saving Truth from Paradox , seeking to preserve Tarski's T-scheme, does not admit a full theory of negation. In response, Crispin Wright proposed that the negation of a proposition is the proposition saying that some proposition inconsistent with the first is true. For this to work, we have to show that this proposition is entailed by any proposition incompatible with the first, that is, that it is the (...) weakest proposition incompatible with the proposition whose negation it should be. To show that his proposal gave a full intuitionist theory of negation, Wright appealed to two principles, about incompatibility and entailment, and using them Field formulated a paradox of validity (or more precisely, of inconsistency). The medieval mathematician, theologian and logician, Thomas Bradwardine, writing in the fourteenth century, proposed a solution to the paradoxes of truth which does not require any revision of logic. The key principle behind Bradwardine's solution is a pluralist doctrine of meaning, or signification, that propositions can mean more than they explicitly say. In particular, he proposed that signification is closed under entailment. In light of this, Bradwardine revised the truth-rules, in particular, refining the T-scheme, so that a proposition is true only if everything that it signifies obtains. Thereby, he was able to show that any proposition which signifies that it itself is false, also signifies that it is true, and consequently is false and not true. I show that Bradwardine's solution is also able to deal with Field's paradox and others of a similar nature. Hence Field's logical revisions are unnecessary to save truth from paradox. (shrink)

It is argued that Convention T and Basic Law V of Frege’s Grungesetze share three striking similarities. First, they are universal generalizations that are intuitively plausible because they have so many obvious instances. Second, both are false because they yield contradictions. Third, neither gives rise to a paradox.

Graham Priest (1994) has argued that the following paradoxes all have the same structure: Russell’s Paradox, Burali-Forti’s Paradox, Mirimanoff’s Paradox, König’s Paradox, Berry’s Paradox, Richard’s Paradox, the Liar and Liar Chain Paradoxes, the Knower and Knower Chain Paradoxes, and the Heterological Paradox. Their common structure is given by Russell’s Schema: there is a property φ and function δ such that..

In a recent article, Emil Badici contends that the inclosure schema substantially fails as an analysis of the paradoxes of self-reference because it is question-begging. The main purpose of this note is to show that Badici's critique highlights a necessity condition for the success of dialectic about paradoxes. The inclosure argument respects this condition and remains solvent.

We argue that the unexpected examination paradox can be regarded as showing that the logic of temporally indexed epistemic states, although it is intuitively appealing, cannot be recursively axiomatised.

Philosophical dialetheism, whose main exponent is Graham Priest, claims that some contradictions hold, are true, and it is rational to accept and assert them. Such a position is naturally portrayed as a challenge to the Law of Non-Contradiction (LNC). But all the classic formulations of the LNC are, in a sense, not questioned by a typical dialetheist, since she is (cheerfully) required to accept them by her own theory. The goal of this paper is to develop a formulation of the (...) Law which appears to be unquestionable, in the sense that the Priestian dialetheist is committed to accept it without also accepting something inconsistent with it, on pain of trivialism—that is to say, on pain of lapsing into the position according to which everything is the case. This will be achieved via (a) a discussion of Priest's dialetheic treatment of the notions of rejection and denial; and (b) the characterization of a negation via the primitive intuition of content exclusion. Such a result will not constitute a cheap victory for the friends of consistency. We may just learn that different things have been historically conflated under the label of 'Law of Non-Contradiction'; that dialetheists rightly attack some formulations of the Law, and orthodox logicians and philosophers have been mistaken in assimilating them to the indisputable one. (shrink)

Doris Olin's Paradox is a very helpful book for those who want to be introduced to the philosophical treatment of paradoxes, or for those who already have knowledge of the general area and would like to have a helpful resource book.

Classical logic yields counterintuitive results for numerous propositional argument forms. The usual alternatives (modal logic, relevance logic, etc.) generate counterintuitive results of their own. The counterintuitive results create problems—especially pedagogical problems—for informal logicians who wish to use formal logic to analyze ordinary argumentation. This paper presents a system, PL– (propositional logic minus the funny business), based on the idea that paradigmatic valid argument forms arise from justificatory or explanatory discourse. PL– avoids the pedagogical difficulties without sacrificing insight into argument.

What is the best question to ask an omniscient being? The question is intriguing; is it also paradoxical? We discuss several versions of what Ned Markosian calls the paradox of the question and suggest solutions to each of those puzzles. We then offer some practical advice about what do if you ever have the opportunity to query an omniscient being.