In the first author's thesis [10], a sequential language, LRT, for real number computation is investigated. That thesis includes a proof that all polynomials are programmable, but that work comes short of giving a complete characterization of the expressive power of the language even for first-order functions. The technical problem is that LRT is non-deterministic. So a natural characterization of its expressive power should be in terms of relations rather than in terms of functions. In [2], Brattka examines a (...) formalization of recursive relations in the style of Kleene's recursive functions on the natural numbers. This paper is an expanded version of [13] which establishes the expressive power of LRTp, a variant of LRT, in terms of Brattka's recursive relations. Because Brattka already did the work of establishing the precise connection between his recursive relations and Type 2 Theory of Effectivity, we thus obtain a complete characterization of first-order definability in LRTp. (shrink)

We study some representations of real numbers. We compare these representations, on the one hand from the viewpoint of recursive functionals, and of complexity on the other hand.The impossibility of obtaining some functions as recursive functionals is, in general, easy. This impossibility may often be explicited in terms of complexity: - existence of a sequence of low complexity whose image is not a recursive sequence, - existence of objects of low complexity but whose images have arbitrarily high time- (...) complexity .Moreover, some representations of real numbers that are equivalent from the viewpoint of recursive functionals, are very distinct from the viewpoint of complexity.We make a particular study of representations via continued fractions . We precise exactly what part of information available in the x's dfc is equivalent to the information available in its Dedekinds cut. We show that the sum of two reals whose dfcs are polynomial-time computable may be a real whose dfc has time complexity arbitrarily high.This work confirms that the unique representation of real numbers suitable for the ordinary calculus is via explicit Cauchy sequences of rationals.RésuméNous étudions différentes manières de présenter les nombres réels. Nous comparons ces présentations du point de vue des fonctionnelles récursives d'une part, et de celui des classes de complexité d'autre part.L'impossibilité d'obtenir certaines fonctions sous forme de fonctionnelles récursives est en général facile à établir. Cette impossiblité peut souvent être explicitée en termes de complexité: - il existe une suite de faible complexité dont l'image est une suite non récursive, - il existe des objets de faible complexité mais dont les images sont des objets de complexité arbitrairement grande .En outre, certaines présentations des réels équivalentes du point de vue des fonctionnelles récursives se distinguent nettement du point de vue de la complexité.Nous faisons une étude particulière concernant les développements en fraction continue . Nous précisions exactement quelle est la partie de l'information disponible dans le dfc d'un réel x qui équivaut à l'information disponible dans sa coupure de Dedekind. Nous montrons également que la somme de deux réels dont le dfc est calculable en temps polynomial peut être un réel dont le dfc est de complexité arbitrairement grande.Ce travail confirme que seule une présentation des réels via des suites de rationnels explicitement de Cauchy est adaptée aux calculs avec les réels. (shrink)

A real is computable if it is the limit of a computable, increasing, computably converging sequence of rational...

We discuss mathematical and physical arguments against continuity and in favor of discreteness, with particular emphasis on the ideas of Émile Borel.

A notion of completeness and completion suitable for use in the absence of countable choice is developed. This encompasses the construction of the real numbers as well as the completion of an arbitrary metric space. The real numbers are characterized as a complete Archimedean Heyting field, a terminal object in the category of Archimedean Heyting fields.

Area number x is called k-monotonically computable , for constant k > 0, if there is a computable sequence n ∈ ℕ of rational numbers which converges to x such that the convergence is k-monotonic in the sense that k · |x — xn| ≥ |x — xm| for any m > n and x is monotonically computable if it is k-mc for some k > 0. x is weakly computable if there is a computable sequence s ∈ ℕ (...) of rational numbers converging to x such that the sum equation image|xs — xs + 1| is finite. In this paper we show that a mc real numbers are weakly computable but the converse fails. Furthermore, we show also an infinite hierarchy of mc real numbers. (shrink)

Let h : ℕ → ℚ be a computable function. A real number x is called h-monotonically computable if there is a computable sequence of rational numbers which converges to x h-monotonically in the sense that h|x – xn| ≥ |x – xm| for all n andm > n. In this paper we investigate classes h-MC of h-mc real numbers for different computable functions h. Especially, for computable functions h : ℕ → ℚ, we show that (...) the class h-MC coincides with the classes of computable and semi-computable real numbers if and only if Σi∈ℕ) = ∞and the sum Σi∈ℕ) is a computable real number, respectively. On the other hand, if h ≥ 1 and h converges to 1, then h-MC = SC no matter how fast h converges to 1. Furthermore, for any constant c > 1, if h is increasing and converges to c, then h-MC = c-MC. Finally, if h is monotone and unbounded, then h-MC contains all ω-mc real numbers which are g-mc for some computable function g. (shrink)

