Categoricity and Mathematical Knowledge

Revista Portuguesa de Filosofia 73 (3-4):1423-1436 (2017)
  Copy   BIBTEX

Abstract

We argue that the basic notions of mathematics can only be properly formulated in an informal way. Mathematical notions transcend formalizations and their study involves the consideration of other mathematical notions. We explain the fundamental role of categoricity theorems in making these studies possible. We arrive at the conclusion that the enterprise of mathematics is not infallible and that it ultimately relies on degrees of evidence.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Proof, rigour and informality : a virtue account of mathematical knowledge.Fenner Stanley Tanswell - 2016 - St Andrews Research Repository Philosophy Dissertations.
On an application of categoricity.Alexander Paseau - 2005 - Proceedings of the Aristotelian Society 105 (3):411–415.
Mathematical arguments in context.Jean Paul Van Bendegem & Bart Van Kerkhove - 2009 - Foundations of Science 14 (1-2):45-57.
Categoricity and indefinite extensibility.James Walmsley - 2002 - Proceedings of the Aristotelian Society 102 (3):217–235.
Why Do We Prove Theorems?Yehuda Rav - 1998 - Philosophia Mathematica 6 (3):5-41.
Managing Informal Mathematical Knowledge: Techniques from Informal Logic.Andrew Aberdein - 2006 - Lecture Notes in Artificial Intelligence 4108:208--221.
Categoricity Spectra for Rigid Structures.Ekaterina Fokina, Andrey Frolov & Iskander Kalimullin - 2016 - Notre Dame Journal of Formal Logic 57 (1):45-57.
Relative categoricity and abstraction principles.Sean Walsh & Sean Ebels-Duggan - 2015 - Review of Symbolic Logic 8 (3):572-606.
Provability and mathematical truth.David Fair - 1984 - Synthese 61 (3):363 - 385.
Degrees That Are Not Degrees of Categoricity.Bernard Anderson & Barbara Csima - 2016 - Notre Dame Journal of Formal Logic 57 (3):389-398.
On the complexity of categoricity in computable structures.Walker M. White - 2003 - Mathematical Logic Quarterly 49 (6):603.

Analytics

Added to PP
2018-01-19

Downloads
15 (#923,100)

6 months
4 (#790,687)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references