An old and well-known objection to non-classical logics is that they are too weak; in particular, they cannot prove a number of important mathematical results. A promising strategy to deal with this objection consists in proving so-called recapture results. Roughly, these results show that classical logic can be used in mathematics and other unproblematic contexts. However, the strategy faces some potential problems. First, typical recapture results are formulated in a purely logical language, and do not generalize nicely to languages containing (...) the kind of vocabulary that usually motivates non-classical theories—for example, a language containing a naïve truth predicate. Second, proofs of recapture results typically employ classical principles that are not valid in the targeted non-classical system; hence, non-classical theorists do not seem entitled to those results. In this paper, we analyze these problems and provide solutions on behalf of non-classical theorists. To address the first problem, we provide a novel kind of recapture result, which generalizes nicely to a truth-theoretic language. As for the second problem, we argue that it relies on an ambiguity and that, once the ambiguity is removed, there are no reasons to think that non-classical logicians are not entitled to their recapture results. (shrink)

In §2-4, I survey three extant ways of making sense of indeterminate truth and find each of them wanting. All the later sections of the paper are concerned with showing that the most promising way of making sense of indeterminate truth is via either a theory of truthmaker gaps or via a theory of truthmaking gaps. The first intimations of a truthmaker–truthmaking gap theory of indeterminacy are to be found in Quine (1981). In §5, we see how Quine proposes to (...) solve Unger’s problem of the many via positing the possibility of groundless truth. In §6, I elaborate the truthmaker gap model of indeterminacy first sketched by Sorensen (2001, ch.11) and use it to give a reductive analysis of indeterminate truth. In §7, I briefly assess what kind of formal framework can best express the possibility of truthmaker gaps. In §8, I contrast what I dub ‘the ordinary conception of worldly indeterminacy’ with Williamson’s conception of worldly indeterminacy. In §9, I show how one can distinguish linguistic from worldly indeterminacy on a truthmaker gap conception. In §10, I briefly sketch the relationship between truthmaker gaps and ignorance. In §11, I assess whether a truthmaker gap conception of vagueness is really just a form of epistemicism. In §12, I propose that truthmaker gaps can yield a plausible model of (semantic) presupposition failure. In §13, in response to the worry that a truthmaker gap conception of indeterminacy is both parochial and controversial—since it commits us to an implausibly strong theory of truthmaking—I set forth a truthmaking gap conception of indeterminacy. In §14, I answer the worry that groundless truths, of whatever species, are just unacceptably queer. A key part of this answer is that a truthmaker–truthmaking gap model of indeterminacy turns out to be considerably less queer than any model of indeterminacy which gives up on Tarski’s T-schema for truth (and cognate schemas). (shrink)

What requirements must deflationary formal theories of truth satisfy? This chapter argues against the widely accepted view that compositional and Tarskian theories of truth are substantial or otherwise unacceptable to deflationists. First, two purposes that a formal truth theory can serve are distinguished: one descriptive, the other logical (i.e., to characterise the correctness of inferences involving ‘true’). The chapter argues that the most compelling arguments for the incompatibility of compositional and Tarskian theories concern descriptive theories only. -/- Second, two requirements (...) that any deflationist truth theory intended to serve a logical purpose must satisfy are put forward. These requirements, it is argued, suggest that (i) many well-known compositional and Tarskian theories are acceptable from a deflationist standpoint (including CT); (ii) certain other popular theories of truth (including KF and FS) are not similarly acceptable; (iii) there are no conclusive reasons to impose a conservativeness requirement on deflationary theories of truth. (shrink)

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

This paper develops the idea that valid arguments are equivalent to true conditionals by combining Kripke’s theory of truth with the evidential account of conditionals offered by Crupi and Iacona. As will be shown, in a first-order language that contains a naïve truth predicate and a suitable conditional, one can define a validity predicate in accordance with the thesis that the inference from a conjunction of premises to a conclusion is valid when the corresponding conditional is true. The validity predicate (...) so defined significantly increases our expressive resources and provides a coherent formal treatment of paradoxical arguments. (shrink)

A natural suggestion and increasingly popular account of how to revise our logical beliefs treats revision of logic analogously to the revision of scientific theories. I investigate this approach and argue that simple applications of abductive methodology to logic result in revision-cycles, developing a detailed case study of an actual dispute with this property. This is problematic if we take abductive methodology to provide justification for revising our logical framework. I then generalize the case study, pointing to similarities with more (...) recent and popular heterodox logics such as naïve logics of truth. I use this discussion to motivate a constraint—logical partisanhood—on the uses of such methodology: roughly: both the proposed alternative and our actual background logic must be able to agree that moving to the alternative logic is no worse than staying put. (shrink)

