Mathematics depends on proofs, and proofs must begin somewhere, from some fundamental assumptions. For nearly a century, the axioms of set theory have played this role, so the question of how these axioms are properly judged takes on a central importance. Approaching the question from a broadly naturalistic or second-philosophical point of view, Defending the Axioms isolates the appropriate methods for such evaluations and investigates the ontological and epistemological backdrop that makes them appropriate. In the end, a new account of (...) the objectivity of mathematics emerges, one refreshingly free of metaphysical commitments. (shrink)

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)

In 'On interpretations of arithmetic and set theory', Kaye and Wong proved the following result, which they considered to belong to the folklore of mathematical logic.

THEOREM 1 The first-order theories of Peano arithmetic and Zermelo-Fraenkel set theory with the axiom of infinity negated are bi-interpretable.

In this note, I describe a theory of sets that is bi-interpretable with the theory of bounded arithmetic IDelta0 + exp. Because of the weakness of this theory of sets, I cannot straightforwardly adapt Kaye and Wong's (...) interpretation of the arithmetic in the set theory. Instead, I am forced to produce a different interpretation. (shrink)

The essay addresses the well‐known idea that there has to be a place for intuition, thought of as a kind of non‐inferential rational insight, in the epistemology of basic logic if our knowledge of its principles is non‐empirical and is to allow of any finite, non‐circular reconstruction. It is argued that the error in this idea consists in its overlooking the possibility that there is, properly speaking, no knowledge of the validity of principles of basic logic. When certain important distinctions (...) are observed, for instance that between recognising that Modus Ponenes is sound and recognising that it is proof against the competent discovery of basic counterexamples, the case for thinking that there is indeed no space for genuine recognition of the validity of Modus Ponens becomes increasingly impressive. It is argued however that, the impossibility of knowledge notwithstanding, we are, in an important sense, entitled to take it that Modus Ponens is sound and that this notion of entitlement can help break the trichotomy ‐ intuition, inference, experience ‐ which imprisons our ordinary thinking about logical knowledge. (shrink)

The uniform reflection principle for the theory of uniform T-sentences is added to PA. The resulting system is justified on the basis of a disquotationalist theory of truth where the provability predicate is conceived as a special kind of analyticity. The system is equivalent to the system ACA of arithmetical comprehension. If the truth predicate is also allowed to occur in the sentences that are inserted in the T-sentences, yet not in the scope of negation, the system with the reflection (...) schema for these T-sentences assumes the strength of the Kripke-Feferman theory KF, and thus of ramified analysis up to go. (shrink)

This book analyses and defends the deflationist claim that there is nothing deep about our notion of truth. According to this view, truth is a 'light' and innocent concept, devoid of any essence which could be revealed by scientific inquiry. Cezary Cieśliński considers this claim in light of recent formal results on axiomatic truth theories, which are crucial for understanding and evaluating the philosophical thesis of the innocence of truth. Providing an up-to-date discussion and original perspectives on this central and (...) controversial issue, his book will be important for those with a background in logic who are interested in formal truth theories and in current philosophical debates about the deflationary conception of truth. (shrink)

There are two different ways of understanding the notion of ‘ontological commitment ’. A question about ‘what is said to be’ by a theory or ‘what a theory says there is’ deals with ‘explicit’ commitment ; a question about the ontological costs or preconditions of the truth of a theory concerns ‘implicit’ commitment. I defend a conception of ontological commitment as implicit commitment, and argue that existentially quantified idioms in natural language are implicitly, but not explicitly, committing. I use the (...) distinction between the two kinds of ontological commitment to diagnose a flaw in a widely used argument to the effect that existential quantification is not ontologically committing. (shrink)

Disquotational theories of truth are often criticised for being too weak to prove interesting generalisations about truth. In this paper we will propose a certain formal theory to serve as a framework for a solution of the generalisation problem. In contrast with Horwich’s original proposal, our framework will eschew psychological notions altogether, replacing them with the epistemic notion of believability. The aim will be to explain why someone who accepts a given disquotational truth theory Th, should also accept various generalisations (...) not provable in Th. The strategy will consist of the development of an axiomatic theory of believability, one permitting us to show how to derive the believability of generalisations from basic axioms that characterise the believability predicate, together with the information that Th is a theory of truth that we accept. (shrink)

Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmetical theories within their own language, e.g., ${\mathtt{{Prov}_{\mathsf {PA}} \rightarrow \varphi }}$ can be understood to assert that any statement provable in Peano arithmetic is true. It has been repeatedly suggested that justification for such principles follows directly from acceptance of an arithmetical theory $\mathsf {T}$ or indirectly in virtue of their derivability in certain truth-theoretic extensions thereof. This paper challenges this consensus by exploring relationships between reflection principles (...) and principles of mathematical and transfinite induction as well as the status of the latter with respect to various foundational characterizations of number theory. (shrink)

