The affirmative answer to the title question is justified in two ways: logical and empirical. The logical justification is due to Gödel’s discovery that in any axiomatic formalized theory, having at least the expressive power of PA, at any stage of development there must appear unsolvable problems. However, some of them become solvable in a further development of the theory in question, owing to subsequent investigations. These lead to new concepts, expressed with additional axioms or rules. Owing to the so-amplified (...) axiomatic basis, new routine procedures like algorithms, can be reached. Those, in turn, help to gain new insights which lead to still more powerful axioms, and consequently again to ampler algorithmic resources. Thus scientific progress proceeds to an ever higher scope of solvability. The existence of such feedback cycles –in a formal way rendered with Turing’s systems of logic based on ordinal – gets empirically supported by the history of mathematics and other exact sciences. An instructive instance of such a process is found in the history of the number zero. Without that insight due to some ancient Hindu mathematicians there could not arise such an axiomatic theory as PA. It defines the algorithms of arithmetical operations, which in turn help intuitions; those, inturn, give rise to algorithmic routines, not available in any of the previous phases of the process in question. While the logical substantiation of the point of this essay is a well-established result of logico-semantic inquiries, its empiricalclaim, based on historical evidences, remains open for discussion. Hence the author’s intention to address philosophers and historians of science, and to encourage their critical responses. (shrink)

Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...) be crucial, and show how one may provide responses to Maddy's concerns based on a careful analysis of 'multiverse practice'. (shrink)

While writing this thesis, there were many things I wanted to get right. I wanted to get the data right. I wanted to get my analysis of the data right. I certainly wanted to get all my citations right, which can get pretty tricky when one is trying to finish a chapter at 2am. But if an error did creep in somewhere in the body of the thesis, that is not a disaster. Sooner or later, I will get a chance (...) to correct it in a future publication. However, this part of the thesis, which sits right at the beginning but was among the last to be written, is different. I only have one opportunity to express, in print, how thankful I am to the people whose assistance was so important to me over the past years. Which is unfortunate, since if I were to truly elaborate all I am thankful for, these acknowledgements would be the lengthiest chapter of the thesis. But I hope this brief version will suffice in its stead. (shrink)

Frege proved an important result, concerning the relation of arithmetic to second-order logic, that bears on several issues in linguistics. Frege’s Theorem illustrates the logic of relations like PRECEDES(x, y) and TALLER(x, y), while raising doubts about the idea that we understand sentences like ‘Carl is taller than Al’ in terms of abstracta like heights and numbers. Abstract paraphrase can be useful—as when we say that Carl’s height exceeds Al’s—without reflecting semantic structure. Related points apply to causal relations, and even (...) grammatical relations like DOMINATES(x, y). Perhaps surprisingly, Frege provides the resources needed to recursively characterize labelled expressions without characterizing them as sets. His theorem may also bear on questions about the meaning and acquisition of number words. (shrink)

While the Gödel centenary year 2006 triggered a lot of conference and workshop activity on Gödel, the years leading to it stand out by exhibiting several excellent publications on Gödel's life and work, most notably the completion of the Kurt Gödel Collected Works series . The two volumes of Kurt Gödel. Wahrheit & Beweisbarkeit, written in German and edited by E. Köhler et al., constitute something like the ‘German-Austrian contribution’ to this renewal of interest in Gödel's legacy, even though not (...) all of the articles in the volumes actually have German or Austrian authors.2 Indeed, as P. Weibel explains in the preface of the first volume, one of the intentions of the editors was to present Gödel as part of the cultural history of Austria. At the same time, the volumes highlight the contrast between Gödel's national reception—or lack thereof—and the way in which he was perceived and appreciated internationally, and although this discrepancy is now fortunately a thing of the past, its history is worth documenting. In this respect the two volumes will be of lasting value and importance, and the editors must be given credit not just for recording Gödel's delayed acceptance by Austrian politicians and university headquarters, but also for promoting Gödel's case. This being said, there is something extravagant and slightly queer about the two Kurt Gödel. Wahrheit & Beweisbarkeit volumes. Parts of them seem to be written for a generally educated audience, while other parts will be understandable only to logicians and philosophers who specialize in the topics covered. The volumes consist partly of biographical essays, interviews about Gödel, photos of him and his family, and letters by or to him, but they also include several non-historical articles which use …. (shrink)

The form of nominalism known as 'mathematical fictionalism' is examined and found wanting, mainly on grounds that go back to an early antinominalist work of Rudolf Carnap that has unfortunately not been paid sufficient attention by more recent writers.

The concept of weak emergence is a refinement or specification of the intuitive, general notion of emergence. Basically, a fact about a system is said to be weakly emergent if its holding both (i) is derivable from the fundamental laws of the system together with some set of basic (non-emergent) facts about it, and yet (ii) is only derivable in a particular manner, called “simulation.” This essay analyzes the application of this notion Conway’s Game of Life, and concludes that a (...) modification of the notion would provide a better refinement of the general notion of emergence. It is proposed that emergence be taken as a matter of degree, defined in terms of the amount of simulation required to derive a fact. (shrink)

