ABSTRACT In our response Field's ‘Properties, Propositions and Conditionals’, we explore the methodology of Field's program. We begin by contrasting it with a proof-theoretic approach and then commenting on some of the particular choices made in the development of Field's theory. Then, we look at issues of property identity in connection with different notions of equivalence. We close with some comments relating our discussion to Field's response to Restall’s [2010] ‘What Are We to Accept, and What Are We to Reject, (...) While Saving Truth from Paradox?’. (shrink)

Certain instances of contraction are provable in Zardini’s system $\mathbf {IK}^\omega $ which causes triviality once a truth predicate and suitable fixed points are available.

Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the association of a consequence relation (...) to a logical calculus is not as straightforward as it may seem. We show that these facts are problematic for the proof-theoretic project but the problems can be solved. Our thesis is that the consequence relation relevant for proof-theoretic semantics is the one given by the sequent-to-sequent derivability relation in Gentzen systems. (shrink)

ABSTRACTWe will present 12 different mixed metainferential consequence relations. Each one of them is specified using two different inferential Tarskian or non-Tarskian consequence relations: or. We will show that it is possible to obtain a Tarskian logic with non-Tarskian inferential logics, but also a non-Tarskian logic with Tarskian inferential logics. Moreover, we will show how some of these metainferential logics work better than the corresponding inferential rivals. Finally, we will show how these logics prove that it is not enough to (...) work with inferences as pairs of sets of formulas to obtain a contractive logic. (shrink)

In recent years, substructural approaches to paradoxes have become quite popular. But whatever restrictions on structural rules we may want to enforce, it is highly desirable that such restrictions be accompanied by independent philosophical motivation, not directly related to paradoxes. Indeed, while these recent developments have shed new light on a number of issues pertaining to paradoxes, it seems that we now have even more open questions than before, in particular two very pressing ones: what (independent) motivations do we have (...) (if any) for restrictions on structural rules, and what to make of the plurality of new logics emerging from these restrictions, i.e. how to ‘choose’ among the different options. In this paper, we address these two questions from the perspective of a dialogical conception of logic that we've been advocating in recent years. We will argue that dialogical interpretations of structural rules, that is, as rules determining specific properties of the dialogues in question, provide a conveniently neutral framework to adjudicate between the different substructural proposals that have been made in the literature on paradoxes. (shrink)

Substructural logics and their application to logical and semantic paradoxes have been extensively studied. In the paper, we study theories of naïve consequence and truth based on a non-reflexive logic. We start by investigating the semantics and the proof-theory of a system based on schematic rules for object-linguistic consequence. We then develop a fully compositional theory of truth and consequence in our non-reflexive framework.

We discuss the principles for a primitive, object-linguistic notion of consequence proposed by ) that yield a version of Curry’s paradox. We propose and study several strategies to weaken these principles and overcome paradox: all these strategies are based on the intuition that the object-linguistic consequence predicate internalizes whichever meta-linguistic notion of consequence we accept in the first place. To these solutions will correspond different conceptions of consequence. In one possible reading of these principles, they give rise to a notion (...) of logical consequence: we study the corresponding theory of validity by showing that it is conservative over a wide range of base theories: this result is achieved via a well-behaved form of local reduction. The theory of logical consequence is based on a restriction of the introduction rule for the consequence predicate. To unrestrictedly maintain this principle, we develop a conception of object-linguistic consequence, which we call grounded consequence, that displays a restriction of the structural rule of reflexivity. This construction is obtained by generalizing Saul Kripke’s inductive theory of truth. Grounded validity will be shown to satisfy several desirable principles for a naïve, self-applicable notion of consequence. (shrink)

Tarski's Undefinability of Truth Theorem comes in two versions: that no consistent theory which interprets Robinson's Arithmetic (Q) can prove all instances of the T-Scheme and hence define truth; and that no such theory, if sound, can even express truth. In this note, I prove corresponding limitative results for validity. While Peano Arithmetic already has the resources to define a predicate expressing logical validity, as Jeff Ketland has recently pointed out (2012, Validity as a primitive. Analysis 72: 421-30), no theory (...) which interprets Q closed under the standard structural rules can define nor express validity, on pain of triviality. The results put pressure on the widespread view that there is an asymmetry between truth and validity, viz. that while the former cannot be defined within the language, the latter can. I argue that Vann McGee's and Hartry Field's arguments for the asymmetry view are problematic. (shrink)

