In the nineteenth and twentieth centuries many mathematicians referred to intuition as the indispensable research tool for obtaining new results. In this essay we will analyse a group of mathematicians who interacted with Luitzen Egbertus Jan Brouwer in order to compare their conceptions of intuition. We will see how to the same word “intuition” very different meanings corresponded: they varied from geometrical vision, to a unitary view of a demonstration, to the perception of time, to the faculty of considering concepts (...) that habitually occur in our thinking separately. Furthermore, we will discover that these different meanings had a philosophical, very relevant counterside: they passed from a racial characterization of mathematics to a pluralistic view of it. (shrink)

Ranging from Alan Turing’s seminal 1936 paper to the latest work on Kolmogorov complexity and linear logic, this comprehensive new work clarifies the relationship between computability on the one hand and constructivity on the other. The authors argue that even though constructivists have largely shed Brouwer’s solipsistic attitude to logic, there remain points of disagreement to this day. Focusing on the growing pains computability experienced as it was forced to address the demands of rapidly expanding applications, the content maps the (...) developments following Turing’s ground-breaking linkage of computation and the machine, the resulting birth of complexity theory, the innovations of Kolmogorov complexity and resolving the dissonances between proof theoretical semantics and canonical proof feasibility. Finally, it explores one of the most fundamental questions concerning the interface between constructivity and computability: whether the theory of recursive functions is needed for a rigorous development of constructive mathematics. This volume contributes to the unity of science by overcoming disunities rather than offering an overarching framework. It posits that computability’s adoption of a classical, ontological point of view kept these imperatives separated. In studying the relationship between the two, it is a vital step forward in overcoming the disagreements and misunderstandings which stand in the way of a unifying view of logic. (shrink)

Abstract The aim of this paper is to take a look at Péter's talk "Rekursivität und Konstruktivität" delivered at the Constructivity in Mathematics Colloquium in 1957, where she challenged Church's Thesis from a constructive point of view. The discussion of her argument and motivations is then connected to her earlier work on recursion theory as well as her later work on theoretical computer science.

Michael Dummett has interpreted and expounded upon intuitionism under the influence of Wittgensteinian views on language, meaning and cognition. I argue against the application of some of these views to intuitionism and point to shortcomings in Dummett's approach. The alternative I propose makes use of recent, post-Wittgensteinian views in the philosophy of mind, meaning and language. These views are associated with the claim that human cognition exhibits intentionality and with related ideas in philosophical psychology. Intuitionism holds that mathematical constructions are (...) mental processes or objects. Constructions are, in the first instance, forms of consciousness or possible experience of a particular type. As such, they must be understood in terms of the concept of intentionality. This view has a historical basis in the literature on intuitionism. In a famous 1931 lecture Heyting in fact identifies constructions with fulfilled or fulfillable mathematical intentions. I consider some of the consequences of this identification and contrast them with Dummett's views on intuitionism. (shrink)

Despite being one of the most dependable methods used by applied mathematicians and engineers in handling complex systems, the finite element method commits variational crimes. This paper contextualizes the concept of variational crime within a broader account of mathematical practice by explaining the tradeoff between complexity and accuracy involved in the construction of numerical methods. We articulate two standards of accuracy used to determine whether inexact solutions are good enough and show that, despite violating the justificatory principles of one, the (...) finite element method nevertheless succeeds in obtaining its legitimacy from the other. (shrink)