I explore physics implications of the External Reality Hypothesis (ERH) that there exists an external physical reality completely independent of us humans. I argue that with a sufficiently broad definition of mathematics, it implies the Mathematical Universe Hypothesis (MUH) that our physical world is an abstract mathematical structure. I discuss various implications of the ERH and MUH, ranging from standard physics topics like symmetries, irreducible representations, units, free parameters, randomness and initial conditions to broader issues like consciousness, parallel universes and (...) Gödel incompleteness. I hypothesize that only computable and decidable (in Gödel’s sense) structures exist, which alleviates the cosmological measure problem and may help explain why our physical laws appear so simple. I also comment on the intimate relation between mathematical structures, computations, simulations and physical systems. (shrink)

This volume examines the limitations of mathematical logic and proposes a new approach to logic intended to overcome them. To this end, the book compares mathematical logic with earlier views of logic, both in the ancient and in the modern age, including those of Plato, Aristotle, Bacon, Descartes, Leibniz, and Kant. From the comparison it is apparent that a basic limitation of mathematical logic is that it narrows down the scope of logic confining it to the study of deduction, without (...) providing tools for discovering anything new. As a result, mathematical logic has had little impact on scientific practice. Therefore, this volume proposes a view of logic according to which logic is intended, first of all, to provide rules of discovery, that is, non-deductive rules for finding hypotheses to solve problems. This is essential if logic is to play any relevant role in mathematics, science and even philosophy. To comply with this view of logic, this volume formulates several rules of discovery, such as induction, analogy, generalization, specialization, metaphor, metonymy, definition, and diagrams. A logic based on such rules is basically a logic of discovery, and involves a new view of the relation of logic to evolution, language, reason, method and knowledge, particularly mathematical knowledge. It also involves a new view of the relation of philosophy to knowledge. This book puts forward such new views, trying to open again many doors that the founding fathers of mathematical logic had closed historically. (shrink)

It is shown that the Hilbert-Bernays-Quine principle of identity of indiscernibles applies uniformly to all the contentious cases of symmetries in physics, including permutation symmetry in classical and quantum mechanics. It follows that there is no special problem with the notion of objecthood in physics. Leibniz's principle of sufficient reason is considered as well; this too applies uniformly. But given the new principle of identity, it no longer implies that space, or atoms, are unreal.

In his paper ``What is Structural Realism?'' James Ladyman drew a distinction between epistemological structural realism and metaphysical (or ontic) structural realism. He also drew a suggestive analogy between the perennial debate between substantivalist and relationalist interpretations of spacetime on the one hand, and the debate about whether quantum mechanics treats identical particles as individuals or as `non-individuals' on the other. In both cases, Ladyman's suggestion is that an ontic structural realist interpretation of the physics might be just what is (...) needed to overcome the stalemate. The main thesis of this paper is that, whatever the interpretative difficulties of generally covariant spacetime physics are, they do not support or suggest structural realism. In particular, I hope to show that there is in fact no analogy that supports a similar interpretation of the metaphysics of spacetime points and of quantum particles. (shrink)

Questions about the relation between identity and discernibility are important both in philosophy and in model theory. We show how a philosophical question about identity and dis- cernibility can be ‘factorized’ into a philosophical question about the adequacy of a formal language to the description of the world, and a mathematical question about discernibility in this language. We provide formal definitions of various notions of discernibility and offer a complete classification of their logical relations. Some new and surprising facts are (...) proved; for instance, that weak dis- cernibility corresponds to discernibility in a language with constants for every object, and that weak discernibility is the most discerning nontrivial discernibility relation. (shrink)

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...) and Skolem. Itinerary V surveys the work in logic connected to the Hilbert school, and itinerary V deals specifically with consistency proofs and metamathematics, including the incompleteness theorems. Itinerary VII traces the development of intuitionistic and many-valued logics. Itinerary VIII surveys the development of semantical notions from the early work on axiomatics up to Tarski's work on truth. (shrink)

Despite the renown of ‘On Denoting’, much criticism has ignored or misconstrued Russell's treatment of scope, particularly in intensional, but also in extensional contexts. This has been rectified by more recent commentators, yet it remains largely unnoticed that the examples Russell gives of scope distinctions are questionable or inconsistent with his own philosophy. Nevertheless, Russell is right: scope does matter in intensional contexts. In Principia Mathematica, Russell proves a metatheorem to the effect that the scope of a single occurrence of (...) a description in an extensional context does not matter, provided existence and uniqueness conditions are satisfied. But attempts to eliminate descriptions in more complicated cases may produce an analysis with more occurrences of descriptions than featured in the analysand. Taking alternation and negation to be primitive (as in the first edition of Principia), this can be resolved, although the proof is non-trivial. Taking the Sheffer stroke to be primitive (as proposed by Russell in the second edition), with bad choices of scope the analysis fails to terminate. (shrink)

Using the Hilbert-Bernays account as a spring-board, we first define four ways in which two objects can be discerned from one another, using the non-logical vocabulary of the language concerned. Because of our use of the Hilbert-Bernays account, these definitions are in terms of the syntax of the language. But we also relate our definitions to the idea of permutations on the domain of quantification, and their being symmetries. These relations turn out to be subtle---some natural conjectures about them are (...) false. We will see in particular that the idea of symmetry meshes with a species of indiscernibility that we will call `absolute indiscernibility'. We then report all the logical implications between our four kinds of discernibility. We use these four kinds as a resource for stating four metaphysical theses about identity. Three of these theses articulate two traditional philosophical themes: viz. the principle of the identity of indiscernibles, and haecceitism. The fourth is recent. Its most notable feature is that it makes diversity weaker than what we will call individuality : two objects can be distinct but not individuals. For this reason, it has been advocated both for quantum particles and for spacetime points. Finally, we locate this fourth metaphysical thesis in a broader position, which we call structuralism. We conclude with a discussion of the semantics suitable for a structuralist, with particular reference to physical theories as well as elementary model theory. (shrink)

