Continuous as the stars that shine And twinkle on the milky way, They stretched in never-ending line Along the margin of a bay: Ten thousand saw I at a glance, Tossing their heads in sprightly dance.

Despite the great success of Weierstrass, Dedekind and Cantor in constructing the continuum from arithmetical materials, a number of thinkers of the late 19th and early 20th centuries remained opposed, in varying degrees, to the idea of explicating the continuum concept entirely in discrete terms. These include the mathematicians du Bois-Reymond, Veronese, Poincaré, Brouwer and Weyl, and the philosophers Brentano..

Hermann Weyl, one of the twentieth century's greatest mathematicians, was unusual in possessing acute literary and philosophical sensibilities—sensibilities to which he gave full expression in his writings. In this paper I use quotations from these writings to provide a sketch of Weyl's philosophical orientation, following which I attempt to elucidate his views on the mathematical continuum, bringing out the central role he assigned to intuition.

The widespread idea that infinitesimals were “eliminated” by the “great triumvirate” of Cantor, Dedekind, and Weierstrass is refuted by an uninterrupted chain of work on infinitesimal-enriched number systems. The elimination claim is an oversimplification created by triumvirate followers, who tend to view the history of analysis as a pre-ordained march toward the radiant future of Weierstrassian epsilontics. In the present text, we document distortions of the history of analysis stemming from the triumvirate ideology of ontological minimalism, which identified the continuum (...) with a single number system. Such anachronistic distortions characterize the received interpretation of Stevin, Leibniz, d’Alembert, Cauchy, and others. (shrink)

The metaphysical concept of continuity is important, not least because physical continua are not known to be impossible. While it is standard to model them with a mathematical continuum based upon set-theoretical intuitions, this essay considers, as a contribution to the debate about the adequacy of those intuitions, the neglected intuition that dividing the length of a line by the length of an individual point should yield the line’s cardinality. The algebraic properties of that cardinal number are derived pre-theoretically from (...) the obvious properties of a line of points, whence it becomes clear that such a number would cohere surprisingly well with our elementary number systems. (shrink)

Recent mathematical results, obtained by the author, in collaboration with Alexander Stokolos, Olof Svensson, and Tomasz Weiss, in the study of harmonic functions, have prompted the following reflections, intertwined with views on some turning points in the history of mathematics and accompanied by an interpretive key that could perhaps shed some light on other aspects of (the development of) mathematics.

In the course of ten short sections, we comment on Gödel's seminal dialectica paper of fifty years ago and its aftermath. We start by suggesting that Gödel's use of functionals of finite type is yet another instance of the realistic attitude of Gödel towards mathematics, in tune with his defense of the postulation of ever increasing higher types in foundational studies. We also make some observations concerning Gödel's recasting of intuitionistic arithmetic via the dialectica interpretation, discuss the extra principles that (...) the interpretation validates and comment on extensionality and higher order equality. The latter sections focus on the role of majorizability considerations within the dialectica and related interpretations for extracting computational information from ordinary proofs in mathematics. (shrink)

Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics or a prediction in numerical (...) economics could mean. Method: An algebraic simple model system is subjected to a deeper structure of underlying variables. With an algorithm simulating the steps in taking a limit of second order difference quotients the error terms are studied at the background of their algebraic expression. Results: With the algorithm that was applied to a simple quadratic polynomial system we found unstably amplified round-off errors. The possibility of numerical chaos is already known but not in such a simple system as used in our paper. The amplification of the errors implies that it is not possible with computer means to constructively show that the algebra and numerical analysis will ‘on the long run’ converge to each other and the error term will vanish. The algebraic vanishing of the error term cannot be demonstrated with the use of the computer because the round-off errors are amplified. In philosophical terms, the amplification of the round-off error is equivalent to the continuum hypothesis. This means that the requirement of (numerical) construction of mathematical objects is no safeguard against inference-only conclusions of qualities of (numerical) mathematical objects. Unstably amplified round-off errors are a same type of problem as the ordering in size of transfinite cardinal numbers. The difference is that the former problem is created within the requirements of constructive mathematics. This can be seen as the reward for working numerically constructive. (shrink)

In this paper, I present a puzzle involving special relativity and the random selection of real numbers. In a manner to be specified, darts thrown later hit reals further into a fixed well-ordering than darts thrown earlier. Special relativity is then invoked to create a puzzle. I consider four ways of responding to this puzzle which, I suggest, fail. I then propose a resolution to the puzzle, which relies on the distinction between the potential infinite and the actual infinite. I (...) suggest that certain structures, such as a well-ordering of the reals, or the natural numbers, are examples of the potential infinite, whereas infinite integers in a nonstandard model of arithmetic are examples of the actual infinite. (shrink)

Defining the real numbers by abstraction as ratios of quantities gives prominence to then- applications in just the way that Frege thought we should. But if all the reals are to be obtained in this way, it is necessary to presuppose a rich domain of quantities of a land we cannot reasonably assume to be exemplified by any physical or other empirically measurable quantities. In consequence, an explanation of the applications of the reals, defined in this way, must proceed indirectly. (...) This paper explains the main complications involved and answers the main objections advanced in Batitsky's paper in this issue. (shrink)

