Neil Tennant was the first to propose a proof-theoretic criterion for paradoxicality, a framework in which a paradox, formalized through natural deduction, is derived from an unacceptable conclusion that employs a certain form of id est inferences and generates an infinite reduction sequence. Tennant hypothesized that any derivation in natural deduction that formalizes a genuine paradox would meet this criterion, and he argued that while the liar paradox is genuine, Russell's paradox is not. -/- The present (...) paper delves into Tennant's conjecture for genuine paradoxes and suggests that to validate the conjecture, one of two issues must be addressed. The first issue is the need for a philosophical consensus on the identification of a genuine paradox in an informal sense. The second issue is the requirement for a uniform approach to formalize paradoxes in natural deduction. If either of these issues is addressed, the conjecture could be validated, or at the very least, it could hold philosophical importance in delineating the proof-theoretic features of paradoxicality. (shrink)

Berry’s Paradox, like Russell’s Paradox, is a ‘paradox’ in name only. It differs from genuine logico-semantic paradoxes such as the Liar Paradox, Grelling’s Paradox, the Postcard Paradox, Yablo’s Paradox, the Knower Paradox, Prior’s Intensional Paradoxes, and their ilk. These latter arise from semantic closure. Their genuine paradoxicality manifests itself as the non-normalizability of the formal proofs or disproofs associated with them. The Russell, the Berry, and the Burali-Forti ‘paradoxes’, by contrast, simply reveal the straightforward inconsistency of their (...) respective existential claims—that the Russell set exists; that the Berry number exists; and that the ordinal of the well-ordering of all ordinals exists. The disproofs of these existential claims are in free logic and are in normal form. They show that certain complex singular terms do not—indeed, cannot—denote. All this counsels reconsideration of Ramsey’s famous division of paradoxes and contradictions into his Group A and Group B. The proof-theoretic criterion of genuine paradoxicality formally explicates an informal and occasionally confused notion. The criterion should be allowed to reform our intuitions about what makes for genuine paradoxicality, as opposed to straightforward (albeit surprising) inconsistency. (shrink)

We begin with a brief explanation of our proof-theoretic criterion of paradoxicality—its motivation, its methods, and its results so far. It is a proof-theoretic account of paradoxicality that can be given in addition to, or alongside, the more familiar semantic account of Kripke. It is a question for further research whether the two accounts agree in general on what is to count as a paradox. It is also a question for further research whether and, if so, how the so-called Ekman (...) problem bears on the investigations here of the intensional paradoxes. Possible exceptions to the proof-theoretic criterion are Prior’s Theorem and Russell’s Paradox of Propositions—the two best-known ‘intensional’ paradoxes. We have not yet addressed them. We do so here. The results are encouraging. §1 studies Prior’s Theorem. In the literature on the paradoxes of intensionality, it does not enjoy rigorous formal proof of a Gentzenian kind—the kind that lends itself to proof-theoretic analysis of recondite features that might escape the attention of logicians using non-Gentzenian systems of logic. We make good that lack, both to render the criterion applicable to the formal proof, and to see whether the criterion gets it right. Prior’s Theorem is a theorem in an unfree, classical, quantified propositional logic. But if one were to insist that the logic employed be free, then Prior’s Theorem would not be a theorem at all. Its proof would have an undischarged assumption—the ‘existential presupposition’ that the proposition $$\forall p(Qp\!\rightarrow \!\lnot p)$$ ∀ p ( Q p → ¬ p ) exists. Call this proposition $$\vartheta$$ ϑ. §2 focuses on $$\vartheta$$ ϑ. We analyse a Priorean reductio of $$\vartheta$$ ϑ along with the possibilitate $$\Diamond \forall q(Qq\!\leftrightarrow \!(\vartheta \!\leftrightarrow \! q))$$ ◊ ∀ q ( Q q ↔ ( ϑ ↔ q ) ). The attempted reductio of this premise-pair, which is constructive, cannot be brought into normal form. The criterion says we have not straightforward inconsistency, but rather genuine paradoxicality. §3 turns to problems engendered by the proposition $$\exists p(Qp\wedge \lnot p)$$ ∃ p ( Q p ∧ ¬ p ) (call it $$\eta$$ η ) for the similar possibilitate $$\Diamond \forall q(Qq\!\leftrightarrow \!(\eta \!\leftrightarrow \! q))$$ ◊ ∀ q ( Q q ↔ ( η ↔ q ) ). The attempted disproof of this premise-pair—again, a constructive one—cannot succeed. It cannot be brought into normal form. The criterion says the premise-pair is a genuine paradox. In §4 we show how Russell’s Paradox of Propositions, like the Priorean intensional paradoxes, is to be classified as a genuine paradox by the proof-theoretic criterion of paradoxicality. (shrink)

We furnish a core-logical development of the Gödel numbering framework that allows metamathematicians to attain limitative results about arithmetical truth without incorporating a genuine truth predicate into the language in a way that would lead to semantic closure. We show how Tarski’s celebrated theorem on the arithmetical undefinability of arithmetical truth can be established using only core logic in both the object language and the metalanguage. We do so at a high level of abstraction, by augmenting the usual first-order (...) language of arithmetic with a primitive predicate Tr and then showing how it cannot be a truth predicate for the augmented language. McGee established an important result about consistent theories that are in the language of arithmetic augmented by such a “truth predicate” Tr and that use Gödel numbering to refer to expressions of the augmented language. Given the nature of his sought result, he was forced to use classical reasoning at the meta level. He did so, however, on the additional and tacit presupposition that the arithmetical theories in question (in the object language) would be closed under classical logic. That left open the dialectical possibility that a constructivist (or intuitionist) could claim not to be discomfited by the results, even if they were to “give a pass” on the unavoidably classical reasoning at the meta level. In this study we “constructivize” McGee’s result, by presuming only core logic for the object language. This shows that the perplexity induced by McGee’s result will confront the constructivist (or intuitionist) as well. (shrink)

