Ordinary mathematical proofs—to be distinguished from formal derivations—are the locus of mathematical knowledge. Their epistemic content goes way beyond what is summarised in the form of theorems. Objections are raised against the formalist thesis that every mainstream informal proof can be formalised in some first-order formal system. Foundationalism is at the heart of Hilbert's program and calls for methods of formal logic to prove consistency. On the other hand, ‘systemic cohesiveness’, as proposed here, seeks to explicate why mathematical knowledge is (...) coherent (in an informal sense) and places the problem of reliability within the province of the philosophy of mathematics. (shrink)

Ordinary mathematical proofs—to be distinguished from formal derivations—are the locus of mathematical knowledge. Their epistemic content goes way beyond what is summarised in the form of theorems. Objections are raised against the formalist thesis that every mainstream informal proof can be formalised in some first-order formal system. Foundationalism is at the heart of Hilbert's program and calls for methods of formal logic to prove consistency. On the other hand, ‘systemic cohesiveness’, as proposed here, seeks to explicate why mathematical knowledge is (...) coherent and places the problem of reliability within the province of the philosophy of mathematics. (shrink)

How can formal methods be applied to philosophical problems that involve informal concepts of ordinary language? Carnap answered this question by describing a methodology that he called “explication." Strawson objected that explication changes the subject and does not address the original philosophical problem; this paper shows that Carnap’s response to that objection was inadequate and offers a better response. More recent criticisms of explication by Boniolo and Eagle are shown to rest on misunderstandings of the nature of explication. It is (...) concluded that explication is an appropriate methodology for formal philosophy. (shrink)

Willard Van Orman Quine begins this influential work by declaring, "Language is asocial art.

APA PsycNET abstract: This is the first volume of a two-volume work on Probability and Induction. Because the writer holds that probability logic is identical with inductive logic, this work is devoted to philosophical problems concerning the nature of probability and inductive reasoning. The author rejects a statistical frequency basis for probability in favor of a logical relation between two statements or propositions. Probability "is the degree of confirmation of a hypothesis (or conclusion) on the basis of some given evidence (...) (or premises)." Furthermore, all principles and theorems of inductive logic are analytic, and the entire system is to be constructed by means of symbolic logic and semantic methods. This means that the author confines himself to the formalistic procedures of word and symbol systems. The resulting sentence or language structures are presumed to separate off logic from all subjectivist or psychological elements. Despite the abstractionism, the claim is made that if an inductive probability system of logic can be constructed it will have its practical application in mathematical statistics, and in various sciences. 16-page bibliography. (PsycINFO Database Record (c) 2016 APA, all rights reserved). (shrink)

Platonism is the most pervasive philosophy of mathematics. Indeed, it can be argued that an inarticulate, half-conscious Platonism is nearly universal among mathematicians. The basic idea is that mathematical entities exist outside space and time, outside thought and matter, in an abstract realm. In the more eloquent words of Edward Everett, a distinguished nineteenth-century American scholar, "in pure mathematics we contemplate absolute truths which existed in the divine mind before the morning stars sang together, and which will continue to exist (...) there when the last of their radiant host shall have fallen from heaven." In What is Mathematics, Really?, renowned mathematician Rueben Hersh takes these eloquent words and this pervasive philosophy to task, in a subversive attack on traditional philosophies of mathematics, most notably, Platonism and formalism. Virtually all philosophers of mathematics treat it as isolated, timeless, ahistorical, inhuman. Hersh argues the contrary, that mathematics must be understood as a human activity, a social phenomenon, part of human culture, historically evolved, and intelligible only in a social context. Mathematical objects are created by humans, not arbitrarily, but from activity with existing mathematical objects, and from the needs of science and daily life. Hersh pulls the screen back to reveal mathematics as seen by professionals, debunking many mathematical myths, and demonstrating how the "humanist" idea of the nature of mathematics more closely resembles how mathematicians actually work. At the heart of the book is a fascinating historical account of the mainstream of philosophy--ranging from Pythagoras, Plato, Descartes, Spinoza, and Kant, to Bertrand Russell, David Hilbert, Rudolph Carnap, and Willard V.O. Quine--followed by the mavericks who saw mathematics as a human artifact, including Aristotle, Locke, Hume, Mill, Peirce, Dewey, and Lakatos. In his epilogue, Hersh reveals that this is no mere armchair debate, of little consequence to the outside world. He contends that Platonism and elitism fit well together, that Platonism in fact is used to justify the claim that "some people just can't learn math." The humanist philosophy, on the other hand, links mathematics with geople, with society, and with history. It fits with liberal anti-elitism and its historical striving for universal literacy, universal higher education, and universal access to knowledge and culture. Thus Hersh's argument has educational and political ramifications. Written by the co-author of The Mathematical Experience, which won the American Book Award in 1983, this volume reflects an insider's view of mathematical life, based on twenty years of doing research on advanced mathematical problems, thirty-five years of teaching graduates and undergraduates, and many long hours of listening, talking to, and reading philosophers. A clearly written and highly iconoclastic book, it is sure to be hotly debated by anyone with a passionate interest in mathematics or the philosophy of science. (shrink)

