Deflationists claim that the truth predicate was introduced into our language merely to full a certain logico-linguistic function. Oddly enough, the question what this function exactly consists in has received little attention. We argue that the best way of understanding the function of the truth predicate is as enabling us to mimic higher-order quantification in a first-order framework. Indeed, one can show that the full simple theory of types is reducible to disquotational principles of truth. Our analysis has important consequences (...) for our understanding of truth. In this paper, we can only touch on one of them: we will argue that the insubstantiality of truth does not imply a conservativity requirement on our best theories of truth. (shrink)

One of the main logical functions of the truth predicate is to enable us to express so-called ‘infinite conjunctions’. Several authors claim that the truth predicate can serve this function only if it is fully disquotational, which leads to triviality in classical logic. As a consequence, many have concluded that classical logic should be rejected. The purpose of this paper is threefold. First, we consider two accounts available in the literature of what it means to express infinite conjunctions with a (...) truth predicate and argue that they fail to support the necessity of transparency for that purpose. Second, we show that, with the aid of some regimentation, many expressive functions of the truth predicate can actually be performed using truth principles that are consistent in classical logic. Finally, we suggest a reconceptualisation of deflationism, according to which the principles that govern the use of the truth predicate in natural language are largely irrelevant for the question of what formal theory of truth we should adopt. Many philosophers think that the paradoxes pose a special problem for deflationists; we will argue, on the contrary, that deflationists are in a much better position to deal with the paradoxes than their opponents. (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)

Self-reference has played a prominent role in the development of metamathematics in the past century, starting with Gödel’s first incompleteness theorem. Given the nature of this and other results in the area, the informal understanding of self-reference in arithmetic has sufficed so far. Recently, however, it has been argued that for other related issues in metamathematics and philosophical logic a precise notion of self-reference and, more generally, reference is actually required. These notions have been so far elusive and are surrounded (...) by an aura of scepticism that has kept most philosophers away. In this paper I suggest we shouldn’t give up all hope. First, I introduce the reader to these issues. Second, I discuss the conditions a good notion of reference in arithmetic must satisfy. Accordingly, I then introduce adequate notions of reference for the language of first-order arithmetic, which I show to be fruitful for addressing the aforementioned issues in metamathematics. (shrink)

I apply the notions of alethic reference introduced in previous work in the construction of several classical semantic truth theories. Furthermore, I provide proof-theoretic versions of those notions and use them to formulate axiomatic disquotational truth systems over classical logic. Some of these systems are shown to be sound, proof-theoretically strong, and compare well to the most renowned systems in the literature.

Weakening classical logic is one of the most popular ways of dealing with semantic paradoxes. Their advocates often claim that such weakening does not affect non-semantic reasoning. Recently, however, Halbach and Horsten have shown that this is actually not the case for Kripke’s fixed-point theory based on the Strong Kleene evaluation scheme. Feferman’s axiomatization $\textsf{KF}$ in classical logic is much stronger than its paracomplete counterpart $\textsf{PKF}$, not only in terms of semantic but also in arithmetical content. This paper compares the (...) proof-theoretic strength of an axiomatization of Kripke’s construction based on the paraconsistent evaluation scheme of $\textsf{LP}$, formulated in classical logic with that of an axiomatization directly formulated in $\textsf{LP}$, extended with a consistency operator. The ultimate goal is to find out whether paraconsistent solutions to the paradoxes that employ consistency operators fare better in this respect than paracomplete ones. (shrink)

I put forward precise and appealing notions of reference, self-reference, and well-foundedness for sentences of the language of first-order Peano arithmetic extended with a truth predicate. These notions are intended to play a central role in the study of the reference patterns that underlie expressions leading to semantic paradox and, thus, in the construction of philosophically well-motivated semantic theories of truth.

Truth predicates are widely believed to be capable of serving a certain logical or quasi-logical function. There is little consensus, however, on the exact nature of this function. We offer a series of formal results in support of the thesis that disquotational truth is a device to simulate higher-order resources in a first-order setting. More specifically, we show that any theory formulated in a higher-order language can be naturally and conservatively interpreted in a first-order theory with a disquotational truth or (...) truth-of predicate. In the first part of the paper we focus on the relation between truth and full impredicative sentential quantification. The second part is devoted to the relation between truth-of and full impredicative predicate quantification. (shrink)

