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)

This chapter contrasts Alfred Tarski's compositional conception (whereby the truth-values of sentences are explained in terms of the referential characteristics of their component words) unfavorably with minimalism (which relies merely on the schema, ‘(p) is true ↔ p’). First, it argues against Tarski that his approach is: (i) misdirected, insofar as it doesn't elucidate our actual concept of truth, which applies to propositions rather than sentences; (ii) ill-motivated, insofar as it reflects an insistence on explicit definitions; (iii) not generally workable, (...) insofar as those definitions cannot devised for all the multifarious constructions that occur in natural languages; and (iv) pointless, insofar as it addresses no question worth answering. Second, it is shown that minimalism can be the basis for a superior treatment of the liar paradoxes. And, finally, a response is developed to the claim (Tarski, Gupta, Soames, Halbach) that Tarski-style compositional definitions are needed in order to accommodate generalizations about truth (e.g., that all instances of ‘p→p’ are true). (shrink)

In positive theories, we have an axiom scheme of comprehension for positive formulas. We study here the “generalized positive” theory GPK∞+. Natural models of this theory are hyperuniverses. The author has shown in [2] that GPK∞+ interprets the Kelley Morse class theory. Here we prove that GPK∞+ + ACWF and the Kelley-Morse class theory with the axiom of global choice and the axiom “On is ramifiable” are mutually interpretable. This shows that GPK∞+ + ACWF is a “strong” theory since “On (...) is ramifiable” implies the existence of a proper class of inaccessible cardinals. (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)

The semantic paradoxes are often associated with self-reference or referential circularity. Yablo (Analysis 53(4):251–252, 1993), however, has shown that there are infinitary versions of the paradoxes that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality. In this essay, we lay the groundwork for a general investigation into the nature of reference structures that support the semantic paradoxes and the semantic hypodoxes. We develop (...) a functionally complete infinitary propositional language endowed with a denotation assignment and extract the reference structural information in terms of graph-theoretic properties. We introduce the new concepts of dangerous and precarious reference graphs, which allows us to rigorously define the task: classify the dangerous and precarious directed graphs purely in terms of their graph-theoretic properties. Ungroundedness will be shown to fully characterize the precarious reference graphs and fully characterize the dangerous finite graphs. We prove that an undirected graph has a dangerous orientation if and only if it contains a cycle, providing some support for the traditional idea that cyclic structure is required for paradoxicality. This leaves the task of classifying danger for infinite acyclic reference graphs. We provide some compactness results, which give further necessary conditions on danger in infinite graphs, which in conjunction with a notion of self-containment allows us to prove that dangerous acyclic graphs must have infinitely many vertices with infinite out-degree. But a full characterization of danger remains an open question. In the appendices we relate our results to the results given in Cook (J Symb Log 69(3):767–774, 2004) and Yablo (2006) with respect to more restricted sentences systems, which we call $\mathcal{F}$ -systems. (shrink)

In J Philos Logic 34:155–192, 2005, Leitgeb provides a theory of truth which is based on a theory of semantic dependence. We argue here that the conceptual thrust of this approach provides us with the best way of dealing with semantic paradoxes in a manner that is acceptable to a classical logician. However, in investigating a problem that was raised at the end of J Philos Logic 34:155–192, 2005, we discover that something is missing from Leitgeb’s original definition. Moreover, we (...) show that once the appropriate repairs have been made, the resultant definition is equivalent to a version of the supervaluation definition suggested in J Philos 72:690–716, 1975 and discussed in detail in J Symb Log 51(3):663–681, 1986. The upshot of this is a philosophical justification for the simple supervaluation approach and fresh insight into its workings. (shrink)

In this rigorous investigation into the logic of truth Anil Gupta and Nuel Belnap explain how the concept of truth works in both ordinary and pathological..

The present paper suggests relative truth definability as a tool for comparing conceptual aspects of axiomatic theories of truth and gives an overview of recent developments of axiomatic theories of truth in the light of it. We also show several new proof-theoretic results via relative truth definability including a complete answer to the conjecture raised by Feferman in [13].

This is an extensively revised edition of Mr. Quine's introduction to abstract set theory and to various axiomatic systematizations of the subject.

We present a theory VF of partial truth over Peano arithmetic and we prove that VF and ID 1 have the same arithmetical content. The semantics of VF is inspired by van Fraassen's notion of supervaluation.

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.

The general notions of object- and metalanguage are discussed and as a special case of this relation an arbitrary first order language with an infinite model is expanded by a predicate symbol T0 which is interpreted as truth predicate for . Then the expanded language is again augmented by a new truth predicate T1 for the whole language plus T0. This process is iterated into the transfinite to obtain the Tarskian hierarchy of languages. It is shown that there are natural (...) points for stopping this process. The sets which become definable in suitable hierarchies are investigated, so that the relevance of the Tarskian hierarchy to some subjects of philosophy of mathematics are clarified. (shrink)

