Newsletter of Phenomenology

Keeping phenomenologists informed since May 2002

Repository | Book | Chapter

185153

(1978) The infinite in mathematics, Dordrecht, Springer.

The problem of complete decidability of arithmetical questions

Felix Kaufmann

pp. 151-157

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.

Publication details

DOI: 10.1007/978-94-009-9795-0_8

Full citation:

Kaufmann, F. (1978). The problem of complete decidability of arithmetical questions, in The infinite in mathematics, Dordrecht, Springer, pp. 151-157.

This document is unfortunately not available for download at the moment.