In his paper, “On paradox without self-reference”, Neil Tennant proposed the conjecture for self-referential paradoxes that any derivation formalizing self-referential paradoxes only generates a looping reduction sequence. According to him, the derivation of the Liar paradox in natural deduction initiates a looping reduction sequence and the derivation of the Yablo's paradox generates a spiral reduction. The present paper proposes the counterexample to Tennant's conjecture for self-referential paradoxes. We shall show that there is a derivation of the Liar (...) paradox which generates a spiraling reduction procedure. Since the Liar paradox is a self-referential paradox, the result is a counterexample to his conjecture. Tennant has believed that classical reductio has no essential role to formalize paradoxes. As our counterexample applies the rule of classical reductio, he may reject the counterexample. In this sense, it will be briefly argued that classical reductio and his rules for the liar sentence share some inferential role. If classical reductio should not be used in paradoxical reasoning, neither should be his rules for the liar sentence. (shrink)

The purpose of this note is to present a strong form of the liar paradox. It is strong because the logical resources needed to generate the paradox are weak, in each of two senses. First, few expressive resources required: conjunction, negation, and identity. In particular, this form of the liar does not need to make any use of the conditional. Second, few inferential resources are required. These are: (i) conjunction introduction; (ii) substitution of identicals; and (iii) the inference: (...) From ¬(p ∧ p), infer ¬ p. It is, interestingly enough, also essential to the argument that the ‘strong’ form of the diagonal lemma be used: the one that delivers a term λ such that we can prove: λ = ¬ T(⌈λ⌉); rather than just a sentence Λ for which we can prove: Λ ≡ ¬T(⌈Λ⌉). The truth-theoretic principles used to generate the paradox are these: ¬(S ∧ T(⌈¬S⌉); and ¬(¬S ∧ ¬T(⌈¬S⌉). These are classically equivalent to the two directions of the T-scheme, but they are intuitively weaker. The lesson I would like to draw is: There can be no consistent solution to the Liar paradox that does not involve abandoning truth-theoretic principles that should be every bit as dear to our hearts as the T-scheme. So we shall have to learn to live with the Liar, one way or another. (shrink)

Kalrnaric. We set out a system T, consisting of normal proofs constructed by means of elegantly symmetrical introduction and elimination rules. In the system T there are two requirements, called ( ) and ()), on applications of discharge rules. T is sound and complete for Kalmaric arguments. ( ) requires nonvacuous discharge of assumptions; ()) requires that the assumption discharged be the sole one available of highest degree. We then consider a 'Duhemian' extension T*, obtained simply by dropping the requirement (...) ()). T* is a proper subsystem of intuitionistic relevant logic. Our main result is that T* is a double negation consistency companion to classical logic. Thus all one needs to add to T* to obtain classical logic is the (intuitionistic) absurdity rule, and the (classical) rule of double nega-. (shrink)

The rules for Core Logic are stated, and various important results about the system are summarized. We describe its relationship to other systems, such as Classical Logic, Intuitionistic Logic, Minimal Logic, and the Anderson–Belnap relevance logicR. A precise, positive explication is offered of what it is for the premises of a proof to connect relevantly with its conclusion. This characterization exploits the notion of positive and negative occurrences of atoms in sentences. It is shown that all Core proofs (...) are relevant in this precisely defined sense. We survey extant results about variable-sharing in rival systems of relevance logic, and find that the variable-sharing conditions established for them are weaker than the one established here for Core Logic (and for its classical extension). Proponents of other systems of relevance logic (such asRand its subsystems) are challenged to formulate a stronger variable-sharing condition, and to prove thatRor any of its subsystems satisfies it, but that Core Logic does not. We give reasons for pessimism about the prospects for meeting this challenge. (shrink)

We explore the problems that confront any attempt to explain or explicate exactly what a primitive logical rule of inferenceis, orconsists in. We arrive at a proposed solution that places a surprisingly heavy load on the prospect of being able to understand and deal with specifications of rules that are essentiallyself-referring. That is, any rule$\rho $is to be understood via a specification that involves, embedded within it, reference to rule$\rho $itself. Just how we arrive at this position is explained by (...) reference to familiar rules as well as less familiar ones with unusual features. An inquiry of this kind is surprisingly absent from the foundations of inferentialism—the view that meanings of expressions (especially logical ones) are to be characterized by the rules of inference that govern them. (shrink)

This study continues the anti-realist’s quest for a principled way to avoid Fitch’s paradox. It is proposed that the Cartesian restriction on the anti-realist’s knowability principle ‘ϕ, therefore 3Kϕ’ should be formulated as a consistency requirement not on the premise ϕ of an application of the rule, but rather on the set of assumptions on which the relevant occurrence of ϕ depends. It is stressed, by reference to illustrative proofs, how important it is to have proofs in normal form (...) before applying the proposed restriction. A similar restriction is proposed for the converse inference, the so-called Rule of Factiveness ‘3Kϕ therefore ϕ’. The proposed restriction appears to block another Fitch-style derivation that uses the KK -thesis in order to get around.. (shrink)