We locate winning strategies for various ${\mathrm{\Sigma }}_{3}^{0}$ -games in the L-hierarchy in order to prove the following: Theorem 1. KP+Σ₂-Comprehension $\vdash \exists \alpha L_{\alpha}\ models"\Sigma _{2}-{\bf KP}+\Sigma _{3}^{0}-\text{Determinacy}."$ Alternatively: ${\mathrm{\Pi }}_{3}^{1}\text{\hspace{0.17em}}-{\mathrm{C}\mathrm{A}}_{0}\phantom{\rule{0ex}{0ex}}$ "there is a β-model of ${\mathrm{\Delta }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0}\text{\hspace{0.17em}}\text{\hspace{0.17em}}+\text{\hspace{0.17 em}}{\mathrm{\Sigma }}_{3}^{0}$ -Determinacy." The implication is not reversible. (The antecedent here may be replaced with ${\mathrm{\Pi }}_{3}^{1}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\left({\mathrm{\Pi }}_{3}^{1}\right)-{\mathrm{C}\mathrm{A}}_{0}:\text{\hspace{0.17em}}{\mathrm{\Pi }}_{3}^{1}$ instances of Comprehension with only ${\mathrm{\Pi }}_{3}^{1}$ -lightface definable parameters—or even weaker theories.) Theorem 2. KP +Δ₂-Comprehension +Σ₂-Replacement + ${\mathrm{\Sigma }}_{3}^{0}\phantom{\rule{0ex}{0ex}}$ -Determinacy. (Here AQI (...) is the assertion that every arithmetical quasi-inductive definition converges.) Alternatively: $\Delta _{3}^{1}{\rm CA}_{0}+{\rm AQI}\nvdash \Sigma _{3}^{0}$ -Determinacy. Hence the theories: ${\mathrm{\Pi }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0},\text{\hspace{0.17em}}{\mathrm{\Delta }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0}+\text{\hspace{0.17em}}{\mathrm{\Sigma }}_{3}^{0}-\mathrm{D}\mathrm{e}\mathrm{t}\phantom{\rule{0ex}{0ex}}$ -Det, ${\mathrm{\Delta }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0}+\mathrm{A}\mathrm{Q}\mathrm{I}$ , and ${\mathrm{\Delta }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0}\phantom{\rule{0ex}{0ex}}$ are in strictly descending order of strength. (shrink)

We show that the set of ultimately true sentences in Hartry Field's Revenge-immune solution model to the semantic paradoxes is recursively isomorphic to the set of stably true sentences obtained in Hans Herzberger's revision sequence starting from the null hypothesis. We further remark that this shows that a substantial subsystem of second-order number theory is needed to establish the semantic values of sentences in Field's relative consistency proof of his theory over the ground model of the standard natural numbers: -CA0 (...) (second-order number theory with a -comprehension axiom scheme) is insufficient. We briefly consider his claim to have produced a solution to the semantic paradoxes by introducing this conditional. We remark that the notion of a operator can be introduced in other settings. (shrink)

We consider notions of truth and logical validity defined in various recent constructions of Hartry Field. We try to explicate his notion of determinate truth by clarifying the path-dependent hierarchies of his determinateness operator.

A correction is needed to our paper: to the definition contained within the statement of Lemma 1.5 and thus arguments around it in §3.

We show how in the hierarchies${F_\alpha }$of Fieldian truth sets, and Herzberger’s${H_\alpha }$revision sequence starting from any hypothesis for${F_0}$ that essentially each${H_\alpha }$ carries within it a history of the whole prior revision process.As applications we provide a precise representation for, and a calculation of the length of, possiblepath independent determinateness hierarchiesof Field’s construction with a binary conditional operator. We demonstrate the existence of generalized liar sentences, that can be considered as diagonalizing past the determinateness hierarchies definable in Field’s recent (...) models. The ‘defectiveness’ of such diagonal sentences necessarily cannot be classified by any of the determinateness predicates of the model. They are ‘ineffable liars’. We may consider them a response to the claim of Field that ‘the conditional can be used to show that the theory is not subject to “revenge problems”.’. (shrink)

