Conservativeness has been proposed as an important requirement for deflationary truth theories. This in turn gave rise to the so-called ‘conservativeness argument’ against deflationism: a theory of truth which is conservative over its base theory S cannot be adequate, because it cannot prove that all theorems of S are true. In this paper we show that the problems confronting the deflationist are in fact more basic: even the observation that logic is true is beyond his reach. This seems to conflict (...) with the deflationary characterization of the role of the truth predicate in proving generalizations. However, in the final section we propose a way out for the deflationist — a solution that permits him to accept a strong theory, having important truth-theoretical generalizations as its theorems. (shrink)

This book is well known for its proof that many mathematical systems - including lattice theory and closure algebras - are undecidable. It consists of three treatises from one of the greatest logicians of all time: "A General Method in Proofs of Undecidability," "Undecidability and Essential Undecidability in Mathematics," and "Undecidability of the Elementary Theory of Groups.".

Hartry Field has suggested that we should adopt at least a methodological deflationism: [W]e should assume full-fledged deflationism as a working hypothesis. That way, if full-fledged deflationism should turn out to be inadequate, we will at least have a clearer sense than we now have of just where it is that inflationist assumptions ... are needed. I argue here that we do not need to be methodological deflationists. More pre-cisely, I argue that we have no need for a disquotational truth-predicate; (...) that the word true, in ordinary language, is not a disquotational truth-predicate; and that it is not at all clear that it is even possible to introduce a disquotational truth-predicate into ordinary language. If so, then we have no clear sense how it is even possible to be a methodological deflationist. My goal here is not to convince a committed deflationist to abandon his or her position. My goal, rather, is to argue, contrary to what many seem to think, that reflection on the apparently trivial character of T-sentences should not incline us to deflationism. (shrink)

It is well known that Tarski proved a result which can be stated roughly as: no sufficiently rich, consistent, classical language can contain its own truth definition. Tarski's way around this problem is to deal with two languages at a time, an object language for which we are defining truth and a metalanguage in which the definition occurs. An obvious question then is: under what conditions can we construct a definition of truth for a given object language. Tarski claims that (...) it is necessary and sufficient that the metalanguage be "essentially richer". Our contention, put bluntly, is that this claim deserves more scrutiny from philosophers than it usually gets and in fact is false unless "essentially richer" means nothing else than "sufficient to contain a truth definition for the object language.". (shrink)

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.

This book, written by one of the most distinguished of contemporary philosophers of mathematics, is a fully rewritten and updated successor to the author's earlier The Unprovability of Consistency. Its subject is the relation between provability and modal logic, a branch of logic invented by Aristotle but much disparaged by philosophers and virtually ignored by mathematicians. Here it receives its first scientific application since its invention. Modal logic is concerned with the notions of necessity and possibility. What George Boolos does (...) is to show how the concepts, techniques, and methods of modal logic shed brilliant light on the most important logical discovery of the twentieth century: the incompleteness theorems of Kurt Godel and the 'self-referential' sentences constructed in their proof. The book explores the effects of reinterpreting the notions of necessity and possibility to mean provability and consistency. (shrink)

In this paper, we characterize the strength of the predicative Frege hierarchy, , introduced by John Burgess in his book [J. Burgess, Fixing frege, in: Princeton Monographs in Philosophy, Princeton University Press, Princeton, 2005]. We show that and are mutually interpretable. It follows that is mutually interpretable with Q. This fact was proved earlier by Mihai Ganea in [M. Ganea, Burgess’ PV is Robinson’s Q, The Journal of Symbolic Logic 72 619–624] using a different proof. Another consequence of the our (...) main result is that is mutually interpretable with Kalmar Arithmetic . The fact that interprets EA was proved earlier by Burgess. We provide a different proof. Each of the theories is finitely axiomatizable. Our main result implies that the whole hierarchy taken together, , is not finitely axiomatizable. What is more: no theory that is mutually locally interpretable with is finitely axiomatizable. (shrink)

Alfred Tarski (1944) wrote that "the condition of the 'essential richness' of the metalanguage proves to be, not only necessary, but also sufficient for the construction of a satisfactory definition of truth." But it has remained unclear what Tarski meant by an 'essentially richer' metalanguage. Moreover, DeVidi and Solomon (1999) have argued in this Journal that there is nothing that Tarski could have meant by that phrase which would make his pronouncement true. We develop an answer to the historical question (...) of what Tarski meant by 'essentially richer' and pinpoint the general result that stands behind his essential richness claim. In defense of Tarski, we then show that each of the several arguments of DeVidi and Solomon are either moot or mistaken. One of the fruits of our investigation is the reclamation of what Tarski took to be his central result on truth. This is a reclamation since: (i) if one does not understand 'essential richness', one does not know what that result is, and (ii) we must unearth a heretofore unrecognized change that occurs in Tarski's view - an alteration of his main thesis in light of a failing he discovered in it. (shrink)

This is a book that every enthusiast for Gödel’s proofs of his incompleteness theorems will want to own. It gives an up-to-date account of connections between systems of modal logic and results on provability in formal systems for arithmetic, analysis, and set theory.

In the present paper the well-known Gödels – Churchs argument concerning the undecidability of logic (of the first order functional calculus) is exhibited in a way which seems to be philosophically interestingfi The natural numbers are not used. (Neither Chinese Theorem nor other specifically mathematical tricks are applied.) Only elementary logic and very simple set-theoretical constructions are put into the proof. Instead of the arithmetization I use the theory of concatenation (formalized by Alfred Tarski). This theory proves to be an (...) appropriate tool. The decidability is defined directly as the property of graphical discernibility of formulas. (shrink)

This paper contains a careful derivation of principles of Interpretability Logic valid in extensions of I0+1.