By a `denoting phrase' I mean a phrase such as any one of the following: a man, some man, any man, every man, all men, the present King of England, the present King of France, the center of mass of the solar system at the first instant of the twentieth century, the revolution of the earth round the sun, the revolution of the sun round the earth. Thus a phrase is denoting solely in virtue of its form. We may distinguish (...) three cases: (1) A phrase may be denoting, and yet not denote anything; e.g., `the present King of France'. (2) A phrase may denote one definite object; e.g., `the present King of England' denotes a certain man. (3) A phrase may denote ambiguously; e.g. `a man' denotes not many men, but an ambiguous man. The interpretation of such phrases is a matter of considerably difficulty; indeed, it is very hard to frame any theory not susceptible of formal refutation. All the difficulties with which I am acquainted are met, so far as I can discover, by the theory which I am about to explain. (shrink)

Deflationsism about truth is a pot-pourri, variously claiming that truth is redundant, or is constituted by the totality of 'T-sentences', or is a purely logical device (required solely for disquotational purposes or for re-expressing finitarily infinite conjunctions and/or disjunctions). In 1980, Hartry Field proposed what might be called a 'deflationary theory of mathematics', in which it is alleged that all uses of mathematics within science are dispensable. Field's criterion for the dispensability of mathematics turns on a property of theories, called (...) conservativeness. I present some technical results, some of which may be found in Tarski (1936), concerning the logical properties of truth theories; in particular, concerning the conservativeness of adding a truth theory for an object level language to any theory expressed in it. It transpires that various deflationary truth theories behave somewhat differently from the standard Tarskian truth theory. These results suggest that Tarskian theories of truth are not redundant or dispensable. Finally, I hint at an analogy between the behaviour of mathematical theories and of standard (Tarskian) theories of truth with respect to their indispensability to, as Quine would put, our 'scientific world-view'. (shrink)

A theory of the transfinite Tarskian hierarchy of languages is outlined and compared to a notion of partial truth by Kripke. It is shown that the hierarchy can be embedded into Kripke's minimal fixed point model. From this results on the expressive power of both approaches are obtained.

According to the disquotationalist theory of truth, the Tarskian equivalences, conceived as axioms, yield all there is to say about truth. Several authors have claimed that the expression of infinite conjunctions and disjunctions is the only purpose of the disquotationalist truth predicate. The way in which infinite conjunctions can be expressed by an axiomatized truth predicate is explored and it is considered whether the disquotationalist truth predicate is adequate for this purpose.

The paper offers a solution to the semantic paradoxes, one in which (1) we keep the unrestricted truth schema “True(A)↔A”, and (2) the object language can include its own metalanguage. Because of the first feature, classical logic must be restricted, but full classical reasoning applies in “ordinary” contexts, including standard set theory. The more general logic that replaces classical logic includes a principle of substitutivity of equivalents, which with the truth schema leads to the general intersubstitutivity of True(A) with A (...) within the language.The logic is also shown to have the resources required to represent the way in which sentences (like the Liar sentence and the Curry sentence) that lead to paradox in classical logic are “defective”. We can in fact define a hierarchy of “defectiveness” predicates within the language. Contrary to claims that any solution to the paradoxes just breeds further paradoxes (“revenge problems”) involving defectiveness predicates, there is a general consistency/conservativeness proof that shows that talk of truth and the various “levels of defectiveness” can all be made coherent together within a single object language. (shrink)

This paper is divided into two parts. Part I provides a resumé of the evolution of the notion of predicativity. Part II describes our own work on the subject.Part I§1. Conceptions of sets.Statements about sets lie at the heart of most modern attempts to systematize all (or, at least, all known) mathematics. Technical and philosophical discussions concerning such systematizations and the underlying conceptions have thus occupied a considerable portion of the literature on the foundations of mathematics.

It is well known that the following features hold of AR + T under the strong Kleene scheme, regardless of the way the language is Gödel numbered: 1. There exist sentences that are neither paradoxical nor grounded. 2. There are 2ℵ0 fixed points. 3. In the minimal fixed point the weakly definable sets (i.e., sets definable as {n∣ A(n) is true in the minimal fixed point where A(x) is a formula of AR + T) are precisely the Π1 1 sets. (...) 4. In the minimal fixed point the totally defined sets (sets weakly defined by formulae all of whose instances are true or false) are precisely the ▵1 1 sets. 5. The closure ordinal for Kripke's construction of the minimal fixed point is ωCK 1. In contrast, we show that under the weak Kleene scheme, depending on the way the Gödel numbering is chosen: 1. There may or may not exist nonparadoxical, ungrounded sentences. 2. The number of fixed points may be any positive finite number, ℵ0, or 2ℵ0 . 3. In the minimal fixed point, the sets that are weakly definable may range from a subclass of the sets 1-1 reducible to the truth set of AR to the Π1 1 sets, including intermediate cases. 4. Similarly, the totally definable sets in the minimal fixed point range from precisely the arithmetical sets up to precisely the ▵1 1 sets. 5. The closure ordinal for the construction of the minimal fixed point may be ω, ωCK 1, or any successor limit ordinal in between. In addition we suggest how one may supplement AR + T with a function symbol interpreted by a certain primitive recursive function so that, irrespective of the choice of the Godel numbering, the resulting language based on the weak Kleene scheme has the five features noted above for the strong Kleene language. (shrink)

The complexity of the set of truths of arithmetic is determined for various theories of truth deriving from Kripke and from Gupta and Herzberger.

We begin with a prepositional languageLpcontaining conjunction (Λ), a class of sentence names {Sα}αϵA, and a falsity predicateF. We (only) allow unrestricted infinite conjunctions, i.e., given any non-empty class of sentence names {Sβ}βϵB,is a well-formed formula (we will useWFFto denote the set of well-formed formulae).The language, as it stands, is unproblematic. Whether various paradoxes are produced depends on which names are assigned to which sentences. What is needed is a denotation function:For example, theLPsentence “F(S1)” (i.e.,Λ{F(S1)}), combined with a denotation functionδsuch (...) thatδ(S1)“F(S1)”, provides the (or, in this context, a)Liar Paradox.To give a more interesting example,Yablo's Paradox[4] can be reconstructed within this framework.Yablo's Paradoxconsists of an ω-sequence of sentences {Sk}kϵωwhere, for eachnϵω:WithinLPan equivalent construction can be obtained using infinite conjunction in place of universal quantification - the sentence names are {Si}iϵωand the denotation function is given by:We can express this in more familiar terms as:etc. (shrink)