The following inference is valid: There are exactly 101 dalmatians, There are exactly 100 food bowls, Each dalmatian uses exactly one food bowl Hence, at least two dalmatians use the same food bowl. Here, “there are at least 101 dalmatians” is nominalized as, "x1"x2…."x100$y(Dy & y ¹ x1 & y ¹ x2 & … & y ¹ x100) and “there are exactly 101 dalmatians” is nominalized as, "x1"x2…."x100$y(Dy & y ¹ x1 & y ¹ x2 & … & y ¹ (...) x100) & Ø"x1"x2…."x101$y(Dy & y ¹ x1 & y ¹ x2 & … & y ¹ x101). This is abbreviated $101xDx. The validity of the above inference corresponds to the valid formula, PHP(100): [$101xDx & $100xFx & "x(Dx ® Ff(x))] ® $x1$x2(Dx1 & Dx2 & x1 ¹ x2 & f(x1) = f(x2)). More generally, for variable n, the formula PHP(n) is PHP(n): [$n+1xDx & $nxFx & "x(Dx ® Ff(x))] ® $x1$x2(Dx1 & Dx2 & x1 ¹ x2 & f(x1) = f(x2)). A mathematical proof that PHP(n) is valid, for all n > 0, is quite short (less than a page), but refers to numbers, functions and sets. It uses the Pigeonhole Principle. This explains why PHP(n) is valid, for all n>0. However, I estimate that a predicate calculus derivation of PHP(100), using natural deduction, say, would require around 107 symbols. Unfeasibility Problem: nominalism is the radical anti-realist view that there are no numbers, functions or sets. So, how could a nominalist know that PHP(100) is valid, without directly performing the rather long derivation? Can the nominalist “ride piggyback” on the standard mathematical proof? If so, how is this justified? (shrink)

In ‘The varieties of indispensability arguments’ Marco Panza and Andrea Sereni argue that, for any clear notion of indispensability, either there is no conclusive argument for the thesis that mathematics is indispensable to science, or the notion of indispensability at hand does not support mathematical realism. In this paper, I shall not object to this main thesis directly. I shall instead try to assess in a naturalistic spirit a family of objections the authors make along the way to the use (...) of indispensability premises in indispensability arguments. (shrink)

Derivationists, those wishing to explain the correctness and rigour of informal proofs in terms of associated formal proofs, are generally held to be supported by the success of the project of translating informal proofs into computer-checkable formal counterparts. I argue, however, that this project is a false friend for the derivationists because there are too many different associated formal proofs for each informal proof, leading to a serious worry of overgeneration. I press this worry primarily against Azzouni's derivation-indicator account, but (...) conclude that overgeneration is a major obstacle to a successful account of informal proofs in this direction. (shrink)

Philosophy of mathematics for the last half-century has been dominated in one way or another by Quine’s indispensability argument. The argument alleges that our best scientific theory quantifies over, and thus commits us to, mathematical objects. In this paper, I present new considerations which undermine the most serious challenge to Quine’s argument, Hartry Field’s reformulation of Newtonian Gravitational Theory.

A formal system is studied having both sentences and diagrams as well-formed representations. Proofs in the system allow inference back and forth between sentences and diagrams, as well as between diagrams and diagrams, and between sentences and sentences. This sort of heterogeneous system is of interest because external representations other than linguistic ones occur commonly in actual reasoning in conjunction with language. Syntax, semantics, and rules of inference for the system are given and it is shown to be sound and (...) complete. (shrink)

The period in the foundations of mathematics that started in 1879 with the publication of Frege's Begriffsschrift and ended in 1931 with Gödel's Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I can reasonably be called the classical period. It saw the development of three major foundational programmes: the logicism of Frege, Russell and Whitehead, the intuitionism of Brouwer, and Hilbert's formalist and proof-theoretic programme. In this period, there were also lively exchanges between the various schools culminating in (...) the famous Hilbert-Brouwer controversy in the 1920s. -/- The purpose of this anthology is to review the programmes in the foundations of mathematics from the classical period and to assess their possible relevance for contemporary philosophy of mathematics. What can we say, in retrospect, about the various foundational programmes of the classical period and the disputes that took place between them? To what extent do the classical programmes of logicism, intuitionism and formalism represent options that are still alive today? These questions are addressed in this volume by leading mathematical logicians and philosophers of mathematics. (shrink)

This paper reports on an exploration of Boolos’ Curious Inference, using higher-order automated theorem provers (ATPs). Surprisingly, only suitable shorthand notations had to be provided by hand for ATPs to find a short proof. The higher-order lemmas required for constructing a short proof are automatically discovered by the ATPs. Given the observations and suggestions in this paper, full proof automation of Boolos’ and related examples now seems to be within reach of higher-order ATPs.

Instrumentalist nominalism responds to the indispensability arguments by rejecting the demand that successful mathematicized scientific theories be nominalized, and instead claiming merely that such theories are nominalistically adequate: the concreta behave ‘as if’ the theory is true. This article examines some definitions of the concept of nominalistic adequacy and concludes with some considerations against instrumentalist nominalism.