We sketch a broadening of the Gupta-Belnap notion of a circular or revision theoretic definition into that of a more generalized form incorporating ideas of Kleene’s generalized or higher type recursion. This thereby connects the philosophically motivated, and derived, notion of a circular definition with an older form of definition by recursion using functionals, that is functions of functions, as oracles. We note that Gupta and Belnap’s notion of ‘categorical in L’ can be formulated in at least one of these (...) schemes. (shrink)

We represent truth sets for a variety of the well known semantic theories of truth as those sets consisting of all sentences for which a player has a winning strategy in an infinite two person game. The classifications of the games considered here are simple, those over the natural model of arithmetic being all within the arithmetical class of $\Sum_{3}^{0}$.

In Saving Truth from Paradox, Hartry Field presents and defends a theory of truth with a new conditional. In this paper, I present two criticisms of this theory, one concerning its assessments of validity and one concerning its treatment of truth-preservation claims. One way of adjusting the theory adequately responds to the truth-preservation criticism, at the cost of making the validity criticism worse. I show that in a restricted setting, Field has a way to respond to the validity criticism. I (...) close with some general considerations on the use of revision-theoretic methods in theories of truth. (shrink)

There is a standard objection against purported explanations of how a language L can express the notion of being a true sentence of L. According to this objection, such explanations avoid one paradox (the Liar) only to succumb to another of the same kind. Even if L can contain its own truth predicate, we can identify another notion it cannot express, on pain of contradiction via Liar-like reasoning. This paper seeks to undermine such ‘revenge’ by arguing that it presupposes a (...) dubious assumption about the linguistic expression of concepts. Successful revenge would require that there be a notion other than truth that plays the same role with respect to concept-expression that truth is naturally thought to play before we are confronted with the Liar paradox. (shrink)

Kripke’s theory of truth succeeded in providing a trivalent semantics for a language that contains its own truth predicate and means of self-reference; but it did so by radically restricting the expressive power of the logic. In Kripke’s analysis, the Liar (e.g. This very sentence is not true) receives the indeterminate truth value; but the logic cannot express the fact that the Liar is something other than true: in order to do so, a weak negation not* would be needed, but (...) it would also make the logic inconsistent (because the ‘Super Liar’ This very sentence is not* true could not be assigned any truth value). Taking a hint from the quantificational form of the problematic sentences (… is something other than true), we define a hierarchy of negations which each quantifies over a domain of truth values, assimilated to ordinals. The resulting logic has as many negations and truth values as there are ordinals. Unlike Kripke’s logic, it enjoys a form of expressive completeness. And although the logic is not monotonic, we show that under broad conditions we can construct a variety of fixed points; one of them emulates Kripke’s ‘least fixed point’, while another one assigns a different truth value to each Super Liar. (shrink)

In this paper we shall introduce two types of contextual-hierarchical approaches to the strengthened liar problem. These approaches, which we call the ‘standard’ and the ‘alternative’ ch-reconstructions of the strengthened liar problem, differ in their philosophical view regarding the nature of truth and the relation between the truth predicates T r n and T r n+1 of different hierarchy-levels. The basic idea of the standard ch-reconstruction is that the T r n+1-schema should hold for all sentences of \. In contrast, (...) the alternative ch-reconstruction, for which we shall argue in section four, is motivated by the idea that T r n and T r n+1 are coherent in the sense that the same sentences of \ should be true according to T r n and T r n+1. We show that instances of the standard ch-reconstruction can be obtained by iterating Kripke’s strong Kleene jump operator. Furthermore, we will demonstrate how instances of the alternative ch-reconstruction can be obtained by a slight modification of the iterated axiom system KF and of the iterated strong Kleene jump operator. (shrink)

T-biconditionals have often been regarded as insufficient as axioms for truth. This verdict is based on Tarski’s observation that the typed T-sentences suffer from deductive weakness. As indicated by McGee, the situation might change radically if we consider type-free disquotational theories of truth. However, finding a well-motivated set of untyped T-biconditionals that is consistent and recursively enumerable has proven to be very difficult. Moreover, some authors ) have argued that any solution to the semantic paradoxes necessarily involves ‘inflationary’ means, thus (...) spelling doom to deflationist and minimalist truth theories in particular. The situation is indeed worrisome as formal theories of minimalist truth are missing so far. This makes it very hard to properly evaluate the tenets of minimalism. In the present article, we will show how to find safe instances of the T-schema just by relying on syntactic features of the sentences of our language—in particular, we will explore Quine’s idea of stratification. Based on that, we will introduce some disquotational truth theories that are deductively very strong. (shrink)