This paper is the first in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic semantics (...) so as to shed new light on the relevant strengths and limits of higher-order logic. (shrink)

A survey of current evidence available concerning Wittgenstein's attitude toward, and knowledge of, Gödel's first incompleteness theorem, including his discussions with Turing, Watson and others in 1937–1939, and later testimony of Goodstein and Kreisel; 2) Discussion of the philosophical and historical importance of Wittgenstein's attitude toward Gödel's and other theorems in mathematical logic, contrasting this attitude with that of, e.g., Penrose; 3) Replies to an instructive criticism of my 1995 paper by Mark Steiner which assesses the importance of Tarski's semantical (...) work, both for our understanding of Wittgenstein's remarks on Gödel, and our understanding of Gödel's theorem itself. (shrink)

In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...) of classical mathematics. Although Hilbert proposed his program in this form only in 1921, various facets of it are rooted in foundational work of his going back until around 1900, when he first pointed out the necessity of giving a direct consistency proof of analysis. Work on the program progressed significantly in the 1920s with contributions from logicians such as Paul Bernays, Wilhelm Ackermann, John von Neumann, and Jacques Herbrand. It was also a great influence on Kurt Gödel, whose work on the incompleteness theorems were motivated by Hilbert's Program. Gödel's work is generally taken to show that Hilbert's Program cannot be carried out. It has nevertheless continued to be an influential position in the philosophy of mathematics, and, starting with the work of Gerhard Gentzen in the 1930s, work on so-called Relativized Hilbert Programs have been central to the development of proof theory. (shrink)

What is mathematics about? And if it is about some sort of mathematical reality, how can we have access to it? This is the problem raised by Plato, which still today is the subject of lively philosophical disputes. This book traces the history of the problem, from its origins to its contemporary treatment. It discusses the answers given by Aristotle, Proclus and Kant, through Frege's and Russell's versions of logicism, Hilbert's formalism, Gödel's platonism, up to the the current debate on (...) Benacerraf's dilemma and the indispensability argument. Through the considerations of themes in the philosophy of language, ontology, and the philosophy of science, the book aims at offering an historically-informed introduction to the philosophy of mathematics, approached through the lenses of its most fundamental problem. (shrink)

After a brief flirtation with logicism around 1917, David Hilbertproposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays andWilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for everstronger and more comprehensive areas of mathematics, and finitisticproofs of consistency of these systems. Early advances in these areaswere made by Hilbert (and Bernays) in a series of lecture courses atthe (...) University of Göttingen between 1917 and 1923, and notably in Ackermann's dissertation of 1924. The main innovation was theinvention of the -calculus, on which Hilbert's axiom systemswere based, and the development of the -substitution methodas a basis for consistency proofs. The paper traces the developmentof the ``simultaneous development of logic and mathematics'' throughthe -notation and provides an analysis of Ackermann'sconsistency proofs for primitive recursive arithmetic and for thefirst comprehensive mathematical system, the latter using thesubstitution method. It is striking that these proofs use transfiniteinduction not dissimilar to that used in Gentzen's later consistencyproof as well as non-primitive recursive definitions, and that thesemethods were accepted as finitistic at the time. (shrink)