Logical orthodoxy has it that classical first-order logic, or some extension thereof, provides the right extension of the logical consequence relation. However, together with naïve but intuitive principles about semantic notions such as truth, denotation, satisfaction, and possibly validity and other naïve logical properties, classical logic quickly leads to inconsistency, and indeed triviality. At least since the publication of Kripke’s Outline of a theory of truth , an increasingly popular diagnosis has been to restore consistency, or at least non-triviality, by (...) restricting some classical rules. Our modest aim in this note is to briefly introduce the main strands of the current debate on paradox and logical revision, and point to some of the potential challenges revisionary approaches might face, with reference to the nine contributions to the present volume.For a recent introduction to non-classical theories of truth and other semantic notions, see the excellent Beall a .. (shrink)

Richard Heck has recently drawn attention on a new version of the Liar Paradox, one which relies on logical resources that are so weak as to suggest that it may not admit of any “truly satisfying, consistent solution”. I argue that this conclusion is too strong. Heck's Liar reduces to absurdity principles that are already rejected by consistent paracomplete theories of truth, such as Kripke's and Field's. Moreover, the new Liar gives us no reasons to think that (versions of) these (...) principles cannot be consistently retained once the structural rule of contraction is restricted. I suggest that revisionary logicians have independent reasons for restricting such a rule. (shrink)

Beall and Murzi :143–165, 2013) introduce an object-linguistic predicate for naïve validity, governed by intuitive principles that are inconsistent with the classical structural rules. As a consequence, they suggest that revisionary approaches to semantic paradox must be substructural. In response to Beall and Murzi, Field :1–19, 2017) has argued that naïve validity principles do not admit of a coherent reading and that, for this reason, a non-classical solution to the semantic paradoxes need not be substructural. The aim of this paper (...) is to respond to Field’s objections and to point to a coherent notion of validity which underwrites a coherent reading of Beall and Murzi’s principles: grounded validity. The notion, first introduced by Nicolai and Rossi, is a generalisation of Kripke’s notion of grounded truth, and yields an irreflexive logic. While we do not advocate the adoption of a substructural logic, we take the notion of naïve validity to be a legitimate semantic notion that points to genuine expressive limitations of fully structural revisionary approaches. (shrink)

It is often argued that fully structural theories of truth and related notions are incapable of expressing a nonstratified notion of defectiveness. We argue that recently much-discussed non-contractive theories suffer from the same expressive limitation, provided they identify the defective sentences with the sentences that yield triviality if they are assumed to satisfy structural contraction.

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

Since Saul Kripke’s influential work in the 1970s, the revisionary approach to semantic paradox—the idea that semantic paradoxes must be solved by weakening classical logic—has been increasingly popular. In this paper, we present a new revenge argument to the effect that the main revisionary approaches breed new paradoxes that they are unable to block.

We cast doubts on the suggestion, recently made by Graham Priest, that glut theorists may express disagreement with the assertion of A by denying A. We show that, if denial is to serve as a means to express disagreement, it must be exclusive, in the sense of being correct only if what is denied is false only. Hence, it can’t be expressed in the glut theorist’s language, essentially for the same reasons why Boolean negation can’t be expressed in such a (...) language either. We then turn to an alternative proposal, recently defended by Beall (in Analysis 73(3):438–445, 2013; Rev Symb Log, 2014), for expressing truth and falsity only, and hence disagreement. According to this, the exclusive semantic status of A, that A is either true or false only, can be conveyed by adding to one’s theory a shrieking rule of the form A & ~A |- \bot, where \bot entails triviality. We argue, however, that the proposal doesn’t work either. The upshot is that glut theorists face a dilemma: they can either express denial, or disagreement, but not both. Along the way, we offer a bilateral logic of exclusive denial for glut theorists—an extension of the logic commonly called LP. (shrink)

We group the existing variants of the familiar set-theoretical and truth-theoretical paradoxes into two classes: connective paradoxes, which can in principle be ascribed to the presence of a contracting connective of some sort, and structural paradoxes, where at most the faulty use of a structural inference rule can possibly be blamed. We impute the former to an equivocation over the meaning of logical constants, and the latter to an equivocation over the notion of consequence. Both equivocation sources are tightly related, (...) and can be cleared up by adopting a particular substructural logic in place of classical logic. We then argue that our perspective can be justified via an informational semantics of contraction-free substructural logics. (shrink)

There is a natural story about what logic is that sees it as tied up with two operations: a ‘throw things into a bag’ operation and a ‘closure’ operation. In a pair of recent papers, Jc Beall has fleshed out the account of logic this leaves us with in more detail. Using Beall’s exposition as a guide, this paper points out some problems with taking the second operation to be closure in the usual sense. After pointing out these problems, I (...) then turn to fixing them in a restricted case and modulo a few simplifying assumptions. In a followup paper, the simplifications and restrictions will be removed. (shrink)