This paper treats entailment as a subrelation of classical consequence and deducibility. Working with a Gentzen set-sequent system, we define an entailment as a substitution instance of a valid sequent all of whose premisses and conclusions are necessary for its classical validity. We also define a sequent Proof as one in which there are no applications of cut or dilution. The main result is that the entailments are exactly the Provable sequents. There are several important corollaries. Every unsatisfiable (...) set is Provably inconsistent. Every logical consequence of a satisfiable set is Provable therefrom. Thus our system is adequate for ordinary mathematical practice. Moreover, transitivity of Proof fails upon accumulation of Proofs only when the newly combined premisses are inconsistent anyway, or the conclusion is a logical truth. In either case Proofs that show this can be effectively determined from the Proofs given. Thus transitivity fails where it least matters — arguably, where it ought to fail! We show also that entailments hold by virtue of logical form insufficient either to render the premisses inconsistent or to render the conclusion logically true. The Lewis paradoxes are not Provable. Our system is distinct from Anderson and Belnap''s system of first degree entailments, and Johansson''s minimal logic. Although the Curry set paradox is still Provable within naive set theory, our system offers the prospect of a more sensitive paraconsistent reconstruction of mathematics. It may also find applications within the logic of knowledge and belief. (shrink)

The naive anti-realist holds the following principle: (◊K) All truths are knowable. This unrestricted generalization (◊K), as is now well known, falls prey to Fitch’s Paradox (Fitch 1963: 38, Theorem 1). It can be used as the only suspect principle, alongside others that cannot be impugned, to prove quite generally, and constructively, that the set {p, ¬Kp} is inconsistent (Tennant 1997: 261). From this it would follow, intuitionistically, that any proposition that is never actually known to be true (by anyone, (...) at any time) is false; and it would follow, classically, that every truth is known (by someone, at some time). (shrink)

The paradoxes of self-reference are genuinely paradoxical. The liar paradox, Russell’s paradox and their cousins pose enormous difficulties to anyone who seeks to give a comprehensive theory of semantics, or of sets, or of any other domain which allows a modicum of self-reference and a modest number of logical principles. One approach to the paradoxes of self-reference takes these paradoxes as motivating a non-classical theory of logical consequence. Similar logical principles are used in each of the paradoxical inferences. (...) If one or other of these problematic inferences are rejected, we may arrive at a consistent (or at least, a coherent) theory. In this paper I will show that such approaches come at a serious cost. The general approach of using the paradoxes to restrict the class of allowable inferences places severe constraints on the domain of possible propositional logics, and on the kind of metatheory that is appropriate in the study of logic itself. Proof-theoretic and model-theoretic analyses of logical consequence make provide different ways for non-classical responses to the paradoxes to be defeated by revenge problems: the redefinition of logical connectives thought to be ruled out on logical grounds. Non-classical solutions are not the “easy way out” of the paradoxes. (shrink)

We explore the consequences, for logical system-building, of taking seriously the aim of having irredundant rules of inference, and a preference for proofs of stronger results over proofs of weaker ones. This leads one to reconsider the structural rules of REFLEXIVITY, THINNING, and CUT. REFLEXIVITY survives in the minimally necessary form $\varphi:\varphi$. Proofs have to get started. CUT is subject to a CUT-elimination theorem, to the effect that one can always make do without applications of CUT. So CUT is redundant, (...) and should not be a rule of the system. CUT-elimination, however, in the context of the usual forms of logical rules, requires the presence, in the system, of THINNING. But THINNING, it turns out, is not really necessary. Provided only that one liberalizes the statement of certain logical rules in an appropriate way, one can make do without CUT or THINNING. From the methodological point of view of this study, the logical rules ought to be framed in this newly liberalized form. These liberalized logical rules determine the system of core logic. Given any intuitionistic Gentzen proof of $\Delta:\varphi$, one can determine from it a Core proof of some subsequent of $\Delta:\varphi$. Given any classical Gentzen proof of $\Delta:\varphi$, one can determine from it a classical Core proof of some subsequent of $\Delta:\varphi$. In both cases the Core proof is of a result at least as strong as that of the Gentzen proof; and the only structural rule used is $\varphi:\varphi$. (shrink)

It is often said that in a purely formal perspective, intuitionistic logic has no obvious advantage to deal with the liar-type paradoxes. In this paper, we will argue that the standard intuitionistic natural deduction systems are vulnerable to the liar-type paradoxes in the sense that the acceptance of the liar-type sentences results in inference to absurdity (⊥). The result shows that the restriction of the Double Negation Elimination (DNE) fails to block the inference to ⊥. (...) It is, however, not the problem of the intuitionistic approaches to the liar-type paradoxes but the lack of expressive power of the standard intuitionistic natural deduction system. We introduce a meta-level negation for a given system and a meta-level absurdity, ⋏, to the intuitionistic system. We shall show that in the system, the inference to ⊥ is not given without the assumption that the system is complete. Moreover, we consider the Double Meta-Level Negation Elimination rules (DMNE) which implicitly assume the completeness of the system. Then, the restriction of DMNE can rule out the inference to ⊥. (shrink)

The logic B+ is Routley and Meyer's basic positive logic. We show how to introduce a minimal intuitionistic negation and an intuitionistic negation in B+. The two types of negation are introduced in a wide spectrum of relevance logics built up from B+. It is proved that although all these logics have the characteristic paradoxes of consistency, they lack the K rule (and so, the K axioms).

