Details

Subject(s)

• Mathematics—Philosophy [Browse]
• Purity (Philosophy) [Browse]
• Proof theory [Browse]
• Logic, Symbolic and mathematical [Browse]

Series

• Cambridge elements. Elements in the philosophy of mathematics [More in this series]
• Cambridge elements. Elements in the philosophy of mathematics, 2399-2883 [More in this series]

Summary note

A proof of a theorem can be said to be pure if it draws only on what is 'close' or 'intrinsic' to that theorem. In this Element we will investigate the apparent preference for pure proofs that has persisted in mathematics since antiquity, alongside a competing preference for impurity. In Section 1, we present two examples of purity, from geometry and number theory. In Section 2, we give a brief history of purity in mathematics. In Section 3, we discuss several different types of purity, based on different measures of distance between theorem and proof. In Section 4 we discuss reasons for preferring pure proofs, for the varieties of purity constraints presented in Section 3. In Section 5 we conclude by reflecting briefly on purity as a preference for the local and how issues of translation intersect with the considerations we have raised throughout this work.

Notes

Title from publisher's bibliographic system (viewed on 05 Dec 2024).

ISBN

9781009052719 (ebook)

Statement on responsible collection description

Princeton University Library aims to describe library materials in a manner that is respectful to the individuals and communities who create, use, and are represented in the collections we manage. Read more...