The problem of complete decidability of arithmetical questions
pp. 151-157
in: , The infinite in mathematics, Berlin, Springer, 1978Abstract
The foundations for treating the problem of decidability of arithmetical questions have already been created in earlier sections, namely by the analysis of "judgments' or "meaningful assertions', by observing the monomorphism of the axiom systems for the natural numbers and finally by the critical dissolution of the doctrine of the non-denumerable infinite.