Proofs and rebuttals: Applying Stephen Toulmin's layout of arguments to mathematical proof
Graduate studies at Western
In Marta Bílková & Ondřej Tomala (eds.), The Logica Yearbook 2005. Filosofia (2006)
|Abstract||This paper explores some of the benefits informal logic may have for the analysis of mathematical inference. It shows how Stephen Toulmin’s pioneering treatment of defeasible argumentation may be extended to cover the more complex structure of mathematical proof. Several common proof techniques are represented, including induction, proof by cases, and proof by contradiction. Affinities between the resulting system and Imre Lakatos’s discussion of mathematical proof are then explored.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|External links||This entry has no external links. Add one.|
|Through your library||Configure|
Similar books and articles
Andrew Aberdein (2005). The Uses of Argument in Mathematics. Argumentation 19 (3):287-301.
Andrew Aberdein (2006). The Informal Logic of Mathematical Proof. In Reuben Hersh (ed.), 18 Unconventional Essays About the Nature of Mathematics. Springer-Verlag.
Andrew Aberdein (2011). The Dialectical Tier of Mathematical Proof. In Frank Zenker (ed.), Argumentation: Cognition & Community. Proceedings of the 9th International Conference of the Ontario Society for the Study of Argumentation (OSSA), May 18--21, 2011. OSSA.
Edwin Coleman (2009). The Surveyability of Long Proofs. Foundations of Science 14 (1-2):27-43.
Carlo Cellucci (2008). Why Proof? What is a Proof? In Giovanna Corsi & Rossella Lupacchini (eds.), Deduction, Computation, Experiment. Exploring the Effectiveness of Proof, pp. 1-27. Springer.
Marvin R. G. Schiller (2013). Granularity Analysis for Mathematical Proofs. Topics in Cognitive Science 5 (2):251-269.
Jeremy Avigad (2006). Mathematical Method and Proof. Synthese 153 (1):105 - 159.
David J. Pym (2004). Reductive Logic and Proof-Search: Proof Theory, Semantics, and Control. Oxford University Press.
Mateja Jamnik, Alan Bundy & Ian Green (1999). On Automating Diagrammatic Proofs of Arithmetic Arguments. Journal of Logic, Language and Information 8 (3):297-321.
Konstantine Arkoudas & Selmer Bringsjord (2007). Computers, Justification, and Mathematical Knowledge. Minds and Machines 17 (2):185-202.
J. Azzouni (2013). The Relationship of Derivations in Artificial Languages to Ordinary Rigorous Mathematical Proof. Philosophia Mathematica 21 (2):247-254.
Felix Mühlhölzer (2006). "A Mathematical Proof Must Be Surveyable" What Wittgenstein Meant by This and What It Implies. Grazer Philosophische Studien 71 (1):57-86.
Sorry, there are not enough data points to plot this chart.
Added to index2011-08-05
Recent downloads (6 months)0
How can I increase my downloads?