There is a strong case to be made for thinking that an obscure logic, KR, is better than classical logic and better than any relevant logic. The argument for KR over relevant logics is that KR counts disjunctive syllogism valid, and this is the biggest complaint about relevant logics. The argument for KR over classical logic depends on the normativity of logic and the paradoxes of implication. The paradoxes of implication are taken by relevant logicians to justify relevant logic, but (...) considerations on the normativity of logic show that only some of the paradoxes of implication are genuine. KR avoids all the genuine paradoxes of implication, unlike classical logic. Overall, KR avoids the genuine paradoxes of implication and avoids the major objection to relevant logics. This combination of features provides strong reason to give KR a place in the conversation about the right logic. (shrink)

Nonclassical theories of truth have in common that they reject principles of classical logic to accommodate an unrestricted truth predicate. However, different nonclassical strategies give up different classical principles. The paper discusses one criterion we might use in theory choice when considering nonclassical rivals: the maxim of minimal mutilation.

A reply to two responses to an earlier paper, "A Liar Paradox".

We argue that distinct conditionals—conditionals that are governed by different logics—are needed to formalize the rules of Truth Introduction and Truth Elimination. We show that revision theory, when enriched with the new conditionals, yields an attractive theory of truth. We go on to compare this theory with one recently proposed by Hartry Field.

Substructural solutions to the semantic paradoxes have been broadly discussed in recent years. In particular, according to the non-transitive solution, we have to give up the metarule of Cut, whose role is to guarantee that the consequence relation is transitive. This concession—giving up a meta rule—allows us to maintain the entire consequence relation of classical logic. The non-transitive solution has been generalized in recent works into a hierarchy of logics where classicality is maintained at more and more metainferential levels. All (...) the logics in this hierarchy can accommodate a truth predicate, including the logic at the top of the hierarchy—known as CMω—which presumably maintains classicality at all levels. CMω has so far been accounted for exclusively in model-theoretic terms. Therefore, there remains an open question: how do we account for this logic in proof-theoretic terms? Can there be found a proof system that admits each and every classical principle—at all inferential levels—but nevertheless blocks the derivation of the liar? In the present paper, I solve this problem by providing such a proof system and establishing soundness and completeness results. Yet, I also argue that the outcome is philosophically unsatisfactory. In fact, I’m afraid that in light of my results this metainferential solution to the paradoxes can hardly be called a “solution,” let alone a good one. (shrink)

Some theorists have developed formal approaches to truth that depend on counterexamples to the structural rules of contraction. Here, we study such approaches, with an eye to helping them respond to a certain kind of objection. We define a contractive relative of each noncontractive relation, for use in responding to the objection in question, and we explore one example: the contractive relative of multiplicative-additive affine logic with transparent truth, or MAALT. -/- .

This note shows that the permutation instructions presented by Zardini (2011) for eliminating cuts on universally quantified formulas in the sequent calculus for the noncontractive theory of truth IKTωare inadequate. To that purpose the note presents a derivation in the sequent calculus for IKTωending with an application of cut on a universally quantified formula which the permutation instructions cannot deal with. The counterexample is of the kind that leaves open the question whether cut can be shown to be eliminable in (...) the sequent calculus for IKTωwith an alternative strategy. (shrink)

Against the backdrop of the frequent comparison of theories of truth in the literature on semantic paradoxes with regard to which inferences and metainferences are deemed valid, this paper develops a novel approach to defining a binary predicate for representing the valid inferences and metainferences of a theory within the theory itself under the assumption that the theory is defined with a classical meta-theory. The aim with the approach is to obtain a tool which facilitates the comparison between a theory (...) and its competitors within the theory itself, thereby expressing the disagreement between the theories within the theories. After discussing what we can and should require of an object-linguistic representation of a theory for that purpose, this paper proposes to restrict the representation of valid metainferences to locally valid metainferences, a requirement which turns out to be \-consistent and conservative over classical first-order arithmetic. This approach is then applied to four theories definable on strong Kleene models using a labelled nested sequent calculus. (shrink)

How robust is a contraction-free approach to the semantic paradoxes? This paper aims to show some limitations with the approach based on multiplicative rules by presenting and discussing the significance of a revenge paradox using a predicate representing an alethic modality defined with infinitary rules.