The usual completeness theorem for first-order logic is extended in order to allow for a natural incorporation of real analysis. Essentially, this is achieved by building in the set of real numbers into the structures for the language, and by adjusting other semantical notions accordingly. We use many-sorted languages so that the resulting formal systems are general enough for axiomatic treatments of empirical theories without recourse to elements of set theory which are difficult to interprete empirically. Thus (...) we provide a way of applying model theory to empirical theories without tricky detours. Our frame is applied to axiomatizations of three empirical theories: classical mechanics, phenomenological thermodynamics, and exchange economics. (shrink)

The spectrum of a first-order sentence is the set of natural numbers occurring as the cardinalities of finite models of the sentence. In a recent survey, Durand et al. introduce a new class of real numbers, the spectral reals, induced by spectra and pose two open problems associated to this class. In the present note, we answer these open problems as well as other open problems from an earlier, unpublished version of the survey. Specifically, we prove that (...) every algebraic real is spectral, every automatic real is spectral, the subword density of a spectral real is either 0 or 1, and both may occur, and every right-computable real number between 0 and 1 occurs as the subword entropy of a spectral real. In addition, Durand et al. note that the set of spectral reals is not closed under addition or multiplication. We extend this result by showing that the class of spectral reals is not closed under any computable operation satisfying some mild conditions. (shrink)

We give a constructive proof of the open induction principle on real numbers, using bar induction and enumerative open sets. We comment the algorithmic content of this result.

Kant held that under the concept of √2 falls a geometrical magnitude, but not a number. In particular, he explicitly distinguished this root from potentially infinite converging sequences of rationals. Like Kant, Brouwer based his foundations of mathematics on the a priori intuition of time, but unlike Kant, Brouwer did identify this root with a potentially infinite sequence. In this paper I discuss the systematical reasons why in Kant's philosophy this identification is impossible.

Do there exist real numbers d with d2 = 0? The question is formulated provocatively, to stress a formalist view about existence: existence is consistency, or better, coherence.Also, the provocation is meant to challenge the monopoly which the number system, invented by Dedekind et al., is claiming for itself as THE model of the geometric line. The Dedekind approach may be termed “arithmetization of geometry”.We know that one may construct a number system out of synthetic geometry, as Euclid (...) and followers did : “geometrization of arithmetic”..Starting from the geometric side, nilpotent elements are somewhat reasonable, although Euclid excluded them. The sophist Protagoras presented a picture of a circle and a tangent line; the apparent little line segment D which tangent and circle have in common, are, by Pythagoras' Theorem, precisely the points, whose abscissae d have d2 = 0. Protagoras wanted to use this argument for destructive reasons: to refute the science of geometry.A couple of millenia later, the Danish geometer Hjelmslev revived the Protagoras picture. His aim was more positive: he wanted to describe Nature as it was. According to him, the Real Line, the Line of Sensual Reality, had many nilpotent infinitesimals, which we can see with our naked eyes. (shrink)