On the basis of a wide range of historical examples various features of axioms are discussed in relation to their use in mathematical practice. A very general framework for this discussion is provided, and it is argued that axioms can play many roles in mathematics and that viewing them as self-evident truths does not do justice to the ways in which mathematicians employ axioms. Possible origins of axioms and criteria for choosing axioms are also examined. The distinctions introduced aim at (...) clarifying discussions in philosophy of mathematics and contributing towards a more refined view of mathematical practice. (shrink)

This article develops an analogy proposed by Stachel between general relativity (GR) and quantum mechanics (QM) as regards permutation invariance. Our main idea is to overcome Pooley's criticism of the analogy by appeal to paraparticles. In GR, the equations are (the solution space is) invariant under diffeomorphisms permuting spacetime points. Similarly, in QM the equations are invariant under particle permutations. Stachel argued that this feature—a theory's ‘not caring which point, or particle, is which’—supported a structuralist ontology. Pooley criticizes this analogy: (...) in QM the (anti-)symmetrization of fermions and bosons implies that each individual state (solution) is fixed by each permutation, while in GR a diffeomorphism yields in general a distinct, albeit isomorphic, solution. We define various versions of structuralism, and go on to formulate Stachel's and Pooley's positions, admittedly in our own terms. We then reply to Pooley. Though he is right about fermions and bosons, QM equally allows more general types of particle symmetry, in which states (vectors, rays, or density operators) are not fixed by all permutations (called ‘paraparticle states’). Thus Stachel's analogy is revived. (shrink)

Natural deduction is the type of logic most familiar to current philosophers, and indeed is all that many modern philosophers know about logic. Yet natural deduction is a fairly recent innovation in logic, dating from Gentzen and Jaśkowski in 1934. This article traces the development of natural deduction from the view that these founders embraced to the widespread acceptance of the method in the 1960s. I focus especially on the different choices made by writers of elementary textbooks—the standard conduits of (...) the method to a generation of philosophers—with an eye to determining what the ‘essential characteristics’ of natural deduction are. (shrink)

It is a remarkable fact that Hilbert's programmatic papers from the 1920s still shape, almost exclusively, the standard contemporary perspective of his views concerning (the foundations of) mathematics; even his own, quite different work on the foundations of geometry and arithmetic from the late 1890s is often understood from that vantage point. My essay pursues one main goal, namely, to contrast Hilbert's formal axiomatic method from the early 1920s with his existential axiomatic approach from the 1890s. Such a contrast illuminates (...) the circuitous beginnings of the finitist consistency program and connects the complex emergence of existential axiomatics with transformations in mathematics and philosophy during the 19th century; the sheer complexity and methodological difficulties of the latter development are partially reflected in the well known, but not well understood correspondence between Frege and Hilbert. Taking seriously the goal of formalizing mathematics in an effective logical framework leads also to contemporary tasks, not just historical and systematic insights; those are briefly described as “one direction” for fascinating work. (shrink)

This is the introductory essay to a collection commemorating the 100th anniversary of the publication in Mind of Bertrand Russell’s paper ‘On Denoting’.

What is the meaning of general covariance? We learn something about it from the hole argument, due originally to Einstein. In his search for a theory of gravity, he noted that if the equations of motion are covariant under arbitrary coordinate transformations, then particle coordinates at a given time can be varied arbitrarily - they are underdetermined - even if their values at all earlier times are held fixed. It is the same for the values of fields. The argument can (...) also be made out in terms of transformations acting on the points of the manifold, rather than on the coordinates assigned to the points. So the equations of motion do not fix the particle positions, or the values of fields at manifold points, or particle coordinates, or fields as functions of the coordinates, even when they are specified at all earlier times. It is surely the business of physics to predict these sorts of quantities, given their values at earlier times. The principle of general covariance therefore seems untenable. (shrink)

Manfred Eigen extended Erwin Schroedinger’s concept of “life is physics and chemistry” through the introduction of information theory and cybernetic systems theory into “life is physics and chemistry and information.” Based on this assumption, Eigen developed the concepts of quasispecies and hypercycles, which have been dominant in molecular biology and virology ever since. He insisted that the genetic code is not just used metaphorically: it represents a real natural language.However, the basics of scientific knowledge changed dramatically within the second half (...) of the 20th century.Unfortunately, Eigen ignored the results of the philosophy of science discourse on essential features of natural languages and codes: a natural language or code emerges from populations of living agents that communicate. This contribution will look at some of the highlights of this historical development and the results relevant for biological theories about life. (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)

