Book | Chapter

185161

The problem of complete decidability of arithmetical questions

Felix Kaufmann

pp. 151-157

Abstract

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

Published in:

Kaufmann Felix (1978) The infinite in mathematics: logico-mathematical writings. Dordrecht, Springer.

Pages: 151-157

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

Full citation:

Kaufmann Felix (1978) The problem of complete decidability of arithmetical questions, In: The infinite in mathematics, Dordrecht, Springer, 151–157.