In recent work Philip Welch has proven the existence of ‘ineffable liars’ for Hartry Field’s theory of truth. These are offered as liar-like sentences that escape classification in Field’s transfinite hierarchy of determinateness operators. In this article I present a slightly more general characterization of the ineffability phenomenon, and discuss its philosophical significance. I show the ineffable sentences to be less ‘liar-like’ than they appear in Welch’s presentation. I also point to some open technical problems whose resolution would greatly clarify (...) the philosophical issues raised by the ineffability phenomenon. (shrink)

Revenge arguments purport to show that any proposed solution to the semantic paradoxes generates new paradoxes that prove that solution to be inadequate. In this paper, I focus on revenge arguments that employ the model-theoretic semantics of a target theory and I argue, contra the current revenge-theoretic wisdom, that they can constitute genuine expressive limitations. I consider the anti-revenge strategy elaborated by Field and argue that it does not offer a way out of the revenge problem. More generally, I argue (...) that the difference between ‘standard’ and ‘revenge’ paradoxes is ill-conceived and should be abandoned. This will contribute to show that the theories that provide a uniform account of truth and other semantic notions are the ones best equipped to avoid the paradoxes altogether—‘standard’ and ‘revenge’ alike. (shrink)

The sentences employed in semantic paradoxes display a wide range of semantic behaviours. However, the main theories of truth currently available either fail to provide a theory of paradox altogether, or can only account for some paradoxical phenomena by resorting to multiple interpretations of the language. In this paper, I explore the wide range of semantic behaviours displayed by paradoxical sentences, and I develop a unified theory of truth and paradox, that is a theory of truth that also provides a (...) unified account of paradoxical sentences. The theory I propose here yields a threefold classification of paradoxical sentences – liar-like sentences, truth-teller-like sentences, and revenge sentences. Unlike existing treatments of semantic paradox, the theory put forward in this paper yields a way of interpreting all three kinds of paradoxical sentences, as well as unparadoxical sentences, within a single model. (shrink)

Kripke’s theory of truth, 690–716; 1975) has been very successful but shows well-known expressive difficulties; recently, Field has proposed to overcome them by adding a new conditional connective to it. In Field’s theories, desirable conditional and truth-theoretic principles are validated that Kripke’s theory does not yield. Some authors, however, are dissatisfied with certain aspects of Field’s theories, in particular the high complexity. I analyze Field’s models and pin down some reasons for discontent with them, focusing on the meaning of the (...) new conditional and on the status of the principles so successfully recovered. Subsequently, I develop a semantics that improves on Kripke’s theory following Field’s program of adding a conditional to it, using some inductive constructions that include Kripke’s one and feature a strong evaluation for conditionals. The new theory overcomes several problems of Kripke’s one and, although weaker than Field’s proposals, it avoids the difficulties that affect them; at the same time, the new theory turns out to be quite simple. Moreover, the new construction can be used to model various conceptions of what a conditional connective is, in ways that are precluded to both Kripke’s and Field’s theories. (shrink)

I here investigate the sense in which diagonalization allows one to construct sentences that are self-referential. Truly self-referential sentences cannot be constructed in the standard language of arithmetic: There is a simple theory of truth that is intuitively inconsistent but is consistent with Peano arithmetic, as standardly formulated. True self-reference is possible only if we expand the language to include function-symbols for all primitive recursive functions. This language is therefore the natural setting for investigations of self-reference.

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)

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)

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)

This article outlines what a formal theory of truth should be like, at least at first glance. As not all of the stated constraints can be satisfied at the same time, in view of notorious semantic paradoxes such as the Liar paradox, we consider the maximal consistent combinations of these desiderata and compare their relative advantages and disadvantages.

This article explores ways in which the Revision Theory of Truth can be expressed in the object language. In particular, we investigate the extent to which semantic deficiency, stable truth, and nearly stable truth can be so expressed, and we study different axiomatic systems for the Revision Theory of Truth.

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

This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → (B → C)⊩B → (A → C) trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ((A → B)∧ (B → C)) → (A → C) and (A → ¬A) → ¬A, the fusion connective and the Ackermann constant. An (...) overview over various ways to formulate Leibniz’s law in non-classical logics and two new triviality proofs for naïve set theory are also provided. (shrink)