The central contention of this book is that second-order logic has a central role to play in laying the foundations of mathematics. In order to develop the argument fully, the author presents a detailed description of higher-order logic, including a comprehensive discussion of its semantics. He goes on to demonstrate the prevalence of second-order concepts in mathematics and the extent to which mathematical ideas can be formulated in higher-order logic. He also shows how first-order languages are often insufficient to codify (...) many concepts in contemporary mathematics, and thus that both first- and higher-order logics are needed to fully reflect current work. Throughout, the emphasis is on discussing the associated philosophical and historical issues and the implications they have for foundational studies. For the most part, the author assumes little more than a familiarity with logic comparable to that provided in a beginning graduate course which includes the incompleteness of arithmetic and the Lowenheim-Skolem theorems. All those concerned with the foundations of mathematics will find this a thought-provoking discussion of some of the central issues in the field today. (shrink)

"A discussion of the historical development of our ideas of time as they relate to nature, human nature and society. . . . The excellence of The Discovery of Time is unquestionable."--Martin Lebowitz, The Kenyon Review.

In recent philosophy of mathematics avariety of writers have presented ``structuralist''views and arguments. There are, however, a number ofsubstantive differences in what their proponents take``structuralism'' to be. In this paper we make explicitthese differences, as well as some underlyingsimilarities and common roots. We thus identifysystematically and in detail, several main variants ofstructuralism, including some not often recognized assuch. As a result the relations between thesevariants, and between the respective problems theyface, become manifest. Throughout our focus is onsemantic and metaphysical issues, (...) including what is orcould be meant by ``structure'' in this connection. (shrink)

We discuss the differences between first-order set theory and second-order logic as a foundation for mathematics. We analyse these languages in terms of two levels of formalization. The analysis shows that if second-order logic is understood in its full semantics capable of characterizing categorically central mathematical concepts, it relies entirely on informal reasoning. On the other hand, if it is given a weak semantics, it loses its power in expressing concepts categorically. First-order set theory and second-order logic are not radically (...) different: the latter is a major fragment of the former. (shrink)

The rise of the field of “ experimental mathematics” poses an apparent challenge to traditional philosophical accounts of mathematics as an a priori, non-empirical endeavor. This paper surveys different attempts to characterize experimental mathematics. One suggestion is that experimental mathematics makes essential use of electronic computers. A second suggestion is that experimental mathematics involves support being gathered for an hypothesis which is inductive rather than deductive. Each of these options turns out to be inadequate, and instead a third suggestion is (...) considered according to which experimental mathematics involves calculating instances of some general hypothesis. The paper concludes with the examination of some philosophical implications of this characterization. (shrink)

