Topics in Cognitive Science 5 (2):251-269 (2013)

Mathematical proofs generally allow for various levels of detail and conciseness, such that they can be adapted for a particular audience or purpose. Using automated reasoning approaches for teaching proof construction in mathematics presupposes that the step size of proofs in such a system is appropriate within the teaching context. This work proposes a framework that supports the granularity analysis of mathematical proofs, to be used in the automated assessment of students' proof attempts and for the presentation of hints and solutions at a suitable pace. Models for granularity are represented by classifiers, which can be generated by hand or inferred from a corpus of sample judgments via machine-learning techniques. This latter procedure is studied by modeling granularity judgments from four experts. The results provide support for the granularity of assertion-level proofs but also illustrate a degree of subjectivity in assessing step size
Keywords Assertion level  Machine learning  Proof presentation  Automated reasoning  Proof tutoring  Proof granularity
Categories (categorize this paper)
DOI 10.1111/tops.12012
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: 57,138
Through your library

References found in this work BETA

Mathematics and Plausible Reasoning.George Polya - 1954 - Princeton University Press.
The AProS Project: Strategic Thinking & Computational Logic.Wilfried Sieg - 2007 - Logic Journal of the IGPL 15 (4):359-368.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
66 ( #151,223 of 2,411,676 )

Recent downloads (6 months)
1 ( #539,172 of 2,411,676 )

How can I increase my downloads?


My notes