This article introduces, studies, and applies a new system of logic which is called ‘HYPE’. In HYPE, formulas are evaluated at states that may exhibit truth value gaps and truth value gluts. Simple and natural semantic rules for negation and the conditional operator are formulated based on an incompatibility relation and a partial fusion operation on states. The semantics is worked out in formal and philosophical detail, and a sound and complete axiomatization is provided both for the propositional and the (...) predicate logic of the system. The propositional logic of HYPE is shown to contain first-degree entailment, to have the Finite Model Property, to be decidable, to have the Disjunction Property, and to extend intuitionistic propositional logic conservatively when intuitionistic negation is defined appropriately by HYPE’s logical connectives. Furthermore, HYPE’s first-order logic is a conservative extension of intuitionistic logic with the Constant Domain Axiom, when intuitionistic negation is again defined appropriately. The system allows for simple model constructions and intuitive Euler-Venn-like diagrams, and its logical structure matches structures well-known from ordinary mathematics, such as from optimization theory, combinatorics, and graph theory. HYPE may also be used as a general logical framework in which different systems of logic can be studied, compared, and combined. In particular, HYPE is found to relate in interesting ways to classical logic and various systems of relevance and paraconsistent logic, many-valued logic, and truthmaker semantics. On the philosophical side, if used as a logic for theories of type-free truth, HYPE is shown to address semantic paradoxes such as the Liar Paradox by extending non-classical fixed-point interpretations of truth by a conditional as well-behaved as that of intuitionistic logic. Finally, HYPE may be used as a background system for modal operators that create hyperintensional contexts, though the details of this application need to be left to follow-up work. (shrink)

According to the realist, the meaning of a declarative, non-indexical sentence is the condition under which it is true and the truth-condition of an undecidable sentence can obtain or fail to obtain independently of our capacity, even in principle, to recognize that it obtains or that fails to do so.1 In a series of papers, beginning with “Truth” in 1959, Michael Dummett challenged the position that the classical notion of truth-condition occupied as the central notion of a theory of (...) meaning, and proposed that it should be replaced by the anti-realist (and intuitionistic) notion of assertability-condition. Taken together with normalization results obtained by Dag Prawitz, Dummett’s work truly opened up the anti-realist challenge at the level of proof-theoretical semantics.2 There has been since numerous rejoinders from partisans of classical logic, which were at times met with by attempts at watering down the anti-realist challenge, e.g., by arguing that anti-realism does not necessarily entail the adoption of intuitionistic logic. Only a few anti-realists, such as Crispin Wright and Neil Tennant, tried to look instead in the other direction, towards a more radical version of anti-realism which would entail deeper revisions of classical logic than those recommended by intuitionists.3 In this paper, which is largely programmatic, we shall also argue in favour of a radical anti-realism which would be a genuine alternative to the traditional anti-realism of Dummett and Prawitz. The debate about anti-realism has by now more or less run out of breath and we wish to provide it with a new lease on life, by taking into account the profound changes that took place in proof theory during the intervening years. We have in mind in particular the considerable development within Gentzen-style proof theory of non-classical, substructural logics other than intuitionistic logic, which seriously opens up the possibility that anti-realism, when properly understood, might end up justifying another logic, and the development of closer links between proof theory and computational complexity theory that has renewed interest in a radical form of anti-realism, namely strict finitism. (shrink)

We define a system IR of first-order intuitionistic relevant logic. We show that intuitionistic mathematics (on the assumption that it is consistent) can be relevantized, by virtue of the following metatheorem: any intuitionistic proof of A from a setX of premisses can be converted into a proof in IR of eitherA or absurdity from some subset ofX. Thus IR establishes the same inconsistencies and theorems as intuitionistic logic, and allows one to prove every intuitionistic (...) consequence of any consistent set of premisses. (shrink)

Anti-realist epistemic conceptions of truth imply what is called the knowability principle: All truths are possibly known. The principle can be formalized in a bimodal propositional logic, with an alethic modality ${\diamondsuit}$ and an epistemic modality ${\mathcal{K}}$, by the axiom scheme ${A \supset \diamondsuit \mathcal{K} A}$. The use of classical logic and minimal assumptions about the two modalities lead to the paradoxical conclusion that all truths are known, ${A \supset \mathcal{K} A}$. A Gentzen-style reconstruction of the Church–Fitch paradox is (...) presented following a labelled approach to sequent calculi. First, a cut-free system for classical bimodal logic is introduced as the logical basis for the Church–Fitch paradox and the relationships between ${\mathcal {K}}$ and ${\diamondsuit}$ are taken into account. Afterwards, by exploiting the structural properties of the system, in particular cut elimination, the semantic frame conditions that correspond to KP are determined and added in the form of a block of nonlogical inference rules. Within this new system for classical and intuitionistic “knowability logic”, it is possible to give a satisfactory cut-free reconstruction of the Church–Fitch derivation and to confirm that OP is only classically derivable, but neither intuitionistically derivable nor intuitionistically admissible. Finally, it is shown that in classical knowability logic, the Church–Fitch derivation is nothing else but a fallacy and does not represent a real threat for anti-realism. (shrink)

