Metodo

International Studies in Phenomenology and Philosophy

Book | Chapter

188667

Euclidean arithmetic

the finitary theory of finite sets

J.P. Mayberry

pp. 227-243

Abstract

There is a central fallacy that underlies all our thinking about the foundations of arithmetic. It is the conviction that the mere description of the natural numbers as the 'successors of zero" (i.e., as what you get by starting at 0 and iterating the operation xx + 1) suffices, on its own, to characterise the order and arithmetical properties of those numbers absolutely. This is what leads us to suppose that the dots of ellipsis in

Publication details

Published in:

Sommaruga Giovanni (2011) Foundational theories of classical and constructive mathematics. Dordrecht, Springer.

Pages: 227-243

DOI: 10.1007/978-94-007-0431-2_12

Full citation:

Mayberry J.P. (2011) „Euclidean arithmetic: the finitary theory of finite sets“, In: G. Sommaruga (ed.), Foundational theories of classical and constructive mathematics, Dordrecht, Springer, 227–243.