It is usual to identify initial conditions of classical dynamical systems with mathematical real numbers. However, almost all real numbers contain an infinite amount of information. I argue that a finite volume of space can’t contain more than a finite amount of information, hence that the mathematical real numbers are not physically relevant. Moreover, a better terminology for the so-called real numbers is “random numbers”, as their series of bits are truly (...) random. I propose an alternative classical mechanics, which is empirically equivalent to classical mechanics, but uses only finite-information numbers. This alternative classical mechanics is non-deterministic, despite the use of deterministic equations, in a way similar to quantum theory. Interestingly, both alternative classical mechanics and quantum theories can be supplemented by additional variables in such a way that the supplemented theory is deterministic. Most physicists straightforwardly supplement classical theory with real numbers to which they attribute physical existence, while most physicists reject Bohmian mechanics as supplemented quantum theory, arguing that Bohmian positions have no physical reality. (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 countable structures computability is usually introduced via numberings. For uncountable structures whose cardinality does not exceed the cardinality of the continuum the same can be done via representations. Which representations are appropriate for doing real number computations? We show that with respect to computable equivalence there is one and only one equivalence class of representations of the real numbers which make the basic operations and the infinitary normed limit operator computable. This characterizes the real (...) class='Hi'>numbers in terms of the theory of effective algebras or computable structures, and is reflected by observations made in real number computer arithmetic. Demanding computability of the normed limit operator turns out to be essential: the basic operations without the normed limit operator can be made computable by more than one class of representations. We also give further evidence for the well-known non-appropriateness of the representation to some base b by proving that strictly less functions are computable with respect to these representations than with respect to a standard representation of the real numbers. Furthermore we consider basic constructions of representations and the countable substructure consisting of the computable elements of a represented, possibly uncountable structure. For countable structures we compare effectivity with respect to a numbering and effectivity with respect to a representation. Special attention is paid to the countable structure of the computable real numbers. (shrink)

In mathematics, various representations of real numbers have been investigated. All these representations are mathematically equivalent because they lead to the same real structure - Dedekind-complete ordered field. Even the effective versions of these representations are equivalent in the sense that they define the same notion of computable real numbers. Although the computable real numbers can be defined in various equivalent ways, if computable is replaced by primitive recursive (p. r., for short), these (...) definitions lead to a number of different concepts, which we compare in this article. We summarize the known results and add new ones. In particular we show that there is a proper hierarchy among p. r. real numbers by nested interval representation, Cauchy representation, b -adic expansion representation, Dedekind cut representation, and continued fraction expansion representation. Our goal is to clarify systematically how the primitive recursiveness depends on the representations of the real numbers. (shrink)

We explore the potential of Simon Stevin’s numbers, obscured by shifting foundational biases and by 19th century developments in the arithmetisation of analysis.

'Numbers and Proofs' presents a gentle introduction to the notion of proof to give the reader an understanding of how to decipher others' proofs as well as construct their own. Useful methods of proof are illustrated in the context of studying problems concerning mainly numbers (real, rational, complex and integers). An indispensable guide to all students of mathematics. Each proof is preceded by a discussion which is intended to show the reader the kind of thoughts they might (...) have before any attempt proof is made. Established proofs which the student is in a better position to follow then follow. Presented in the author's entertaining and informal style, and written to reflect the changing profile of students entering universities, this book will prove essential reading for all seeking an introduction to the notion of proof as well as giving a definitive guide to the more common forms. Stressing the importance of backing up "truths" found through experimentation, with logically sound and watertight arguments, it provides an ideal bridge to more complex undergraduate maths. (shrink)

In mathematics, various representations of real numbers have been investigated. All these representations are mathematically equivalent because they lead to the same real structure – Dedekind-complete ordered field. Even the effective versions of these representations are equivalent in the sense that they define the same notion of computable real numbers. Although the computable real numbers can be defined in various equivalent ways, if “computable” is replaced by “primitive recursive” , these definitions lead to (...) a number of different concepts, which we compare in this article. We summarize the known results and add new ones. In particular we show that there is a proper hierarchy among p. r. real numbers by nested interval representation, Cauchy representation, b -adic expansion representation, Dedekind cut representation, and continued fraction expansion representation. Our goal is to clarify systematically how the primitive recursiveness depends on the representations of the real numbers. (shrink)

The strong weak truth table (sw) reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occurs naturally in proofs in classical computability theory as well as in the recent work of Soare, Nabutovsky, and Weinberger on applications of computability to differential geometry. We study the sw-degrees of c.e. reals and construct a c.e. real which has no random c.e. real (i.e., Ω number) sw-above it.

Salmon and Soames argue against nominalism about numbers and sentence types. They employ (respectively) higher-order and first-order logic to model certain natural language inferences and claim that the natural language conclusions carry commitment to abstract objects, partially because their renderings in those formal systems seem to do that. I argue that this strategy fails because the nominalist can accept those natural language consequences, provide them with plausible and non-committing truth conditions and account for the inferences made without committing themselves (...) to abstract objects. I sketch a modal account of higher-order quantification, on which instead of ranging over sets, higher order quantifiers are used to make (logical) possibility claims about which predicate tokens can be introduced. This approach provides an alternative account of truth conditions for natural language sentences which seem to employ higher-order quantification, thus allowing the nominalist to evade Salmon’s argument. I also show how the nominalist can account for the occurrence of apparently singular abstract terms in certain true statements. I argue that the nominalist can achieve this by, first, dividing singular terms into real singular terms (referring to concrete objects) and only apparent singular terms (called onomatoids), introduced for the sake of brevity and simplicity, and then providing an account of nominalistically acceptable truth conditions of sentences containing onomatoids. I develop such an account in terms of modally interpreted abstraction principles and argue that applying this strategy to Soames’s argument allows the nominalists to defend themselves. (shrink)

We present a new method for expressing Chaitin’s random real, Ω, through Diophantine equations. Where Chaitin’s method causes a particular quantity to express the bits of Ω by fluctuating between finite and infinite values, in our method this quantity is always finite and the bits of Ω are expressed in its fluctuations between odd and even values, allowing for some interesting developments. We then use exponential Diophantine equations to simplify this result and finally show how both methods can also (...) be used to create polynomials which express the bits of Ω in the number of positive values they assume. (shrink)

Lighten up about mathematics! Have fun. If you read this book, you will have to endure bad math puns and jokes and out-of-date pop culture references. You'll learn some really cool mathematics to boot. In the process, you will immerse yourself in living, thinking, and breathing logical reasoning. We like to call this proofs, which to some is a bogey word, but to us it is a boogie word. You will learn how to solve problems, real and imagined. After (...) all, math is a game where, although the rules are pretty much set, we are left to our imaginations to create. Think of this book as blueprints, but you are the architect of what structures you want to build. Make sure you lay a good foundation, for otherwise your buildings might fall down. To help you through this, we guide you to think and plan carefully. Our playground consists of basic math, with a loving emphasis on number theory. We will encounter the known and the unknown. Ancient and modern inquirers left us with elementary-sounding mathematical puzzles that are unsolved to this day. You will learn induction, logic, set theory, arithmetic, and algebra, and you may one day solve one of these puzzles. (shrink)

Belief in the divine origin of the universe began to wane most markedly in the nineteenth century, when scientific accounts of creation by natural law arose to challenge traditional religious doctrines. Most of the credit - or blame - for the victory of naturalism has generally gone to Charles Darwin and the biologists who formulated theories of organic evolution. Darwinism undoubtedly played the major role, but the supporting parts played by naturalistic cosmogonies should also be acknowledged. Chief among these was (...) the nebular hypothesis proposed by Pierre Simon Laplace in 1796, which explained the origin of the solar system as a natural development over extended periods of time. Ronald Numbers focuses on Laplace's theory as it affected American scientific thought. he first traces the history of Laplace's cosmogony chronologically, from its European inception to its demise about 1900. the last three chapters explore some of the theological and scientific consequences resulting from the acceptance of this cosmogony. Most significant was the change in the status of supernatural doctrine. When the nebular hypothesis lost credence at the end of the nineteenth century, those who had before tried to accommodate natural theory with supernatural doctrine no longer felt compelled to do so when faced with succeeding theories. The nebular hypothesis, it seems, had established natural law in the heavens. (shrink)

Charles Darwin's Origin of Species, published in 1859, was a revolutionary attempt “to overthrow the dogma of separate creations,” a declaration that provoked different reactions among the religious, ranging from mild enthusiasm to anger. Christians sympathetic to Darwin's effort sought to make Darwinism appear compatible with their religious beliefs. Two of Darwin's most prominent defenders in the United States were the Calvinists Asa Gray, a Harvard botanist, and George Frederick Wright, a cleric-geologist. Gray, who long favored a “special origination” in (...) connection with the evolution of humans and questioned whether natural selection can account for the formation of organs, the making of eyes, etc., embraced natural selection as the primary mechanism underlying the production of most species. He also went so far as to invoke divine providence, rather than randomness, to explain the variations on which natural selection acted. This chapter discusses creationism, intelligent design, and modern biology. (shrink)

Given any oracle, A, we construct a basic sequence Q, computable in the jump of A, such that no A-computable real is Q-distribution-normal. A corollary to this is that there is a Δn+10 basic sequence with respect to which no Δn0 real is distribution-normal. As a special case, there is a limit computable sequence relative to which no computable real is distribution-normal.

As past president of both the History of Science Society and the American Society of Church History, Ronald L. Numbers is uniquely qualified to assess the historical relations between science and Christianity. In this collection of his most recent essays, he moves beyond the clichés of conflict and harmony to explore the tangled web of historical interactions involving scientific and religious beliefs. In his lead essay he offers an unprecedented overview of the history of science and Christianity from the (...) perspective of the ordinary people who filled the pews of churchesor loitered around outside. Unlike the elite scientists and theologians on whom most historians have focused, these vulgar Christians cared little about the discoveries of Copernicus, Newton, and Einstein. Instead, they worried about the causes of the diseases and disasters that directly affected their lives and about scientists preposterous attempts to trace human ancestry back to apes. Far from dismissing opinion-makers in the pulpit, Numbers closely looks at two the most influential Protestant theologians in nineteenth-century America: Charles Hodge and William Henry Green. Hodge, after decades of struggling to harmonize Gods two revelationsin nature and in the Biblein the end famously described Darwinism as atheism. Green, on the basis of his careful biblical studies, concluded that Ussher's chronology was unreliable, thus opening the door for Christian anthropologists to accommodate the subsequent discovery of human antiquity. In Science without God Numbers traces the millennia-long history of so-called methodological naturalism, the commitment to explaining the natural world without appeals to the supernatural. By the early nineteenth century this practice was becoming the defining characteristic of science; in the late twentieth century it became the central point of attack in the audacious attempt of intelligent designers to redefine science. Numbers ends his reassessment by arguing that although science has markedly changed the world we live in, it has contributed less to secularizing it than many have claimed. Taken together, these accessible and authoritative essays form a perfect introduction to Christian attitudes towards science since the 17th century. (shrink)

Solutions to word problems are moderated by the semantic alignment of real-world relations with mathematical operations. Categorical relations between entities are aligned with addition, whereas certain functional relations between entities are aligned with division. Similarly, discreteness vs. continuity of quantities is aligned with different formats for rational numbers. These alignments have been found both in textbooks and in the performance of college students in the USA and in South Korea. The current study examined evidence for alignments in Russia. (...) Textbook analyses revealed semantic alignments for arithmetic word problems, but not for rational numbers. Nonetheless, Russian college students showed semantic alignments both for arithmetic operations and for rational numbers. Since Russian students exhibit semantic alignments for rational numbers in the absence of exposure to examples in school, such alignments likely reflect intuitive understanding of mathematical representations of real-world situations. (shrink)

Over the course of human history, the sciences, and biology in particular, have often been manipulated to cause immense human suffering. For example, biology has been used to justify eugenic programs, forced sterilization, human experimentation, and death camps—all in an attempt to support notions of racial superiority. By investigating the past, the contributors to _Biology and Ideology from Descartes to Dawkins_ hope to better prepare us to discern ideological abuse of science when it occurs in the future. Denis R. Alexander (...) and Ronald L. Numbers bring together fourteen experts to examine the varied ways science has been used and abused for nonscientific purposes from the fifteenth century to the present day. Featuring an essay on eugenics from Edward J. Larson and an examination of the progress of evolution by Michael J. Ruse, _Biology and Ideology_ examines uses both benign and sinister, ultimately reminding us that ideological extrapolation continues today. An accessible survey, this collection will enlighten historians of science, their students, practicing scientists, and anyone interested in the relationship between science and culture. (shrink)

This paper develops and explores a new framework for theorizing about the measurement and aggregation of well-being. It is a qualitative variation on the framework of social welfare functionals developed by Amartya Sen. In Sen’s framework, a social or overall betterness ordering is assigned to each profile of real-valued utility functions. In the qualitative framework developed here, numerical utilities are replaced by the properties they are supposed to represent. This makes it possible to characterize the measurability and interpersonal comparability (...) of well-being directly, without the use of invariance conditions, and to distinguish between real changes in well-being and merely representational changes in the unit of measurement. The qualitative framework is shown to have important implications for a range of issues in axiology and social choice theory, including the characterization of welfarism, axiomatic derivations of utilitarianism, the meaningfulness of prioritarianism, the informational requirements of variable-population ethics, the impossibility theorems of Arrow and others, and the metaphysics of value. (shrink)

We consider some natural sets of real numbers arising in ergodic theory and show that they are, respectively, complete in the classes${\cal D}_2 \left( {{\bf{\Pi }}_3^0 } \right)$and${\cal D}_\omega \left( {{\bf{\Pi }}_3^0 } \right)$, that is, the class of sets which are 2-differences (respectively,ω-differences) of${\bf{\Pi }}_3^0 $sets.

We suggest that there can be epistemologically significant reasons why certain mathematical structures - such as the Real numbers - are more important than others. We explore several contexts in which considerations bearing on the choice of a fundamental numerical domain might arise. 1) Set theory. 2) Historical cases of extension of mathematical domains - why were negative numbers resisted, and why should we accept them as part of our fundamental numerical domain? 3) Using fewer reals in (...) physics, without really noticing. (shrink)

This chapter presents a historical analysis of pseudoscience, tracking down the coinage and currency of the term and explaining its shifting meaning in tandem with the emerging historical identity of science. The discussions cover the invention of pseudoscience; science and pseudoscience in the late nineteenth century; pseudoscience in the new century; and pseudoscience and its critics in the late twentieth century.