“Sind die Zahlformeln beweisbar?”

By a numerical formula, we shall understand an equation, \(m=n\) , between closed numerical terms, m and n. Assuming with Frege that numerical formulae, when true, are demonstrable, the main question to be considered here is what form such a demonstration takes. On our way to answering the question, we are led to more general questions regarding the proper formalization of arithmetic. In particular, we shall deal with calculation, definition, identity, and inference by induction.