Philosophia Mathematica 7 (1):5-41 (1999)

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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/philmat/7.1.5
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 65,581
Through your library

References found in this work BETA

Deduction.P. N. Johnson-Laird & R. M. J. Byrne - 1991 - Psychology Press.
Cantorian Set Theory and Limitation of Size.Michael Hallett - 1984 - Oxford, England: Clarendon Press.

View all 25 references / Add more references

Citations of this work BETA

Groundwork for a Fallibilist Account of Mathematics.Silvia De Toffoli - 2021 - Philosophical Quarterly 7 (4):823-844.
Proofs, Pictures, and Euclid.John Mumma - 2010 - Synthese 175 (2):255 - 287.
Reconciling Rigor and Intuition.Silvia De Toffoli - 2021 - Erkenntnis 86 (6):1783-1802.

View all 72 citations / Add more citations

Similar books and articles

Why Do We Prove Theorems?Yehuda Rav - 1998 - Philosophia Mathematica 6 (3):5-41.
Some Dichotomy Theorems for Isomorphism Relations of Countable Models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
Some Dichotomy Theorems for Isomorphism Relations of Countable Models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
Representation Theorems for Quantales.Silvio Valentini - 1994 - Mathematical Logic Quarterly 40 (2):182-190.
An Introduction to Gödel's Theorems.Peter Smith - 2007 - Cambridge University Press.
Rosser-Type Undecidable Sentences Based on Yablo’s Paradox.Taishi Kurahashi - 2014 - Journal of Philosophical Logic 43 (5):999-1017.
Modal Logic Over Finite Structures.Eric Rosen - 1997 - Journal of Logic, Language and Information 6 (4):427-439.
On Machines Which Prove Theorems.E. W. Beth - 1969 - Journal of Symbolic Logic 34 (4):659-659.
Review: E. W. Beth, On Machines Which Prove Theorems. [REVIEW]D. C. Cooper - 1969 - Journal of Symbolic Logic 34 (4):659-659.


Added to PP index

Total views
138 ( #79,687 of 2,461,463 )

Recent downloads (6 months)
6 ( #119,105 of 2,461,463 )

How can I increase my downloads?


My notes