If properties are to play a useful role in semantics, it is hard to avoid assuming the naïve theory of properties: for any predicate Θ(x), there is a property such that an object o has it if and only if Θ(o). Yet this appears to lead to various paradoxes. I show that no paradoxes arise as long as the logic is weakened appropriately; the main difficulty is finding a semantics that can handle a conditional obeying reasonable laws without engendering paradox. (...) I employ a semantics which is infinite-valued, with the values only partially ordered. Can the solution be adapted to naïve set theory? Probably not, but limiting naïve comprehension in set theory is perfectly satisfactory, whereas this is not so in a property theory used for semantics. (shrink)

It might be thought that we could argue for the consistency of a mathematical theory T within T, by giving an inductive argument that all theorems of T are true and inferring consistency. By Gödel's second incompleteness theorem any such argument must break down, but just how it breaks down depends on the kind of theory of truth that is built into T. The paper surveys the possibilities, and suggests that some theories of truth give far more intuitive diagnoses of (...) the breakdown than do others. The paper concludes with some morals about the nature of validity and about a possible alternative to the idea that mathematical theories are indefinitely extensible. (shrink)

Are there questions for which 'there is no determinate fact of the matter' as to which answer is correct? Most of us think so, but there are serious difficulties in maintaining the view, and in explaining the idea of determinateness in a satisfactory manner. The paper argues that to overcome the difficulties, we need to reject the law of excluded middle; and it investigates the sense of 'rejection' that is involved. The paper also explores the logic that is required if (...) we reject excluded middle, with special emphasis on the conditional. There is also discussion of higher order indeterminacy (in several different senses) and of penumbral connections; and there is a suggested definition of determinateness in terms of the conditional and a discussion of the extent to which the notion of determinateness is objective. And there are suggestions about a unified treatment of vagueness and the semantic paradoxes. (shrink)

Tim Maudlin’s Truth and Paradox is terrific. In some sense its solution to the paradoxes is familiar—the book advocates an extension of what’s called the Kripke-Feferman theory (although the definition of validity it employs disguises this fact). Nonetheless, the perspective it casts on that solution is completely novel, and Maudlin uses this perspective to try to make the prima facie unattractive features of this solution seem palatable, indeed inescapable. Moreover, the book deals with many important issues that most writers on (...) the paradoxes never deal with, including issues about the application of the Gödel theorems to powerful theories that include our theory of truth. The book includes intriguing excursions into general metaphysics, e.g. on the nature of logic, facts, vagueness, and much more; and it’s lucid and lively, a pleasure to read. It will interest a wide range of philosophers. (shrink)

elaboration of the last part of my Tarski Lecture, “Truth unbound”, UC Berkeley, 3 April 2006, and of the lecture, “A nicer formal theory of non-hierarchical truth”, Workshop on Mathematical Methods in Philosophy, Banff , 18-23 Feb. 2007.

Two periods in the history of logic and philosophy are characterized notably by vivid interest in self-referential paradoxical sentences in general, and Liar sentences in particular: the later medieval period (roughly from the 12th to the 15th century) and the last 100 years. In this paper, I undertake a comparative taxonomy of these two traditions. I outline and discuss eight main approaches to Liar sentences in the medieval tradition, and compare them to the most influential modern approaches to such sentences. (...) I also emphasize the aspects of each tradition that find no counterpart in the other one. It is expected that such a comparison may point in new directions for future research on the paradoxes; indeed, the present analysis allows me to draw a few conclusions about the general nature of Liar sentences, and to identify aspects that would require further investigation. (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)

In this paper, we distinguish two versions of Curry's paradox: c-Curry, the standard conditional-Curry paradox, and v-Curry, a validity-involving version of Curry's paradox that isn’t automatically solved by solving c-curry. A unified treatment of curry paradox thus calls for a unified treatment of both c-Curry and v-Curry. If, as is often thought, c-Curry paradox is to be solved via non-classical logic, then v-Curry may require a lesson about the structure—indeed, the substructure—of the validity relation itself.

