Skip to main content

Towards a Theory of Mathematical Argument

  • Chapter
  • First Online:
The Argument of Mathematics

Part of the book series: Logic, Epistemology, and the Unity of Science ((LEUS,volume 30))

Abstract

In this paper, I assume, perhaps controversially, that translation into a language of formal logic is not the method by which mathematicians assess mathematical reasoning. Instead, I argue that the actual practice of analyzing, evaluating and critiquing mathematical reasoning resembles, and perhaps equates with, the practice of informal logic or argumentation theory. It doesn’t matter whether the reasoning is a full-fledged mathematical proof or merely some non-deductive mathematical justification: in either case, the methodology of assessment overlaps to a large extent with argument assessment in non-mathematical contexts. I demonstrate this claim by considering the assessment of axiomatic or deductive proofs, probabilistic evidence, computer-aided proofs, and the acceptance of axioms. I also consider Jody Azzouni’s ‘derivation indicator’ view of proofs because it places derivations—which may be thought to invoke formal logic—at the center of mathematical justificatory practice. However, when the notion of ‘derivation’ at work in Azzouni’s view is clarified, it is seen to accord with, rather than to count against, the informal logical view I support. Finally, I pose several open questions for the development of a theory of mathematical argument.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Page numbers are to the anthologized version (Finocchiaro, 2005).

  2. 2.

    What Finocchiaro calls ‘interpretation’ is often called ‘analysis’. I prefer the latter term and generally use it instead.

  3. 3.

    I unceremoniously identify informal logic and argumentation theory and argumentation studies as a single entity—really a single kind of response to practical difficulties in theorizing about and teaching principles of argument appraisal/assessment. That the phrase informal logic is more often used by philosophers or that the phrase argumentation theory is more often used by researchers in communication studies is beside the point. The goal is the same: to produce a workable theory of argument appraisal.

  4. 4.

    Where ‘formal logic’ is understood as a theory of entailment which may include both formal semantics and formal proof theory.

  5. 5.

    This literature includes: (Aberdein, 20072005; Finocchiaro, 2003b; Krabbe, 1997), for example. Poincaré may be an interesting forerunner to this approach, cf. (Detlefsen, 19921993).

  6. 6.

    Some such definition is often prefatory to formal logic textbooks. The openness of ‘statements/sentences/…’ is simply to cover the expected variations in such definitions. See for example, (Mates, 1972, 5) versus (Allen and Hand, 2001, 1).

  7. 7.

    Johnson nowhere, as far as I can tell, dismisses the use of informal logic in mathematics. Instead, his concern is to distinguish proof from argument-proper.

  8. 8.

    If this assertion is too strong or too hasty, qualify it to read: The methods for assessing mathematical proofs resemble the methods for assessing non-mathematical arguments.

  9. 9.

    The angles in the original triangle, ABC, are labeled simply A, B or C respectively. The other angles are labeled more fully, e.g. ∠ADC, to avoid ambiguity.

  10. 10.

    One way to understand the mistake is that the argument treats the ‘f’ of f(x) to be capable of manipulation. Suppose f(x) = x 2. Then for any n, \(f(n) = f(-n)\). Then, dividing both sides by f, one gets \(n = -n\). Since sin is a function symbol, it isn’t itself manipulable. Instead, the function is manipulable only when it is given with an attending argument.

  11. 11.

    James Franklin (1987, revised version reprinted in this collection) gives a brief sample of some of the acceptable non-deductive methods.

  12. 12.

    In what follows I’ve left out the qualifier ‘gastronomic’ because, for the purposes of providing an example, it is unnecessary. Gastronomic Cannibalism is distinguished by physical anthropologists from Ritualistic Cannibalism solely in terms of purpose (Cáceres et al., 2007, 899).

  13. 13.

    For a textbook treatment of this scheme, see (Walton, 2006, 112–4).

  14. 14.

    The use of square brackets, ‘[’ and ‘]’, indicates that this material is either paraphrased from the original material or added to the material.

  15. 15.

    The conclusion is clearly indicated by the phrase ‘suggests a clear case of gastronomic cannibalism’.

  16. 16.

    For an illuminating philosophical discussion of the use of computers in the proof of the Four-Color Theorem see (Detlefsen and Luker, 1980).

  17. 17.

    Whereas DNA proofs will remain defeasible, computer proofs can have formal verifications.

  18. 18.

    For a different assessment using the tools of Toulmin diagrams, see (Aberdein, 2007). There, Aberdein reconstructs (a part of) the proof of the four-color theorem as an explicit Toulmin diagram. The use of Argumentation Schemes vs. Toulmin Diagrams shouldn’t be thought of as necessarily opposed. One may be able to capture all of the elements of a scheme in a diagram and vice versa.

  19. 19.

    Below I suggest that proofs by Mathematical Induction have much in common with Argumentation Schemes. Perhaps, Mathematical Induction is, simply put, a mathematical argumentation scheme. Again, Poincaré’s views on mathematical induction could importantly prefigure this idea, see (Detlefsen, 19921993).

  20. 20.

    Heath’s footnote at (Euclid, 1956, 284–5).

  21. 21.

    A distressing caveat: Euclid abbreviates his proofs, especially in the last step where the reasoning from a particular figure is generalized. This means that, strictly speaking, each of Euclid’s proofs is a proof sketch. This is different from the usual complaint about the incompleteness of Euclidean proofs. The usual complaint is that the diagram fills in tacit assumptions, like continuity, that should be made explicit, as in Pasch’s Axiom. I discuss proof sketches in more detail below.

  22. 22.

    There is nothing in the conception of informal logic I accept that would preclude the informal logician from partaking in the fruits of the formal logician’s labor. The informal logician simply denies that the method by which mathematical (or really any) reasoning gets appraised is translation into formal language and comparison with accepted formal results.

  23. 23.

    See Michael Malone’s argument that this is a theoretical as well as practical problem (Malone, 2003).

  24. 24.

    Other possible mathematical argumentation schemes include: mathematical symmetry arguments and mathematical analogies, e.g., (Steiner, 1998, 48ff.).