The infinitary function of the truth predicate consists in its ability to express infinite conjunctions and disjunctions. A transparency principle for truth states the equivalence between a sentence and its truth predication; it requires an introduction principle—which allows the inference from “snow is white” to “the sentence ‘snow is white’ is true”—and an elimination principle—which allows the inference from “the sentence ‘snow is white’ is true” to “snow is white”. It is commonly assumed that a theory of truth needs to (...) satisfy a transparency principle to fulfil the infinitary function. Picollo and Schindler (Erkenntnis 83:899–928, 2017) argue against this idea. They prove that, given certain assumptions, an elimination principle is sufficient for the purpose. Then, they pose a challenge: to show why we should incorporate introduction principles to our theory of truth. In this essay I take on the challenge. I show that, given the authors’ assumptions, an introduction principle is also sufficient to perform the infinitary function. (shrink)

Proof-theoretic semantics is an alternative to model-theoretic semantics. It aims at explaining the meaning of the logical constants in terms of the inference rules that govern their behaviour in proofs. We argue that this must be construed as the task of explaining these meanings relative to a logic, i.e., to a consequence relation. Alas, there is no agreed set of properties that a relation must have in order to qualify as a consequence relation. Moreover, the association of a consequence relation (...) to a logical calculus is not as straightforward as it may seem. We show that these facts are problematic for the proof-theoretic project but the problems can be solved. Our thesis is that the consequence relation relevant for proof-theoretic semantics is the one given by the sequent-to-sequent derivability relation in Gentzen systems. (shrink)

Languages involving modalities and languages involving vagueness have each been thoroughly studied. On the other hand, virtually nothing has been said about the interaction of modality and vagueness. This paper aims to start filling that gap. Section 1 is a discussion of various possible sources of vague modality. Section 2 puts forward a model theory for a quantified language with operators for modality and vagueness. The model theory is followed by a discussion of the resulting logic. In Section 3, the (...) framework will permit us to address a puzzle raised by Elizabeth Barnes and Robert Williams. (shrink)

Substructural logics and their application to logical and semantic paradoxes have been extensively studied, but non-reflexive systems have been somewhat neglected. Here, we aim to fill this lacuna, at least in part, by presenting a non-reflexive logic and theory of naive consequence (and truth). We also investigate the semantics and the proof-theory of the system. Finally, we develop a compositional theory of truth (and consequence) in our non-reflexive framework.

This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...) the semantics, such as inductive skepticism, the logic of discovery, Duhem’s problem, the articulation of theories by auxiliary hypotheses, the role of serendipity in scientific knowledge, Fitch’s paradox, deductive closure of knowability, whether one can know inductively that one knows inductively, whether one can know inductively that one does not know inductively, and whether expert instruction can spread common inductive knowledge—as opposed to mere, true belief—through a community of gullible pupils. (shrink)

This special issue collects together nine new essays on logical consequence :the relation obtaining between the premises and the conclusion of a logically valid argument. The present paper is a partial, and opinionated,introduction to the contemporary debate on the topic. We focus on two influential accounts of consequence, the model-theoretic and the proof-theoretic, and on the seeming platitude that valid arguments necessarilypreserve truth. We briefly discuss the main objections these accounts face, as well as Hartry Field’s contention that such objections (...) show consequenceto be a primitive, indefinable notion, and that we must reject the claim that valid arguments necessarily preserve truth. We suggest that the accountsin question have the resources to meet the objections standardly thought to herald their demise and make two main claims: (i) that consequence, as opposed to logical consequence, is the epistemologically significant relation philosophers should be mainly interested in; and (ii) that consequence is a paradoxical notion if truth is. (shrink)

Este texto tem como objetivo apresentar a principal motivação filosófica para se defender uma teoria causal da memória, que é explicar como pode um evento que se deu no passado estar relacionado a uma experiência mnêmica que se dá no presente. Para tanto, iniciaremos apresentando a noção de memória de maneira informal e geral, para depois apresentar elementos mais detalhados. Finalizamos apresentando uma teoria causal da memória que se beneficia da noção de veritação (truthmaking).

In this paper, I explore the possibility of applying the methods and results of Judgement Aggregation to the problem of logical disagreement. I develop and evaluate different ways in which individuals who logically disagree can generate a collective logic. I prove a version of the discursive paradox, where the majority voting of a group of structural logicians can give rise to a substructural logic; then I develop a more general impossibility result. After this, I analyze different ways to avoid the (...) paradox, in particular some methods which appeal to domain restrictions. Finally, I consider the application of these results to the discussion on semantic paradoxes. (shrink)