Philosophia Mathematica 7 (1):5-41 (1999)
AbstractOrdinary 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.
Similar books and articles
Some dichotomy theorems for isomorphism relations of countable models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
On the Consistency of Some Partition Theorems for Continuous Colorings, and the Structure of ℵ 1 -Dense Real Order Types.J. Steprans, Uri Abraham, Matatyahu Rubin & Saharon Shelah - 2002 - Bulletin of Symbolic Logic 8 (2):303.
On the consistency of some partition theorems for continuous colorings, and the structure of ℵ1-dense real order types.Uri Abraham, Matatyahu Rubin & Saharon Shelah - 1985 - Annals of Pure and Applied Logic 29 (2):123-206.
Some Dichotomy Theorems for Isomorphism Relations of Countable Models.Su Gao - 2001 - Journal of Symbolic Logic 66 (2):902-922.
Universality theorems for configuration spaces of planar linkages.M. Kapovich & J. J. Millson - unknown
Arithmetical interpretations and Kripke frames of predicate modal logic of provability.Taishi Kurahashi - 2013 - Review of Symbolic Logic 6 (1):1-18.
Representation Theorems for Quantales.Silvio Valentini - 1994 - Mathematical Logic Quarterly 40 (2):182-190.
Some theorems on structural entailment relations.Janusz Czelakowski - 1983 - Studia Logica 42 (4):417 - 429.
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.
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
Historical graph of downloads
Citations of this work
Groundwork for a Fallibilist Account of Mathematics.Silvia De Toffoli - 2021 - Philosophical Quarterly 7 (4):823-844.
Epistemic injustice in mathematics.Colin Jakob Rittberg, Fenner Stanley Tanswell & Jean Paul Van Bendegem - 2020 - Synthese 197 (9):3875-3904.
References found in this work
Foundations Without Foundationalism: A Case for Second-Order Logic.Stewart Shapiro - 1991 - Oxford, England: Oxford University Press.
From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931.Jean van Heijenoort (ed.) - 1967 - Cambridge: Harvard University Press.
Cantorian Set Theory and Limitation of Size.Michael Hallett - 1984 - Oxford, England: Clarendon Press.