Stephen Yablo [23,24] introduces a new informal paradox, constituted by an infinite list of semi-formalized sentences. It has been shown that, formalized in a first-order language, Yablo’s piece of reasoning is invalid, for it is impossible to derive falsum from the sequence, due mainly to the Compactness Theorem. This result casts doubts on the paradoxical character of the list of sentences. After identifying two usual senses in which an expression or set of expressions is said to be paradoxical, since second-order (...) languages are not compact, I study the paradoxicality of Yablo’s list within these languages. While non-paradoxical in the first sense, the second-order version of the list is a paradox in our second sense. I conclude that this suffices for regarding Yablo’s original list as paradoxical and his informal argument as valid. (shrink)

It is widely accepted that a theory of truth for arithmetic should be consistent, but -consistency is a highly desirable feature for such theories. The point has already been made for first-order languages, though the evidence is not entirely conclusive. We show that in the second-order case the consequence of adopting -inconsistent theories of truth are considered: the revision theory of nearly stable truth T # and the classical theory of symmetric truth FS. Briefly, we present some conceptual problems with (...) ω-inconsistent theories, and demonstrate some technical results that support our criticisms of such theories. (shrink)

A major challenge in the philosophy of mathematics is to explain how mathematical language can pick out unique structures and acquire determinate content. In recent work, Button and Walsh have introduced a view they call ‘internalism’, according to which mathematical content is explained by internal categoricity results formulated and proven in second-order logic. In this paper, we critically examine the internalist response to the challenge and discuss the philosophical significance of internal categoricity results. Surprisingly, as we argue, while internalism arguably (...) explains how we pick out unique mathematical structures, this does not suffice to account for the determinacy of mathematical discourse. (shrink)

The Yablo Paradox’ main interest lies on its prima facie non-circular character, which many have doubted, specially when formulated in an extension of the language of firstorder arithmetic. Particularly, Priest (1997) and Cook (2006, forthcoming) provided contentious arguments in favor of circularity. My aims in this note are (i) to show that the notion of circularity involved in the debate so far is defective, (ii) to provide a new sound and useful partial notion of circularity and (iii) to show there (...) is a non-circular formulation of the list in an extension of the language of first-order arithmetic according to the new notion. El interés principal de la Paradoja de Yablo yace en su carácter prima facie no circular, el cual ha sido puesto en duda especialmente con respecto a la formulación de la paradoja en una extensión del lenguaje de la aritmética de primer orden. Particularmente, Priest (1997) y Cook (2006, en prensa) formularon argumentos contenciosos a favor de la circularidad. los objetivos de esta nota son (i) señalar que la noción de circularidad utilizada hasta el momento en el debate es defectuosa, (ii) ofrecer una nueva noción parcial adecuada y útil de circularidad y (iii) mostrar que existe una formulación no circular de la lista en una extensión del lenguaje de la aritmética de primer orden de acuerdo con la nueva noción. (shrink)

In the originally published version of this manuscript, several errors were noted and listed in this corrigendum. The author apologises for these inaccuracies.

De acuerdo con Shapiro , el deflacionismo debe buscar la conservatividad de sus teorías de la verdad sobre cualquier teoría base. De lo contrario, la noción de verdad que ellas presentan daría lugar a más afirmaciones acerca de la ontología de la teoría base que ésta misma. Así, la verdad tendría poder explicativo y, por tanto, sería en algún sentido una noción metafísicamente sustantiva. El objetivo del artículo es rechazar esta tesis para algunas teorías de la verdad cuyos axiomas son (...) instancias del esquema Tde Tarski, mostrando que las causas de la no conservatividad de estas teorías respecto de teorías base no descansan en sus principios de la verdad sino en la necesidad de introducir en el lenguaje de la teoría base y en su ontología los objetos de los cuales tiene sentido predicar verdad, previamente a la adopción de cualesquiera principios para el predicado veritativo. Shapiro argues that deflationist theories of truth must be conservative over any base theory. For otherwise the principles of truth involved in them would state more about the ontology of the base theory than the base theory itself. Then, truth would have explanatory power, and the deflationist would tie herself down to a substancial notion. The aim of this paper is to argue against Shapiro’s thesis, showing that the real causes of the non-conservativeness of those deflationist theories whose axioms are given by some restricted vesion of the T-scheme do not rely on their truth principles at all. On the contrary, non-conservativeness in these cases depends on the need to add to the language of the base theory those objects than may be true, before adopting such and such principles of truth. (shrink)