Any (1-)consistent and sufficiently strong system of first-order formal arithmetic fails to decide some independent Gödel sentence. We examine consistent first-order extensions of such systems. Our purpose is to discover what is minimally required by way of such extension in order to be able to prove the Gödel sentence in a nontrivial fashion. The extended methods of formal proof must capture the essentials of the so-called 'semantical argument' for the truth of the Gödel sentence. We are concerned to show that (...) the deflationist has at his disposal such extended methods--methods which make no use or mention of a truth-predicate. (edited). (shrink)

Charles Parsons examines the notion of object, with the aim to navigate between nominalism, denying that distinctively mathematical objects exist, and forms of Platonism that postulate a transcendent realm of such objects. He introduces the central mathematical notion of structure and defends a version of the structuralist view of mathematical objects, according to which their existence is relative to a structure and they have no more of a 'nature' than that confers on them. Parsons also analyzes the concept of intuition (...) and presents a conception of it distantly inspired by that of Kant, which describes a basic kind of access to abstract objects and an element of a first conception of the infinite. (shrink)

Hartry Field distinguished two concepts of type‐free truth: scientific truth and disquotational truth. We argue that scientific type‐free truth cannot do justificatory work in the foundations of mathematics. We also present an argument, based on Crispin Wright's theory of cognitive projects and entitlement, that disquotational truth can do justificatory work in the foundations of mathematics. The price to pay for this is that the concept of disquotational truth requires non‐classical logical treatment.

Tyler Burge, Christopher Peacocke; Our Entitlement to Self-Knowledge, Proceedings of the Aristotelian Society, Volume 96, Issue 1, 1 June 1996, Pages 91–116, ht.

Edward Nelson published in 1986 a book defending an extreme formalist view of mathematics according to which there is an impassable barrier in the totality of exponentiation. On the positive side, Nelson embarks on a program of investigating how much mathematics can be interpreted in Raphael Robinson's theory of arithmetic Q. In the shadow of this program, some very nice logical investigations and results were produced by a number of people, not only regarding what can be interpreted in Q but (...) also what cannot be so interpreted. We explain some of these results and rely on them to discuss Nelson's position. (shrink)

Recent work on formal theories of truth has revived an approach, due originally to Tarski, on which syntax and truth theories are sharply distinguished—‘disentangled’—from mathematical base theories. In this paper, we defend a novel philosophical constraint on disentangled theories. We argue that these theories must be epistemically stable: they must possess an intrinsic motivation justifying no strictly stronger theory. In a disentangled setting, even if the base and the syntax theory are individually stable, they may be jointly unstable. We contend (...) that this flaw afflicts many proposals discussed in the literature; we defend a new, stable disentangled theory, double second-order arithmetic. (shrink)

According to the implicit commitment thesis, once accepting a mathematical formal system S, one is implicitly committed to additional resources not immediately available in S. Traditionally, this thesis has been understood as entailing that, in accepting S, we are bound to accept reflection principles for S and therefore claims in the language of S that are not derivable in S itself. It has recently become clear, however, that such reading of the implicit commitment thesis cannot be compatible with well-established positions (...) in the foundations of mathematics which consider a specific theory S as self-justifying and doubt the legitimacy of any principle that is not derivable in S: examples are Tait’s finitism and the role played in it by Primitive Recursive Arithmetic, Isaacson’s thesis and Peano Arithmetic, Nelson’s ultrafinitism and sub-exponential arithmetical systems. This casts doubts on the very adequacy of the implicit commitment thesis for arithmetical theories. In the paper we show that such foundational standpoints are nonetheless compatible with the implicit commitment thesis. We also show that they can even be compatible with genuine soundness extensions of S with suitable form of reflection. The analysis we propose is as follows: when accepting a system S, we are bound to accept a fixed set of principles extending S and expressing minimal soundness requirements for S, such as the fact that the non-logical axioms of S are true. We call this invariant component the semantic core of implicit commitment. But there is also a variable component of implicit commitment that crucially depends on the justification given for our acceptance of S in which, for instance, may or may not appear reflection principles for S. We claim that the proposed framework regulates in a natural and uniform way our acceptance of different arithmetical theories. (shrink)

This article gives an epistemological analysis of the reflection process by means of which you can come to know the consistency of a mathematical theory that you already accept. It is argued that this process can result in warranted belief in new mathematical principles without justifying them.