This paper rejoins the debate surrounding Thomas Tymockzko’s paper on the surveyability of proof, first published in the Journal of Philosophy, and makes the claim that by attending to certain broad features of modern conceptions of proof we may understand ways in which the debate surrounding the surveyability of proof has heretofore remained unduly circumscribed. Motivated by these historical reflections, I suggest a distinction between local and global surveyability which I believe has the promise to open up significant new advances (...) in the philosophy of mathematics. (shrink)

In this paper I will compare the concept of explication à la Carnap and the concept of explication à la Kant. This essay should primarily be seen as a comparison of two different philosophical styles, but it is also intended as a vindication of what Kant wrote and what Carnap forgot to read.

The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in ...

Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turing-computable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of Church's (...) Thesis, as Gödel and others suggested may be possible. In a similar way, but with a different set of basic operations, one can prove Turing's Thesis, characterizing the effective string functions, and--in particular--the effectively-computable functions on string representations of numbers. (shrink)

This volume examines the notion of an analytic proof as a natural deduction, suggesting that the proof's value may be understood as its normal form--a concept with significant implications to proof-theoretic semantics.

It is generally agreed that the method of explication consists in replacing a vague, presystematic notion (the explicandum) with a precise notion (the explicatum) formulated in a systematic context. However, Carnap and others who have used this and related terms appear to hold inconsistent views as to what constitutes an adequate explication. The central feature of the present explication of 'explication' is the correspondence condition: permitting the explicandum to deviate from some established "ordinary-language" conventions but, at the same time, requiring (...) that the explicatum correspond (via an effective translation) to the chosen "definitive intension" of the explicandum. (In effect, the first stages of an explication provide an informal characterization of a vague and possibly inconsistent language convention.) The present account of explication contrasts sharply with that sketched by Quine in Word and Object (although Quine accepts a correspondence condition of a sort). The terms `explication 1 ' and `explication 2 ' are used to indicate these quite different senses of the term. In Kaplan's terminology, explication 1 is intended to remedy "external vagueness" while explication 2 is intended to remedy "internal vagueness.". (shrink)

This expanded edition now contains essays by Penelope Maddy, Michael D. Resnik, and William P. Thurston that address the nature of mathematical proofs. The editor has provided a new afterword and a supplemental bibliography of recent work.

Extends the ideas of social constructivism to the philosophy of mathematics, developing a powerful critique of traditional absolutist conceptions of mathematics, and proposing a reconceptualization of the philosophy of mathematics.

This collection, nearly all chosen by Boolos himself shortly before his death, includes thirty papers on set theory, second-order logic, and plural quantifiers; ...

Arguments to the effect that Church's thesis is intrinsically unprovable because proof cannot relate an informal, intuitive concept to a mathematically defined one are unconvincing, since other 'theses' of this kind have indeed been proved, and Church's thesis has been proved in one direction. However, though evidence for the truth of the thesis in the other direction is overwhelming, it does not yet amount to proof.

The present edition provides a detailed and accessible discussion ofhis theories and adds an account of the immediate responses to the book on publication.

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much (...) more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included. (shrink)

In this paper I discuss possible ways of measuring the power of arithmetical theories, and the possiblity of making an explication in Carnap's sense of this concept. Chaitin formulates several suggestions how to construct measures, and these suggestions are reviewed together with some new and old critical arguments. I also briefly review a measure I have designed together with some shortcomings of this measure. The conclusion of the paper is that it is not possible to formulate an explication of the (...) concept. (shrink)

On a traditional view, the primary role of a mathematical proof is to warrant the truth of the resulting theorem. This view fails to explain why it is very often the case that a new proof of a theorem is deemed important. Three case studies from elementary arithmetic show, informally, that there are many criteria by which ordinary proofs are valued. I argue that at least some of these criteria depend on the methods of inference the proofs employ, and that (...) standard models of formal deduction are not well-equipped to support such evaluations. I discuss a model of proof that is used in the automated deduction community, and show that this model does better in that respect. (shrink)

There are two distinct meanings to ‘mathematical proof’. The connection between them is an unsolved problem. The first step in attacking it is noticing that it is an unsolved problem.