This paper concerns Carnap’s early contributions to formal semantics in his work on general axiomatics between 1928 and 1936. Its main focus is on whether he held a variable domain conception of models. I argue that interpreting Carnap’s account in terms of a fixed domain approach fails to describe his premodern understanding of formal models. By drawing attention to the second part of Carnap’s unpublished manuscript Untersuchungen zur allgemeinen Axiomatik, an alternative interpretation of the notions ‘model’, ‘model extension’ and ‘submodel’ (...) in his theory of axiomatics is presented. Specifically, it is shown that Carnap’s early model theory is based on a convention to simulate domain variation that is not identical but logically comparable to the modern account. (shrink)

is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context.

Over the last two decades, semantic theory has been marked by a continuing shift from a static view of meaning to a dynamic one. The increasing interest in extending semantic analysis from isolated sentences to larger units of discourse has fostered the intensive study of anaphora and coreference, and this has engendered a shift from viewing meaning as truth conditions to viewing it as the potential to change the "informational context".

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)

Wilfred Sieg. Relative Consistency and Accesible Domains.

The notion of strict identity is sometimes given an explicit second-order definition: objects with all the same properties are identical. Here, a somewhat different problem is raised: Under what conditions is the identity relation on the domain of a structure first-order definable? A structure may have objects that are distinct, but indiscernible by the strongest means of discerning them given the language (the indiscernibility formula). Here a number of results concerning the indiscernibility formula, and the definability of identity, are collected (...) and a number of applications discussed. (shrink)

Computational complexity theory is a subfield of computer science originating in computability theory and the study of algorithms for solving practical mathematical problems. Amongst its aims is classifying problems by their degree of difficulty — i.e., how hard they are to solve computationally. This paper highlights the significance of complexity theory relative to questions traditionally asked by philosophers of mathematics while also attempting to isolate some new ones — e.g., about the notion of feasibility in mathematics, the $\mathbf{P} \neq \mathbf{NP}$ (...) problem and why it has proven hard to resolve, and the role of non-classical modes of computation and proof. (shrink)

The paper distinguishes between two kinds of mathematics, natural mathematics which is a result of biological evolution and artificial mathematics which is a result of cultural evolution. On this basis, it outlines an approach to the philosophy of mathematics which involves a new treatment of the method of mathematics, the notion of demonstration, the questions of discovery and justification, the nature of mathematical objects, the character of mathematical definition, the role of intuition, the role of diagrams in mathematics, and the (...) effectiveness of mathematics in natural science. (shrink)

David Hilbert's finitistic standpoint is a conception of elementary number theory designed to answer the intuitionist doubts regarding the security and certainty of mathematics. Hilbert was unfortunately not exact in delineating what that viewpoint was, and Hilbert himself changed his usage of the term through the 1920s and 30s. The purpose of this paper is to outline what the main problems are in understanding Hilbert and Bernays on this issue, based on some publications by them which have so far received (...) little attention, and on a number of philosophical reconstructions of the viewpoint (in particular, by Hand, Kitcher, and Tait). (shrink)

This is a survey of Gödel's perennial preoccupations with the limits of finitism, its relations to constructivity, and the significance of his incompleteness theorems for Hilbert's program, using his published and unpublished articles and lectures as well as the correspondence between Bernays and Gödel on these matters. There is also an important subtext, namely the shadow of Hilbert that loomed over Gödel from the beginning to the end.

The incompleteness theorems constitute the mathematical core of Gödel’s philosophical challenge. They are given in their “most satisfactory form”, as Gödel saw it, when the formality of theories to which they apply is characterized via Turing machines. These machines codify human mechanical procedures that can be carried out without appealing to higher cognitive capacities. The question naturally arises, whether the theorems justify the claim that the human mind has mathematical abilities that are not shared by any machine. Turing admits that (...) non-mechanical steps of intuition are needed to transcend particular formal theories. Thus, there is a substantive point in comparing Turing’s views with Gödel’s that is expressed by the assertion, “The human mind infinitely surpasses any finite machine”. The parallelisms and tensions between their views are taken as an inspiration for beginning to explore, computationally, the capacities of the human mathematical mind. (shrink)

