David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
For most of its history, mathematics was fairly constructive: • Euclidean geometry was based on geometric construction. • Algebra sought explicit solutions to equations. Analysis, probability, etc. were focused on calculations. Nineteenth century developments in analysis challenged this view. A sequence (an) in a metric space is said Cauchy if for every ε > 0, there is an m such that for every n, n ≥ m, d (a n , a n ) < ε
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Viggo Stoltenberg-Hansen & John V. Tucker (2003). Computable and Continuous Partial Homomorphisms on Metric Partial Algebras. Bulletin of Symbolic Logic 9 (3):299-334.
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Mark B. Couch (2005). Functional Properties and Convergence in Biology. Philosophy of Science 72 (5):1041-1051.
Joachim Schummer, From Nano-Convergence to NBIC-Convergence: “The Best Way to Predict the Future is to Create It”.
Michael Rescorla (2012). Copeland and Proudfoot on Computability. Studies in History and Philosophy of Science Part A 43 (1):199-202.
Malcolm Parker (2007). Two Into One Won't Go: Conceptual, Clinical, Ethical and Legal Impedimenta to the Convergence of Cam and Orthodox Medicine. [REVIEW] Journal of Bioethical Inquiry 4 (1):7-19.
Stewart Shapiro (1983). Remarks on the Development of Computability. History and Philosophy of Logic 4 (1-2):203-220.
Kajsa Bråting (2012). Ambiguities of Fundamental Concepts in Mathematical Analysis During the Mid-Nineteenth Century. Foundations of Science 17 (4):301-320.
Alexandre Borovik & Mikhail G. Katz (2012). Who Gave You the Cauchy–Weierstrass Tale? The Dual History of Rigorous Calculus. Foundations of Science 17 (3):245-276.
George Boolos, John Burgess, Richard P. & C. Jeffrey (2007). Computability and Logic. Cambridge University Press.
A. S. Troelstra (1988). Constructivism in Mathematics: An Introduction. Sole Distributors for the U.S.A. And Canada, Elsevier Science Pub. Co..
Herbert B. Enderton (2011). Computability Theory: An Introduction to Recursion Theory. Academic Press.
Stewart Shapiro (1980). On the Notion of Effectiveness. History and Philosophy of Logic 1 (1-2):209-230.
Added to index2012-09-05
Total downloads5 ( #225,820 of 1,100,749 )
Recent downloads (6 months)2 ( #176,465 of 1,100,749 )
How can I increase my downloads?