Except in very poor mathematical contexts, mathematical arguments do not stand in isolation of other mathematical arguments. Rather, they form trains of formal and informal arguments, adding up to interconnected theorems, theories and eventually entire fields. This paper critically comments on some common views on the relation between formal and informal mathematical arguments, most particularly applications of Toulmin’s argumentation model, and launches a number of alternative ideas of presentation inviting the contextualization of pieces of mathematical reasoning within encompassing bodies of (...) explicit and implicit, formal and informal background knowledge. (shrink)

Except in very poor mathematical contexts, mathematical arguments do not stand in isolation of other mathematical arguments. Rather, they form trains of formal and informal arguments, adding up to interconnected theorems, theories and eventually entire fields. This paper critically comments on some common views on the relation between formal and informal mathematical arguments, most particularly applications of Toulmin’s argumentation model, and launches a number of alternative ideas of presentation inviting the contextualization of pieces of mathematical reasoning within encompassing bodies of (...) explicit and implicit, formal and informal background knowledge. (shrink)

We show that the bounded arithmetic theory V0 does not prove that the polynomial time hierarchy collapses to the linear time hierarchy . The result follows from a lower bound for bounded depth circuits computing prefix parity, where the circuits are allowed some auxiliary input; we derive this from a theorem of Ajtai.

We show that for each n ≥ 1, if T2n does not prove the weak pigeonhole principle for Σbn functions, then the collection scheme B Σ1 is not finitely axiomatizable over T2n. The same result holds with Sn2 in place of T 2n.