What Does ‘Depth’ Mean in Mathematics?

Philosophia Mathematica 23 (2):215-232 (2015)
  Copy   BIBTEX

Abstract

This paper explores different interpretations of the word ‘deep’ as it is used by mathematicians, with a large number of examples illustrating various criteria for depth. Most of the examples are theorems with ‘historical depth’, in the sense that many generations of mathematicians contributed to their proof. Some also have ‘foundational depth’, in the sense that they support large mathematical theories. Finally, concepts from mathematical logic suggest that it may be possible to order certain theorems or problems according to ‘logical depth’

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

Depth — A Gaussian Tradition in Mathematics.Jeremy Gray - 2015 - Philosophia Mathematica 23 (2):177-195.
Depth and Explanation in Mathematics.Marc Lange - 2015 - Philosophia Mathematica 23 (2):196-214.
Classification and interpretation.Andreas Baudisch - 1989 - Journal of Symbolic Logic 54 (1):138-159.
Depth relevance of some paraconsistent logics.Ross T. Brady - 1984 - Studia Logica 43 (1-2):63 - 73.
Merleau-ponty's concept of depth.Anthony J. Steinbock - 1987 - Philosophy Today 31 (4):336-351.
On Pretabular Logics in NExtK4 (Part I).Shan Du & Hongkui Kang - 2014 - Studia Logica 102 (3):499-523.
The Depth of Resolution Proofs.Alasdair Urquhart - 2011 - Studia Logica 99 (1-3):349-364.
Comparing Borel Reducibility and Depth of an ω-Stable Theory.Martin Koerwien - 2009 - Notre Dame Journal of Formal Logic 50 (4):365-380.

Analytics

Added to PP
2014-12-26

Downloads
36 (#432,773)

6 months
6 (#504,917)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Mathematical Fit: A Case Study.Manya Raman-Sundström & Lars-Daniel Öhman - forthcoming - Philosophia Mathematica:nkw015.
On the Depth of Gödel’s Incompleteness Theorems.Yong Cheng - forthcoming - Philosophia Mathematica.

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Subsystems of Second Order Arithmetic.Stephen G. Simpson - 1999 - Studia Logica 77 (1):129-129.

Add more references