[Crispin Wright] Two kinds of epistemological sceptical paradox are reviewed and a shared assumption, that warrant to accept a proposition has to be the same thing as having evidence for its truth, is noted. 'Entitlement', as used here, denotes a kind of rational warrant that counter-exemplifies that identification. The paper pursues the thought that there are various kinds of entitlement and explores the possibility that the sceptical paradoxes might receive a uniform solution if entitlement can be made to reach sufficiently (...) far. Three kinds of entitlement are characterised and given prima facie support, and a fourth is canvassed. Certain foreseeable limitations of the suggested anti-sceptical strategy are noted. The discussion is grounded, overall, in a conception of the sceptical paradoxes not as directly challenging our having any warrant for large classes of our beliefs but as crises of intellectual conscience for one who wants to claim that we do. /// [ Martin Davies] Wright's account of sceptical arguments and his use of the idea of epistemic entitlement are reviewed. His notion of non-transmission of epistemic warrant is explained and a concern about his notion of entitlement is developed. An epistemological framework different from Wright's is described and several notions of entitlement are introduced. One of these, negative entitlement, is selected for more detailed comparison with Wright's notion. Thereafter, the paper shows how the two notions of entitlement have contrasting consequences for non-transmission of warrant and how they go naturally with two conceptions of the presuppositions of epistemic projects. Problems for negative entitlement are explained and solutions are proposed. (shrink)

• This comes from my general view of the nature of mathematics, that it is humanly based and that it deals with more or less clear conceptions of mathematical structures; for want of a better word, I call that view conceptual structuralism.

Edward Nelson published in 1986 a book defending an extreme formalist view of mathematics according to which there is animpassable barrierin the totality of exponentiation. On the positive side, Nelson embarks on a program of investigating how much mathematics can be interpreted in Raphael Robinson's theory of arithmetic. In the shadow of this program, some very nice logical investigations and results were produced by a number of people, not only regarding what can be interpreted inbut also what cannot be so (...) interpreted. We explain some of these results and rely on them to discuss Nelson's position. (shrink)

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the sixteenth publication in the Lecture Notes in Logic series, gives a sustained presentation of a particular view of the topic of Gödelian extensions of theories. It presents the basic material in predicate logic, set theory and recursion (...) theory, leading to a proof of Gödel's incompleteness theorems. The inexhaustibility of mathematics is treated based on the concept of transfinite progressions of theories as conceived by Turing and Feferman. All concepts and results are introduced as needed, making the presentation self-contained and thorough. Philosophers, mathematicians and others will find the book helpful in acquiring a basic grasp of the philosophical and logical results and issues. (shrink)

Following recent developments in the literature on axiomatic theories of truth, we investigate an alternative to the widespread habit of formalizing the syntax of the object-language into the object-language itself. We first argue for the proposed revision, elaborating philosophical evidences in favor of it. Secondly, we present a general framework for axiomatic theories of truth with theories of syntax. Different choices of the object theory O will be considered. Moreover, some strengthenings of these theories will be introduced: we will consider (...) extending the theories by the addition of coding axioms or by extending the schemas of O, if present, to the entire vocabulary of our theory of truth. Finally, we touch on the philosophical consequences that the theories described can have on the debate about the metaphysical status of the truth predicate and on the formalization of our informal metatheoretic reasoning. (shrink)

Even though disquotationalism is not correct as it is usually formulated, a deep insight lies behind it. Specifically, it can be argued that, modulo implicit commitment to reflection principles, all there is to the notion of truth is given by a simple, natural collection of truth-biconditionals.

This book develops arithmetic without the induction principle, working in theories that are interpretable in Raphael Robinson's theory Q. Certain inductive formulas, the bounded ones, are interpretable in Q. A mathematically strong, but logically very weak, predicative arithmetic is constructed. Originally published in 1986. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These paperback editions preserve the original texts of these important books while presenting (...) them in durable paperback editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905. (shrink)

The proper evaluation of a theory's virtues seems to require taking into account what the theory is indirectly or implicitly committed to, in addition to what it explicitly says. Most extant proposals for criteria of theory choice in the literature spell out the relevant notion of implicit commitment via some notion of entailment. I show that such criteria behave implausibly in application to theories that differ over matters of entailment. A recent defence by Howard Peacock of such a criterion against (...) this objection is examined and rejected. I go on to a develop a better proposal on which, roughly speaking, a theory is counted committed to a claim if and only if its best fully explicit extension is explicitly committed to the claim. Such extensions in turn are evaluated by ordinary standards of theory choice adapted to the case of theories assumed to articulate their intended content in a fully explicit fashion. (shrink)

Reflection principles are of central interest in the development of axiomatic theories. Whereas they are independent statements they appear to have a specific epistemological status. Our trust in those principles is as warranted as our trust in the axioms of the system itself. This paper is an attempt in clarifying this special epistemic status. We provide a motivation for the adoption of uniform reflection principles by their analogy to a form of the constructive \(\omega \) -rule. Additionally, we analyse the (...) role of informal arithmetic and the conception of natural numbers as an inductive structure, also with regard to extra conceptual resources such as a primitive truth predicate. (shrink)