An increasing amount of contemporary philosophy of mathematics posits, and theorizes in terms of special kinds of mathematical modality. The goal of this paper is to bring recent work on higher-order metaphysics to bear on the investigation of these modalities. The main focus of the paper will be views that posit mathematical contingency or indeterminacy about statements that concern the ‘width’ of the set theoretic universe, such as Cantor’s continuum hypothesis. Within a higher-order framework I show that contingency about the (...) width of the set-theoretic universe refutes two orthodoxies concerning the structure of modal reality: the view that the broadest necessity has a logic of S5, and the ‘Leibniz biconditionals’ stating that what is possible, in the broadest sense of _possible_, is what is true in some possible world. Nonetheless, I suggest that the underlying picture of modal set-theory is coherent and has attractions. (shrink)

Logic: the Basics is an accessible introduction to the core philosophy topic of standard logic. Focussing on traditional Classical Logic the book deals with topics such as mathematical preliminaries, propositional logic, monadic quantified logic, polyadic quantified logic, and English and standard ‘symbolic transitions’. With exercises and sample answers throughout this thoroughly revised new edition not only comprehensively covers the core topics at introductory level but also gives the reader an idea of how they can take their knowledge further and the (...) philosophical questions around logic. -/- Logic: the Basics is essential reading for first-year undergraduate philosophy students on standard introductory logic courses. (shrink)

According to the deflationary theory of truth, to assert that a statement is true is just to assert the statement itself. For example, to say that ‘snow is white’ is true, or that it is true that snow is white, is equivalent to saying simply that snow is white, and this, according to the deflationary theory, is all that can be said significantly about the truth of ‘snow is white’.

Definitional and axiomatic theories of truth -- Objects of truth -- Tarski -- Truth and set theory -- Technical preliminaries -- Comparing axiomatic theories of truth -- Disquotation -- Classical compositional truth -- Hierarchies -- Typed and type-free theories of truth -- Reasons against typing -- Axioms and rules -- Axioms for type-free truth -- Classical symmetric truth -- Kripke-Feferman -- Axiomatizing Kripke's theory in partial logic -- Grounded truth -- Alternative evaluation schemata -- Disquotation -- Classical logic -- Deflationism (...) -- Reflection -- Ontological reduction -- Applying theories of truth. (shrink)

Deflationism about truth, what is often simply called “deflationism”, is really not so much a theory of truth in the traditional sense, as it is a different, newer sort of approach to the topic. Traditional theories of truth are part of a philosophical debate about the nature of a supposed property of truth. Philosophers offering such theories often make suggestions like the following: truth consists in correspondence to the facts; truth consists in coherence with a set of beliefs or propositions; (...) truth is what is acceptable in the ideal limit of inquiry. According to deflationists, such suggestions are mistaken, and, moreover, they all share a common mistake. The common mistake is to assume that truth has a nature of the kind that philosophers might find out about and develop theories of. The main idea of the deflationary approach is (a) that all that can be significantly said about truth is exhausted by an account of the role of the expression ‘true’ or of the concept of truth in our talk and thought, and (b) that, by contrast with what traditional views assume, this role is neither metaphysically substantive nor explanatory. For example, according to deflationary accounts, to say that ‘snow is white’ is true, or that it is true that snow is white, is in some sense strongly equivalent to saying simply that snow is white, and this, according to the deflationary approach, is all that can be said significantly about the truth of ‘snow is white’. Philosophers looking for some underlying nature of some truth property that is attributed with the use of the expression ‘true’ are bound to be frustrated, the deflationist says, because they are looking for something that isn’t there. Deflationism comprises a variety of different versions, each of which have gone by different names, including at least the following: disquotationalism, minimalism, prosententialism, the redundancy theory, the disappearance theory, the no-truth theory. There has not always been terminological consensus in the literature about how to use these labels: sometimes they have been used interchangeably; sometimes they have been used to mark distinctions between different developments of the same general approach. The actual variety of deflationary views has not always been clear in discussions of this approach, especially in the earlier literature, where important differences are occasionally missed. To help clear this up, we will use ‘deflationism’ to denote the general approach we want to discuss and reserve other names for specific versions of that approach. (shrink)

In the fifth of his John Locke Lectures, Robert Brandom takes up the challenge to define a formal semantics for modelling conceptual contents according to his normative analysis of linguistic practices. The project is to exploit the notion of incompatibility in order to directly define a modally robust relation of entailment. Unfortunately, it can be proved that, in the original definition, the modal system represented by Incompatibility Semantics (IS) collapses into propositional calculus. In this paper I show how IS can (...) be technically amended so to overcome this failure: the required modifications are already known and consist in adapting and including the main notions of Kripke's standard framework of possible worlds. I also show that the modifications do not jeopardize Brandom's original project. (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)