On the neo-Fregean approach to the foundations of mathematics, elementary arithmetic is analytic in the sense that the addition of a principle wliich may be held to IMJ explanatory of the concept of cardinal number to a suitable second-order logical basis suffices for the derivation of its basic laws. This principle, now commonly called Hume's principle, is an example of a Fregean abstraction principle. In this paper, I assume the correctness of the neo-Fregean position on elementary aritlunetic and seek to (...) explain one way in which it may be extended to encompass the theory of real numbers, introducing the reals, by means of suitable further abstraction principles, as ratios of quantities. (shrink)

Model theorists have been studying analytic functions since the late 1970s. Highlights include the seminal work of Denef and van den Dries on the theory of the p-adics with restricted analytic functions, Wilkie's proof of o-minimality of the theory of the reals with the exponential function, and the formulation of Zilber's conjecture for the complex exponential. My goal in this talk is to survey these main developments and to reflect on today's open problems, in particular for theories of valued fields.

This paper explores strengths and limitations of both predicativism and nominalism, especially in connection with the problem of characterizing the continuum. Although the natural number structure can be recovered predicatively (despite appearances), no predicative system can characterize even the full predicative continuum which the classicist can recognize. It is shown, however, that the classical second-order theory of continua (third-order number theory) can be recovered nominalistically, by synthesizing mereology, plural quantification, and a modal-structured approach with essentially just the assumption that an (...) -sequence of concrete atoms be possible. Predicative flexible type theory may then be used to carry out virtually all of scientifically applicable mathematics in a natural way, still without ultimate need of the platonist ontology of classes and relations. (shrink)

We develop a point-free construction of the classical one- dimensional continuum, with an interval structure based on mereology and either a weak set theory or logic of plural quantification. In some respects this realizes ideas going back to Aristotle,although, unlike Aristotle, we make free use of classical "actual infinity". Also, in contrast to intuitionistic, Bishop, and smooth infinitesimal analysis, we follow classical analysis in allowing partitioning of our "gunky line" into mutually exclusive and exhaustive disjoint parts, thereby demonstrating the independence (...) of "indecomposability" from a non-punctiform conception. It is surprising that such simple axioms as ours already imply the Archimedean property and that they determine an isomorphism with the Dedekind-Cantor structure of R as a complete, separable, ordered field. We also present some simple topological models of our system, establishing consistency relative to classical analysis. Finally, after describing how to nominalize our theory, we close with comparisons with earlier efforts related to our own. (shrink)

The integration of reasoning and computation services across system and language boundaries has been mostly treated from an engineering perspective. In this paper we take a foundational point of view. We identify the following form of integration problems: an informal (mathematical; i.e, logically underspecified) specification has multiple concrete formal implementations between which queries and results have to be transported. The integration challenge consists in dealing with the implementation-specific details such as additional constants and properties. We pinpoint their role in safe (...) and unsafe integration schemes and propose a proof-theoretic solution based on modular theory-graphs that include the meta-logical foundations. This also gives a clean conceptual basis for earlier attempts that explain integration via “content/semantic markup”. (shrink)

The article deals with Cantor’s argument for the non-denumerability of reals somewhat in the spirit of Lakatos’ logic of mathematical discovery. At the outset Cantor’s proof is compared with some other famous proofs such as Dedekind’s recursion theorem, showing that rather than usual proofs they are resolutions to do things differently. Based on this I argue that there are “ontologically” safer ways of developing the diagonal argument into a full-fledged theory of continuum, concluding eventually that famous semantic paradoxes based on (...) diagonal construction are caused by superficial understanding of what a name is. (shrink)

This book constitutes the refereed proceedings of the Third International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2005, held in Moscow, Russia in October 2005. The 14 revised full papers presented together with 5 invited papers were carefully reviewed and selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations whith a special focus on new algorithmic ideas involving stochastic decisions and the design and evaluation (...) of stochastic algorithms within realistic scenarios. (shrink)

There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...) Cohen et al. (Eds.), Potentiality, Entanglement, and Passion-at-a-Distance: Quantum Mechanical Studies fo Abner Shimony, Vol. 2, Kluwer Academic Publishers, Great Britain, 1997, pp. 177–190]. Unlike some others in the literature, these notions apply not only to certain nice sets, but to general sets in Rn and other appropriate spaces. We consider some motivations for these concepts and the logical relations between them. It has been argued that d.m.z. is especially appropriate for physical applications, and on Rn with the standard measure, it is strictly stronger than r.a. [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382]. Here we show that this is the only implication that holds among our three decidabilities in that setting. Under arbitrary measures, even this implication fails. Yet for intervals of non-zero length, and more generally, convex sets of non-zero measure, the three concepts are equivalent. (shrink)