References

  • Aberdein, A. (2005). The uses of argument in mathematics. Argumentation, 19, 287–301.

    Article  Google Scholar 

  • Aberdein, A. (2007). The informal logic of mathematical proof. In J. P. Van Bendegam & B. Van Kerkove (Eds.), Perspectives on mathematical practices (pp. 135–151). Dordrecht: Springer.

    Chapter  Google Scholar 

  • Adleman, L. (1994). Molecular computation of solutions to combinatorial problems. Science, New Series, 266(5187), 1021–1024.

    Google Scholar 

  • Aigner, M., & Ziegler, G. M. (2002). Proofs from THE BOOK (2nd ed.). Berlin: Springer.

    Google Scholar 

  • Allen, C., & Hand, M. (2001). Primer in logic. Cambridge, MA: MIT Press.

    Google Scholar 

  • Azzouni, J. (2004). The derivation indicator view of mathematical practice. Philosophia Mathematica (3), 12, 81–105.

    Google Scholar 

  • Azzouni, J. (2006). Tracking reason. Oxford: Oxford University Press.

    Book  Google Scholar 

  • Cáceres, I., Lozana M., & Saladié, P. (2007). Evidence for Bronze Age cannibalism in El Mirador Cave (Sierra de Atapuerca, Burgos, Spain). American Journal of Physical Anthropology, 133, 899–917.

    Article  Google Scholar 

  • Copi, I., & Cohen, C. (1994). Introduction to logic (9th ed.). New York: Macmillan.

    Google Scholar 

  • Detlefsen, M., & Luker, M. (1980). The four-color theorem and mathematical proof. Journal of Philosophy, 77, 803–820.

    Article  Google Scholar 

  • Detlefsen, M. (1992). Poincaré against the logicians. Synthese, 90, 349–378.

    Article  Google Scholar 

  • Detlefsen, M. (1993). Poincaré vs. Russell on the role of logic in mathematics. Philosophia Mathematica (3), 1, 24–49.

    Google Scholar 

  • van Eemeren, F. H., & Grootendorst, R. (2003). A systematic theory of argumentation: The pragma-dialectical approach. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Euclid. (1956). The thirteen books of Euclid’s Elements (Vol. I). New York: Dover.

    Google Scholar 

  • Fallis, D. (1996). Mathematical proof and the reliability of DNA evidence. The American Mathematical Monthly, 103(6), 191–197.

    Article  Google Scholar 

  • Fallis, D. (1997). The epistemic status of probabilistic proofs. Journal of Philosophy, 94(4), 165–186.

    Article  Google Scholar 

  • Fallis, D. (2003). Intentional gaps in mathematical proofs. Synthese, 134, 45–69.

    Article  Google Scholar 

  • Finocchiaro, M. (1996). Critical thinking, critical reasoning and methodological reflection. Inquiry: Critical Thinking Across the Disciplines, 15, 66–79. (Reprinted in Finocchiaro, 2005, pp. 92–105).

    Google Scholar 

  • Finocchiaro, M. (2003a). Dialectic, evaluation and argument: Goldman and Johnson on the concept of argument. Informal Logic, 23, 19–49. (Reprinted in Finocchiaro, 2005, pp. 292–326).

    Google Scholar 

  • Finocchiaro, M. (2003b). Physical-mathematical reasoning: Galileo on the extruding power of terrestrial rotation. Synthese, 134, 217–244.

    Article  Google Scholar 

  • Finocchiaro, M. (2005). Arguments about arguments: Systematic, critical and historical essays in logical theory. Cambridge: Cambridge University Press.

    Google Scholar 

  • Franklin, J. (1987). Non-deductive logic in mathematics. British Journal for Philosophy of Science, 38(1), 1–18.

    Article  Google Scholar 

  • Gödel, K. (1983). What is Cantor’s continuum problem? In P. Benacerraf & H. Putnam (Eds.), Selected readings in philosophy of mathematics (pp. 470–485). Cambridge: Cambridge University Press. (Originally published 1947).

    Google Scholar 

  • Johnson, R. H. (2000). Manifest rationality: A pragmatic theory of argument. Mahwah, NJ: Lawrence Erlbaum Associates.

    Google Scholar 

  • Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85–103). New York: Plenum.

    Chapter  Google Scholar 

  • Krabbe, E. (1991). Quod erat demonstrandum: Wat kan en mag een argumentatietheorie zeggen over bewijzen? In M. M. H. Bax & W. Vuijk (Eds.), Thema’s in de Taalbeheersing: Lezingen van het VIOT-taalbeheersingscongres gehouden op 19, 20 en 21 december 1990 aan de Rijksuniversiteit Groningen (pp. 8–16). Dordrecht: ICG.

    Google Scholar 

  • Krabbe, E. (1997). Arguments, proofs and dialogues. In M. Astroh, D. Gerhardus & G. Heinzmann (Eds.), Dialogisches Handeln: Eine Festschrift für Kuno Lorenz (pp. 63–75). Heidelberg: Spektrum Akademischer Verlag. (This is an updated translation of (Krabbe 1991) and is reprinted in this volume)

    Google Scholar 

  • Lakatos, I. (1976). Proofs and refutations: The logic of mathematical discovery (edited by J. Worrall & E. Zahar). Cambridge: Cambridge University Press.

    Google Scholar 

  • Maddy, P. (1988). Believing the axioms, I and II. Journal of Symbolic Logic, 53(2), 482–511 and 53(3), 736–764.

    Article  Google Scholar 

  • Maddy, P. (1992). Realism in mathematics. Oxford: Clarendon Press.

    Book  Google Scholar 

  • Malone, M. (2003). Three recalcitrant problems of argument identification. Informal Logic, 23(3), 237–261.

    Google Scholar 

  • Mates, B. (1972). Elementary logic (2nd ed.). Oxford: Oxford University Press.

    Google Scholar 

  • Maxwell, E. A. (1959). Fallacies in mathematics. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Pólya, G. (1968). Mathematics and plausible reasoning (Vols. I and II). Princeton, NJ: Princeton University Press.

    Google Scholar 

  • Proclus. (1992). Commentary on the first book of Euclid’s Elements (Trans. by Glenn Morrow). Princeton, NJ: Princeton University Press.

    Google Scholar 

  • Putnam, H. (1975). What is mathematical truth? In H. Putnam (Ed.), Mathematics, matter and method: Philosophical papers (Vol. 1, pp. 60–78). Cambridge: Cambridge University Press.

    Chapter  Google Scholar 

  • Rav, Y. (1999). Why do we prove theorems? Philosophia Mathematica (3), 7, 5–41.

    Google Scholar 

  • Sandifer, C. E. (2007). Divergent series. How Euler did it (pp. 177–184). Washington, DC: Mathematical Association of America.

    Google Scholar 

  • Scriven, M. (1976). Reasoning. New York: McGraw-Hill.

    Google Scholar 

  • Steiner, M. (1998). The applicability of mathematics as a philosophical problem. Cambridge, MA: Harvard University Press.

    Google Scholar 

  • Toulmin, S. E. (2003). The uses of argument. Updated edition (of 1958). Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • Walton, D. (2006). Fundamentals of critical argumentation. Cambridge: Cambridge University Press.

    Google Scholar 

  • Walton, D., & Krabbe, E. (1995). Commitment in dialogue: Basic concepts of interpersonal reasoning. Albany, NY: State University of New York Press.

    Google Scholar 

  • Zermelo, E. (1908). A new proof of the possibility of well-ordering. In J. van Heijenoort (Ed.). (1967). From Frege to Godel: A source book in mathematical logic, 1879–1931 (pp. 183–198). Cambridge, MA: Harvard University Press. (Originally published in Mathematische Annalen, 65, 107–128)

    Google Scholar 

Download references

Acknowledgements

A prior version of this paper was published in Foundations of Science (2009), 14(1–2):137–152. It received careful and helpful criticism from Andrew Aberdein and David Sherry. I thank them both. Previous versions of this paper were presented in Las Vegas and Amsterdam. I thank the audiences for their helpful questions and comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ian J. Dove .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Dove, I.J. (2013). Towards a Theory of Mathematical Argument. In: Aberdein, A., Dove, I. (eds) The Argument of Mathematics. Logic, Epistemology, and the Unity of Science, vol 30. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-6534-4_15

Download citation

Publish with us

Policies and ethics