Philosophia Mathematica 21 (3):323-338 (2013)

Jody Azzouni
Tufts University
Mistaken reasons for thinking diagrammatic proofs aren't rigorous are explored. The main result is that a confusion between the contents of a proof procedure (what's expressed by the referential elements in a proof procedure) and the unarticulated mathematical aspects of a proof procedure (how that proof procedure is enabled) gives the impression that diagrammatic proofs are less rigorous than language proofs. An additional (and independent) factor is treating the impossibility of naturally generalizing a diagrammatic proof procedure as an indication of lack of rigor
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/philmat/nkt015
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: 58,467
Through your library

References found in this work BETA

The Euclidean Diagram.Kenneth Manders - 2008 - In Paolo Mancosu (ed.), The Philosophy of Mathematical Practice. Oxford University Press. pp. 80--133.
Proofs, Pictures, and Euclid.John Mumma - 2010 - Synthese 175 (2):255 - 287.
Diagram-Based Geometric Practice.Kenneth Manders - 2008 - In Paolo Mancosu (ed.), The Philosophy of Mathematical Practice. Oxford University Press. pp. 65--79.

View all 8 references / Add more references

Citations of this work BETA

Perceiving Necessity.Catherine Legg & James Franklin - 2017 - Pacific Philosophical Quarterly 98 (3).
Non-Deductive Methods in Mathematics.Alan Baker - 2010 - Stanford Encyclopedia of Philosophy.

Add more citations

Similar books and articles

On Automating Diagrammatic Proofs of Arithmetic Arguments.Mateja Jamnik, Alan Bundy & Ian Green - 1999 - Journal of Logic, Language and Information 8 (3):297-321.
A Diagrammatic Inference System with Euler Circles.Koji Mineshima, Mitsuhiro Okada & Ryo Takemura - 2012 - Journal of Logic, Language and Information 21 (3):365-391.
.[author unknown] - unknown
Granularity Analysis for Mathematical Proofs.Marvin R. G. Schiller - 2013 - Topics in Cognitive Science 5 (2):251-269.
The Surveyability of Long Proofs.Edwin Coleman - 2009 - Foundations of Science 14 (1-2):27-43.


Added to PP index

Total views
72 ( #140,916 of 2,421,228 )

Recent downloads (6 months)
4 ( #192,306 of 2,421,228 )

How can I increase my downloads?


My notes