In this paper, elementary but hitherto overlooked connections are established between Wittgenstein's remarks on mathematics, written during his transitional period, and free-variable finitism. After giving a brief description of theTractatus Logico-Philosophicus on quantifiers and generality, I present in the first section Wittgenstein's rejection of quantification theory and his account of general arithmetical propositions, to use modern jargon, as claims (as opposed to statements). As in Skolem's primitive recursive arithmetic and Goodstein's equational calculus, Wittgenstein represented generality by the use of free (...) variables. This has the effect that negation of unbounded universal and existential propositions cannot be expressed. This is claimed in the second section to be the basis for Wittgenstein's criticism of the universal validity of the law of excluded middle. In the last section, there is a brief discussion of Wittgenstein's remarks on real numbers. These show a preference, in line with finitism, for a recursive version of the continuum. (shrink)

In the past century the received view of definition in mathematics has been the stipulative conception, according to which a definition merely stipulates the meaning of a term in other terms which are supposed to be already well known. The stipulative conception has been so absolutely dominant and accepted as unproblematic that the nature of definition has not been much discussed, yet it is inadequate. This paper examines its shortcomings and proposes an alternative, the heuristic conception.

The concept of “necessity of thought” plays a central role in Dag Prawitz’s essay “Logical Consequence from a Constructivist Point of View” (Prawitz 2005). The theme is later developed in various articles devoted to the notion of valid inference (Prawitz, 2009, forthcoming a, forthcoming b). In section 1 I explain how the notion of necessity of thought emerges from Prawitz’s analysis of logical consequence. I try to expound Prawitz’s views concerning the necessity of thought in sections 2, 3 and 4. (...) In sections 5 and 6 I discuss some problems arising with regard to Prawitz’s views. (shrink)

This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...) introductory paper that surveys Prawitz's numerous contributions to proof theory and proof-theoretic semantics and puts his work into a somewhat broader perspective, both historically and systematically. Chapters include either in-depth studies of certain aspects of Dag Prawitz's work or address open research problems that are concerned with core issues in structural proof theory and range from philosophical essays to papers of a mathematical nature. Investigations into the necessity of thought and the theory of grounds and computational justifications as well as an examination of Prawitz's conception of the validity of inferences in the light of three “dogmas of proof-theoretic semantics” are included. More formal papers deal with the constructive behaviour of fragments of classical logic and fragments of the modal logic S4 among other topics. In addition, there are chapters about inversion principles, normalization of p roofs, and the notion of proof-theoretic harmony and other areas of a more mathematical persuasion. Dag Prawitz also writes a chapter in which he explains his current views on the epistemic dimension of proofs and addresses the question why some inferences succeed in conferring evidence on their conclusions when applied to premises for which one already possesses evidence. (shrink)

In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs is Hilbert's epsilon-substitution method. There was, however, a second approach which was not reflected in the publications of the Hilbert school in the 1920s, and which is a direct precursor of Hilbert's first epsilon theorem and a certain "general consistency result" due to Bernays. An analysis of the form of this so-called "failed proof" (...) sheds further light on an interpretation of Hilbert's programme as an instrumentalist enterprise with the aim of showing that whenever a "real" proposition can be proved by ?ideal? means, it can also be proved by "real", finitary means. (shrink)

The concept of the (full) unfolding of a schematic system is used to answer the following question: Which operations and predicates, and which principles concerning them, ought to be accepted if one has accepted ? The program to determine for various systems of foundational significance was previously carried out for a system of nonfinitist arithmetic, ; it was shown that is proof-theoretically equivalent to predicative analysis. In the present paper we work out the unfolding notions for a basic schematic system (...) of finitist arithmetic, , and for an extension of that by a form of the so-called Bar Rule. It is shown that and are proof-theoretically equivalent, respectively, to Primitive Recursive Arithmetic, , and to Peano Arithmetic,. (shrink)

At the most general level, the concept of finitism is typically characterized by saying that finitistic mathematics is that part of mathematics which does not appeal to completed infinite totalities and is endowed with some epistemological property that makes it secure or privileged. This paper argues that this characterization can in fact be sharpened in various ways, giving rise to different conceptions of finitism. The paper investigates these conceptions and shows that they sanction different portions of mathematics as finitistic.

I consider the well-known criticism of Quine's characterization of first-order logical truth that it expands the class of logical truths beyond what is sanctioned by the model-theoretic account. Briefly, I argue that at best the criticism is shallow and can be answered with slight alterations in Quine's account. At worse the criticism is defective because, in part, it is based on a misrepresentation of Quine. This serves not only to clarify Quine's position, but also to crystallize what is and what (...) is not at issue in choosing the model-theoretic account of first-order logical truth over one in terms of substitutions. I conclude by highlighting the need for justifying the belief that the definition of first-order logical truth in terms of models is superior to its definition in terms of substitutions. (shrink)