In 1993, the American logic S. Yablo was proposed an original infinitive formulation of the classical ≪Liar≫ paradox. It questioned the traditional notion of self-reference as the basic structure for semantic paradoxes. The article considers the arguments underlying two different approaches to analysis of proposals of the ≪Infinite Liar≫ and understanding of the genuine sources for semantic paradoxes. The first approach (V. Valpola, G.-H. von Wright, T. Bolander, etc.) imposes responsibility for the emergence of semantic paradoxes (...) on the negation of the truth predicate. It deprives the ≪Infinite Liar≫ sentences of consistent truth values. The second approach is based on a modified version of anaphoric prosententialism (D. Grover, R. Brandom, etc.). The concepts of truth and falsehood are treated as special anaphoric operators. Logical constructs similar to the ≪Infinite Liar≫ do not attribute any definite truth values to sentences from which they are composed, but only state certain types of relations between the semantic content of such sentences. (shrink)

The Liar paradox arises when we consider a sentence that says of itself that it is not true. If such self-referential sentences exist? and examples like?This sentence is not true? certainly suggest this?, then our logic and standard notion of truth allow to infer a contradiction: The Liar sentence is true and not true. What has gone wrong? Must we revise our notion of truth and our logic? Or can we dispel the common conviction that there are such (...) self-referential sentences? The present study explores the second path.0After comparing the Liar reasoning in formal and informal logic and showing that there are no Gödelian Liar sentences, the study moves on from the semantics of self-reference to the metaphysics of expressions and proposes a novel solution to the Liar paradox: Meaningful expressions are distinct from their syntactic bases and exist only relative to contexts. Detailed semantico-metaphysical arguments show that in this dynamic setting, an object can be referred to only after it has started to exist. Hence the circular reference needed in the Liar paradox cannot occur, after all. As this solution is contextualist, it evades the expressibility problems of other proposals. (shrink)

Two semantic paradoxes, the Liar and Curry’s paradox, are analysed using a newly developed conception of procedural semantics (semantics according to which the truth of propositions is determined algorithmically), whose main characteristic is its departure from methodological realism. Rather than determining pre-existing facts, procedures are constitutive of them. Of this semantics, two versions are considered: closed (where the halting of procedures is presumed) and open (without this presumption). To this end, a procedural approach to deductive reasoning is developed, based (...) on the idea of simulation. As is shown, closed semantics supports classical logic, but cannot in any straightforward way accommodate the concept of truth. In open semantics, where paradoxical propositions naturally ‘belong’, they cease to be paradoxical; yet, it is concluded that the natural choice—for logicians and common people alike—is to stick to closed semantics, pragmatically circumventing problematic utterances. (shrink)

A historically popular response to the liar paradox (“this sentence is false”) is to say that the liar sentence is meaningless (or semantically defective, or malfunctions, or…). Unfortunately, like all other supposed solutions to the liar, this approach faces a revenge challenge. Consider the revenge liar sentence, “this sentence is either meaningless or false”. If it is true, then it is either meaningless or false, so not true. And if it is not true, then it can’t (...) be either meaningless or false, so it must be true. Either way, we are back in a paradox. This paper provides a detailed and exhaustive discussion of the options for responding to revenge on behalf of “meaningless” theories. Though I attempt to discuss all of the options fairly, I will ultimately opt for one specific response and discuss some of its challenges. Various technical and logical matters will be discussed throughout the paper, but my focus will be philosophical, throughout. My overall conclusion is that the “meaningless” strategy is at least as well off in the face of revenge as any other approach to the liar and related paradoxes. (shrink)

The paper responds to Neil Tennant's recent discussion of Fitch's so-called paradox of knowability in the context of intuitionistic logic. Tennant's criticisms of the author's earlier work on this topic are shown to rest on a principle about the assertability of disjunctions with the absurd consequence that everything we could make true already is true. Tennant restricts the anti-realist principle that truth implies knowability in order to escape Fitch's argument, but a more complex variant of the argument is (...) shown to elicit from his restricted principle exactly the consequences which it was intended to avoid. (shrink)

Systems of paraconsistent logics violate the law of explosion: from contradictory premises not every formula follows. One of the philosophical options for interpreting the contradictions allowed as premises in these cases was put forward recently by Carnielli and Rodrigues, with their epistemic approach to paraconsistent logics. In a nutshell, the plan consists in interpreting the contradictions in epistemic terms, as indicating the presence of non-conclusive evidence for both a proposition and its negation. Truth, in this approach, is consistent and is (...) dealt with by classical logic. In this paper we discuss the fate of the Liar paradox in this picture. While this is a paradox about truth, it cannot be accommodated by the classical part of the approach, due to trivialization problems. On the other hand, the paraconsistent part does not seem fit as well, due to the fact that its intended reading is in terms of non-conclusive evidence, not truth. We discuss the difficulties involved in each case and argue that none of the options seems to accommodate the paradox in a satisfactory manner. (shrink)

Informally rigorous mathematical reasoning is relevant. So too should be the premises to the conclusions of formal proofs that regiment it. The rule Ex Falso Quodlibet induces spectacular irrelevance. We therefore drop it. The resulting systems of Core Logic $ \mathbb{C}$ and Classical Core Logic $ \mathbb{C}^{+}$ can formalize all the informally rigorous reasoning in constructive and classical mathematics respectively. We effect a revised match-up between deducibility in Classical Core Logic and a new notion of (...) class='Hi'>relevant logical consequence. It matches better the deducibility relation of Classical Core Logic than does the Tarskian notion of consequence. It is implosive, not explosive. (shrink)

