Analysis of online mathematics forums can help reveal how explanation is used by mathematicians; we contend that this use of explanation may help to provide an informal conceptualization of simplicity. We extracted six conjectures from recent philosophical work on the occurrence and characteristics of explanation in mathematics. We then tested these conjectures against a corpus derived from online mathematical discussions. To this end, we employed two techniques, one based on indicator terms, the other on a random sample of comments lacking (...) such indicators. Our findings suggest that explanation is widespread in mathematical practice and that it occurs not only in proofs but also in other mathematical contexts. Our work also provides further evidence for the utility of empirical methods in addressing philosophical problems. (shrink)

To adequately model mathematical arguments the analyst must be able to represent the mathematical objects under discussion and the relationships between them, as well as inferences drawn about these objects and relationships as the discourse unfolds. We introduce a framework with these properties, which has been used to analyse mathematical dialogues and expository texts. The framework can recover salient elements of discourse at, and within, the sentence level, as well as the way mathematical content connects to form larger argumentative structures. (...) We show how the framework might be used to support computational reasoning, and argue that it provides a more natural way to examine the process of proving theorems than do Lamport’s structured proofs. (shrink)

Records of online collaborative mathematical activity provide us with a novel, rich, searchable, accessible and sizeable source of data for empirical investigations into mathematical practice. In this paper we discuss how the resources of crowdsourced mathematics can be used to help formulate and answer questions about mathematical practice, and what their limitations might be. We describe quantitative approaches to studying crowdsourced mathematics, reviewing work from cognitive history (comparing individual and collaborative proofs); social psychology (on the prospects for a measure of (...) collective intelligence); human–computer interaction (on the factors that led to the success of one such project); network analysis (on the differences between collaborations on open research problems and known-but-hard problems); and argumentation theory (on modelling the argument structures of online collaborations). We also give an overview of qualitative approaches, reviewing work from empirical philosophy (on explanation in crowdsourced mathematics); sociology of scientific knowledge (on conventions and conversations in online mathematics); and ethnography (on contrasting conceptions of collaboration). We suggest how these diverse methods can be applied to crowdsourced mathematics and when each might be appropriate. (shrink)

We consider total well-founded orderings on monadic terms satisfying the replacement and full invariance properties. We show that any such ordering on monadic terms in one variable and two unary function symbols must have order typeω,ω2orωω. We show that a familiar construction gives rise to continuum many such orderings of order typeω. We construct a new family of such orderings of order typeω2, and show that there are continuum many of these. We show that there are only four such orderings (...) of order typeωω, the two familiar recursive path orderings and two closely related orderings. We consider also total well-founded orderings onNnwhich are preserved under vector addition. We show that any such ordering must have order typeωkfor some 1 ≤k≤n. We show that ifkshrink)

We consider total well-founded orderings on monadic terms satisfying the replacement and full invariance properties. We show that any such ordering on monadic terms in one variable and two unary function symbols must have order type $\omega, \omega^2$ or $\omega^\omega$. We show that a familiar construction gives rise to continuum many such orderings of order type $\omega$. We construct a new family of such orderings of order type $\omega^2$, and show that there are continuum many of these. We show that (...) there are only four such orderings of order type $\omega^\omega$, the two familiar recursive path orderings and two closely related orderings. We consider also total well-founded orderings on $\mathbf{N}^n$ which are preserved under vector addition. We show that any such ordering must have order type $\omega^k$ for some $1 \leq k \leq n$. We show that if $k < n$ there are continuum many such orderings, and if $k = n$ there are only $n$!, the $n$! lexicographic orderings. (shrink)