Husserl on the 'Totality of all conceivable arithmetical operations'

History and Philosophy of Logic 27 (3):211-228 (2006)
  Copy   BIBTEX

Abstract

In the present paper, we discuss Husserl's deep account of the notions of ?calculation? and of arithmetical ?operation? which is found in the final chapter of the Philosophy of Arithmetic, arguing that Husserl is as far as we know the first scholar to reflect seriously on and to investigate the problem of circumscribing the totality of computable numerical operations. We pursue two complementary goals, namely: (i) to provide a formal reconstruction of Husserl's intuitions, and (ii) to demonstrate on the basis of our reconstruction that the class of operations that Husserl has in mind turns out to be extensionally equivalent to the one that, in contemporary logic, is known as the class of partial recursive functions

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2010-08-10

Downloads
34 (#407,230)

6 months
2 (#668,348)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Stefania Centrone
Technische Universität Berlin

References found in this work

An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.
Philosophie der Arithmetik.E. G. Husserl - 1891 - The Monist 2:627.
Philosophie der Arithmetik.E. S. Husserl - 1892 - Philosophical Review 1 (3):327-330.
General Recursive Functions.Julia Robinson - 1951 - Journal of Symbolic Logic 16 (4):280-280.
Recursive Function Theory and Logic.Ann Yasuhara - 1975 - Journal of Symbolic Logic 40 (4):619-620.

View all 6 references / Add more references