This study is in two parts. In the first part, various important principles of classical extensional mereology are derived on the basis of a nice axiomatization involving ‘part of’ and fusion. All results are proved here with full Fregean rigor. They are chosen because they are needed for the second part. In the second part, this natural-deduction framework is used in order to regiment David Lewis’s justification of his Division Thesis, which features prominently in his combination of mereology with (...) class theory. The Division Thesis plays a crucial role in Lewis’s informal argument for his Second Thesis in his book Parts of Classes. In order to present Lewis’s argument in rigorous detail, an elegant new principle is offered for the theory that combines class theory and mereology. The new principle is called the Canonical Decomposition Thesis. It secures Lewis’s Division Thesis on the strong construal required in order for his argument to go through. The exercise illustrates how careful one has to be when setting up the details of an adequate foundational theory of parts and classes. The main aim behind this investigation is to determine whether an anti-realist, inferentialist theorist of meaning has the resources to exhibit Lewis’s argument for his Second Thesis—which is central to his marriage of class theory with mereology—as a purely conceptual one. The formal analysis shows that Lewis’s argument, despite its striking appearance to the contrary, can be given in the constructive, relevant logic IR. This is the logic that the author has argued, elsewhere, to be the correct logic from an anti-realist point of view. The anti-realist is therefore in a position to regard Lewis’s argument as purely conceptual. (shrink)

Given the harmony principle for logical operators, compositionality ought to ensure that harmony should obtain at the level of whole contents. That is, the role of a content qua premise ought to be balanced exactly by its role as a conclusion. Frege's contextual definition of propositional content happens to exploit this balance, and one appeals to the Cut rule to show that the definition is adequate. We show here that Frege's definition remains adequate even when one relevantizes logic by abandoning (...) an unrestricted Cut rule. The proof exploits the fact that in the relevantized logic, which abandons the unrestricted rule of Cut, any failure of the transitivity of deduction is offset by the epistemic gain involved in learning that a stronger-than-expected result holds. (shrink)

The ancient puzzle of the Liar was shown by Tarski to be a genuine paradox or antinomy. I show, analogously, that certain puzzles of contemporary game theory are genuinely paradoxical, i.e., certain very plausible principles of rationality, which are in fact presupposed by game theorists, are inconsistent as naively formulated. ;I use Godel theory to construct three versions of this new paradox, in which the role of 'true' in the Liar paradox is played, respectively, by 'provable', 'self-evident', (...) and 'justifiable'. I also construct in modal operator logic a paradox involving reflexive empirical reasoning. Unlike the paradox of the Liar, the paradox of reflexive reasoning does not depend on self-reference. ;I consider various solutions to the Liar paradox and evaluate how well these solutions cope with the paradox of reflexive reasoning. I then formalize the solution to the paradoxes which I favor: the indexical-hierarchical approach, first sketched out by Charles Parsons and Tyler Burge. In this solution, occurrences of the predicate 'true' in sentence-tokens are contextually relativized to levels of a hierarchy. Drawing also on some brief remarks of Bertrand Russell and Charles Parsons, I develop an account of the kind of schematic generality needed for this theory to be statable. ;Finally, I demonstrate that the principles shown to be paradoxical are in fact presupposed by contemporary game theorists in their reliance on the notion of common knowledge or, more precisely, mutual belief. I create novel analyses of and corresponding solutions to several recalcitrant puzzles within game theory, including the "chain-store paradox". (shrink)

Adding a transparent truth predicate to a language completely governed by classical logic is not possible. The trouble, as is well-known, comes from paradoxes such as the Liar and Curry. Recently, Cobreros, Egré, Ripley and van Rooij have put forward an approach based on a non-transitive notion of consequence which is suitable to deal with semantic paradoxes while having a transparent truth predicate together with classical logic. Nevertheless, there are some interesting issues concerning the set of metainferences (...) validated by this logic. In this paper, we show that this logic, once it is adequately understood, is weaker than classical logic. Moreover, the logic is in a way similar to the paraconsistent logic LP. (shrink)

John Barker, in two recent essays, raises a variety of intriguing criticisms to challenge my interpretation of the liar paradox and the type of solution I proposein ‘Denying the Liar’ and ‘Denying the Liar Reaffirmed.’ Barker continues to believe that I have misunderstood the logical structure of the liar sentence and itsexpression, and that as a result my solution misfires. I shall try to show that on the contrary my analysis is correct, and that Barker does (...) not properly grasp what mysolution to the liar paradox involves. Additionally, I argue that Barker makes fundamental errors in the explanation of liar sentence formulations in intensional contexts and in the classical metatheory he invokes to support his criticisms. (shrink)

We present a new logic-based approach to the reasoning about knowledge which is independent of possible worlds semantics. \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\in_K}$$\end{document} is a non-Fregean logic whose models consist of propositional universes with subsets for true, false and known propositions. Knowledge is, in general, not closed under rules of inference; the only valid epistemic principles are the knowledge axiom Kiφ → φ and some minimal conditions concerning common knowledge in a group. Knowledge is explicit (...) and all forms of the logical omniscience problem are avoided. Various stronger epistemic properties such as positive and/or negative introspection, the K-axiom, closure under logical connectives, etc. can be restored by imposing additional semantic constraints. This yields corresponding sublogics for which we present sound and complete axiomatizations. As a useful tool for general model constructions we study abstract versions of some 3-valued logics in which we interpret truth as knowledge. We establish a connection between \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\in_K}$$\end{document} and the well-known syntactic approach to explicit knowledge proving a result concerning equi-expressiveness. Furthermore, we discuss some self-referential epistemic statements, such as the knower paradox, as relaxations of variants of the liar paradox and show how these epistemic “paradoxes” can be solved in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\in_K}$$\end{document}. Every specific \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\in_K}$$\end{document}-logic is defined as a certain extension of some underlying classical abstract logic. (shrink)

We employ topos quantum theory as a mathematical framework for quantum logic, combining the strengths of two distinct intuitionistic quantum logics proposed by Döring and Coecke respectively. This results in a novel intuitionistic quantum logic that can capture contextuality, express the physical meaning of superposition phenomenon in quantum systems, and handle both measurement and evolution as dynamic operations. We emphasize that superposition is a relative concept dependent on contextuality. Our intention is to find a model from the perspective (...) of quantum theory that accommodates semantic paradoxes. We refine Aerts et al.’s interpretation of the liar paradox using models from quantum mechanics and present a model based on quantum theory, incorporating contextuality and superposition to interpret semantic paradoxes. We associate the truth values of statements in semantic paradoxes with quantum states in a given context, interpreting statements with unclear truth value assignments as superposition states within the current context. Dynamic operations are employed to distinguish the truth value assignments of statements among different times. Unlike the classic interpretation of paradoxes, we accept the reasonable existence of semantic paradoxes and point out the difference between paradoxes and contradictions. (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 ...

In Chapter 7 of The Taming of the True, Neil Tennant provides a new argument from Michael Dummett's ``manifestation requirement'' to the incorrectness of classical logic and the correctness of intuitionistic logic. I show that Tennant's new argument is only valid if one interprets crucial existence claims occurring in the proof in the manner of intuitionists. If one interprets the existence claims as a classical logician would, then one can accept Tennant's premises while rejecting his conclusion (...) of logical revision. Thus, Tennant has provided no evidence that should convince anyone who is not already an intuitionist. Since his proof is a proof for the correctness of intuitionism, it begs the question. (shrink)

This study takes a careful inferentialist look at Graham Priest’s Logic of Paradox. I conclude that it is sorely in need of a proof-system that could furnish formal proofs that would regiment faithfully the “naïve logical” reasoning that could be undertaken by a rational thinker within LP.

My task here is the first one. I do present a consistent formal system and claim that it provides a perfect model of natural languages such as English, but this system involves no surprises. It is none other than the standard framework of classical logic and model theory. The real weight of the argument lies in the claim that the classical framework—without alteration or addition—contains the resources to model what happens when we say in English ‘This sentence is (...) not true’. (shrink)

The Liar Paradox is a classic argument that creates a contradiction by reflection on a sentence that attributes falsity to itself: ‘this sentence is false’. In our paper we will discuss the ways in which the Liar sentence (and its paradoxical argument) can be represented in first-order logic. The key to the representation is to use first-order logic to model a self-referential language. We will also discuss several related sentences, like the Liar cycles, the empirical versions of (...) the Liar and the Truth teller sentences. (shrink)

The medieval Islamic solutions to the liar paradox can be categorized into three different families. According to the solutions of the first family, the liar sentences are not well-formed truth-apt sentences. The solutions of the second family are based on a violation of the classical principles of logic (e.g. the principle of non-contradiction). Finally, the solutions of the third family render the liar sentences as simply false without any contradiction. In the Islamic tradition, almost all the (...) well-known solutions of the third family are inspired by the solution proposed by At_īr al-Dīn al-Abharī (d. 1265). Providing a logical analysis of his discussion of the liar paradox, I show that his solution is based on a conception of truth according to which every sentence signifies, usually among other things, its own truth. This makes Abharī’s solution of the same spirit as certain solutions that were later developed in the Latin tradition, in particular by John Buridan (d. 1358) and Albert of Saxony (d. 1390). (shrink)

Depending on what one means by the main connective of logic, the -if..., then... -, several systems of logic result: classic and modal logics, intuitionistic logic or relevance logic. This book presents the underlying ideas, the syntax and the semantics of these logics. Soundness and completeness are shown constructively and in a uniform way. Attention is paid to the interdisciplinary role of logic: its embedding in the foundations of mathematics and its intimate connection with philosophy, in particular the philosophy (...) of language. Set theory is presented both as a conditio sine qua non for logic and as a interesting exact ontology. The study of infinite sets yields perplexing results. Formalization of informal number theory results in formal number theory; Godel's incompleteness is treated. At appropriate places attention is paid to paradoxes, intuitionism, conditionals, the historical development of logic, to logic programming and automated theorem proving for classical logic.". (shrink)

Jean Buridan has offered a solution to the Liar Paradox, i.e. to the problem of assigning a truth-value to the sentence ‘What I am saying is false’. It has been argued that either this solution is ad hoc since it would only apply to self-referencing sentences [Read, S. 2002. ‘The Liar Paradox from John Buridan back to Thomas Bradwardine’, Vivarium, 40 , 189–218] or else it weakens his theory of truth, making his ‘a logic without truth’ [Klima, G. (...) 2008. ‘Logic without truth: Buridan on the Liar’, in S. Rahman, T. Tulenheimo and E. Genot, Unity, Truth and the Liar: The Modern Relevance of Medieval Solutions to the Liar Paradox, Berlin: Springer, 87–112 ; Dutilh Novaes, C. 2011. ‘Lessons on truth from mediaeval solutions to the Liar Paradox’, The Philosophical Quarterly, 61 , 58–78]. Against , I will argue that Buridan's solution by means of truth by supposition does not involve new principles. Self-referential sentences force us to handle supposition more carefully, which does not warrant the accusation of adhoccery. I will also argue, against (2), that it is exaggerated to assert that this solution leads to a ‘weakened’ theory of truth, since it is consistent with other passages of the Sophismata, which only gives necessary conditions for the truth of affirmative propositions, but sufficient conditions for falsity. (shrink)

Relevant logics have traditionally been viewed as paraconsistent. This paper shows that this view of relevant logics is wrong. It does so by showing forth a logic which extends classical logic, yet satisfies the Entailment Theorem as well as the variable sharing property. In addition it has the same S4-type modal feature as the original relevant logic E as well as the same enthymematical deduction theorem. The variable sharing property was only ever regarded as a necessary (...) property for a logic to have in order for it to not validate the so-called paradoxes of implication. The Entailment Theorem on the other hand was regarded as both necessary and sufficient. This paper shows that the latter theorem also holds for classical logic, and so cannot be regarded as a sufficient property for blocking the paradoxes. The concept of suppression is taken up, but shown to be properly weaker than that of variable sharing. (shrink)

Jean-Yves Béziau (‘Classical Negation can be Expressed by One of its Halves’, Logic Journal of the IGPL 7 (1999), 145–151) has given an especially clear example of a phenomenon he considers a sufficiently puzzling to call the ‘paradox of translation’: the existence of pairs of logics, one logic being strictly weaker than another and yet such that the stronger logic can be embedded within it under a faithful translation. We elaborate on Béziau’s example, which concerns classical negation, (...) as well as giving some additional background (especially from intuitionistic logic) to the example. Our interest is more on the logical exploration of the phenomenon Béziau’s case exemplifies than on the question of whether that phenomenon is (even prima facie ) paradoxical, though in Section 5 we do approach the latter question – somewhat obliquely – by considering an analogous phenomenon which it is hard to find puzzling. (shrink)

The formalism of abstracted quantum mechanics is applied in a model of the generalized Liar Paradox. Here, the Liar Paradox, a consistently testable configuration of logical truth properties, is considered a dynamic conceptual entity in the cognitive sphere (Aerts, Broekaert, & Smets, [Foundations of Science 1999, 4, 115–132; International Journal of Theoretical Physics, 2000, 38, 3231–3239]; Aerts and colleagues[Dialogue in Psychology, 1999, 10; Proceedings of Fundamental Approachs to Consciousness, Tokyo ’99; Mind in Interaction]. Basically, the intrinsic contextuality of (...) the truth-value of the Liar Paradox is appropriately covered by the abstracted quantum mechanical approach. The formal details of the model are explicited here for the generalized case. We prove the possibility of constructing a quantum model of the m-sentence generalizations of the Liar Paradox. This includes (i) the truth–falsehood state of the m-Liar Paradox can be represented by an embedded 2m-dimensional quantum vector in a (2m) m -dimensional complex Hilbert space, with cognitive interactions corresponding to projections, (ii) the construction of a continuous ‘time’ dynamics is possible: typical truth and falsehood value oscillations are described by Schrödinger evolution, (iii) Kirchoff and von Neumann axioms are satisfied by introduction of ‘truth-value by inference’ projectors, (iv) time invariance of unmeasured state. (shrink)

At some step in proving the Liar Paradox in natural language, a sentence is derived that seems overdetermined with respect to its semantic value. This is complemented by Tarski’s Theorem that a formal language cannot consistently contain a naive truth predicate given the laws of logic used in proving the Liar paradox. I argue that proofs of the Eubulidean Liar either use a principle of truth with non-canonical names in a fallacious way or make a fallacious use (...) of substitution of identicals. Tarski never committed the first fallacy and may have himself considered it fallacious. Nevertheless, I clarify that it is fallacious. I then argue substitution of identicals needs to be restricted within the scope of the truth predicate. A logic for truth implementing this restriction is a monotonic extension of a classical first order logic, or indeed a formalizable fragment of natural language. Proofs of Tarski’s Indefinability of Truth theorem are invalid in this logic. This approach generalizes to invalidate proofs of Liar-like paradoxes, particularly the predicate form of the Knower paradox. Consequently, such a logic can be further extended in a way that avoids Montague’s theorem for such a system. Yet, the semantic status of a Liar sentence is not fully resolved. It is no longer overdetermined; it is now underdetermined. (shrink)

AbstractṢadr al-Dīn al-Dashtakī (d. 1498) has proposed a solution to the liar paradox according to which the liar sentence is a self-referential sentence in which the predicate ‘false’ is iterated. Discussing the conditions for the truth-aptness of the sentences with nested and iterated instances of the predicates ‘true’ and/or ‘false’, Dashtakī argued that the liar sentence is not truth-apt at all. In the tradition of Arabic logic, the central elements of Dashtakī's solution—the self-referentiality of the liar (...) sentence and the implicit iteration of the predicate ‘false’—were initially highlighted in two earlier solutions proposed by Naṣīr al-Dīn al-Ṭūsī (d. 1274) and Shams al-Dīn al-Samarqandī (d. 1322), respectively. Here I investigate all three solutions and show that Dashtakī's solution can be taken as a synthesis of the other two. None of these solutions seems to be convincing at the end of the day. Nevertheless, all of them include significant logical and philosophical insights. In particular, although Dashtakī's solution is not itself compelling, it is only a few steps away from a promising solution. The appendix to this paper includes translations of the relevant passages. (shrink)