Off-campus access
Using PhilPapers from home?
Click here to configure this browser for off-campus access.
- Eric Steinhart (2002). Why Numbers Are Sets. Synthese 133 (3):343 - 361.I follow standard mathematical practice and theory to argue that the natural numbers are the finite von Neumann ordinals. I present the reasons standardly given for identifying the natural numbers with the finite von Neumann's (e.g., recursiveness; well-ordering principles; continuity at transfinite limits; minimality; and identification of n with the set of all numbers less than n). I give a detailed mathematical demonstration that 0 is { } and for every natural number n, n is the set of all natural numbers less than n. Natural numbers are sets. They are the finite von Neumann ordinals.
Similar books and articles
The notion of a natural numbers object in a monoidal category is defined and it is shown that the theory of primitive recursive functions can be developed. This is done by considering the category of cocommutative comonoids which is cartesian, and where the theory of natural numbers objects is well developed. A number of examples illustrate the usefulness of the concept.
We examine the arguments on both sides of the recent debate (Hale and Wright v. Field) on the existence, and modal status, of the natural numbers. We formulate precisely, with proper attention to denotational commitments, the analytic conditionals that link talk of numbers with talk of numerosity and with counting. These provide conceptual controls on the concept of number. We argue, against Field, that there is a serious disanalogy between the existence of God and the existence of numbers. We give stronger reasons than those advanced by Wright for resisting Field's analogy. We argue that the rules governing the basic numerical notions commit us to the natural numbers as necessary existents. We also show that the latest twist in the debate involving 'surdons' leaves both sides in a stalemate.
Traditional computers work with finite numbers. Situations where the usage
of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not related to the non-standard analysis) is used to work with finite, infinite, and infinitesimal numbers numerically. This can be done on a new kind of a computer – the Infinity Computer – able to work with all these types of numbers. The new computational tools both give possibilities to execute computations of a new type and open new horizons for creating new mathematical models where a computational usage of infinite and/or infinitesimal numbers can be useful. A number of numerical examples showing the potential of the new approach and dealing with divergent series, limits, probability theory, linear algebra, and calculation of volumes of objects consisting of parts of different dimensions are given.
We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set A of natural numbers is n-cohesive (respectively, n-r-cohesive) if A is almost homogeneous for every computably enumerable (respectively, computable) 2-coloring of the n-element sets of natural numbers. (Thus the 1-cohesive and 1-r-cohesive sets coincide with the cohesive and r-cohesive sets, respectively.) We consider the degrees of unsolvability and arithmetical definability levels of n-cohesive and n-r-cohesive sets. For example, we show that for all n ≥ 2, there exists a Δ 0 n+1 n-cohesive set. We improve this result for n = 2 by showing that there is a Π 0 2 2-cohesive set. We show that the n-cohesive and n-r-cohesive degrees together form a linear, non-collapsing hierarchy of degrees for n ≥ 2. In addition, for n ≥ 2 we characterize the jumps of n-cohesive degrees as exactly the degrees ≥ 0 (n+1) and also characterize the jumps of the n-r-cohesive degrees.
In his monograph On Numbers and Games , J. H. Conway introduced a real-closed field containing the reals and the ordinals as well as a great many less familiar numbers including -ω, ω/2, 1/ω, \sqrt{ω} and ω-π to name only a few. Indeed, this particular real-closed field, which Conway calls No , is so remarkably inclusive that, subject to the proviso that numbers—construed here as members of ordered fields—be individually definable in terms of sets of NBG (von Neumann—Bernays—Gödel set theory with global choice), it may be said to contain “All Numbers Great and Small.” In this respect, No bears much the same relation to ordered fields that the system ℝ of real numbers bears to Archimedean ordered fields. In Part I of the present paper, we suggest that whereas ℝ should merely be regarded as constituting an arithmetic continuum (modulo the Archimedean axiom), No may be regarded as a sort of absolute arithmetic continuum (modulo NBG), and in Part II we draw attention to the unifying framework No provides not only for the reals and the ordinals but also for an array of non-Archimedean ordered number systems that have arisen in connection with the theories of non-Archimedean ordered algebraic and geometric systems, the theory of the rate of growth of real functions and nonstandard analysis. In addition to its inclusive structure as an ordered field, the system No of surreal numbers has a rich algebraico-tree-theoretic structure—a simplicity hierarchical structure—that emerges from the recursive clauses in terms of which it is defined. In the development of No outlined in the present paper, in which the surreals emerge vis-à-vis a generalization of the von Neumann ordinal construction, the simplicity hierarchical features of No are brought to the fore and play central roles in the aforementioned unification of systems of numbers great and small and in some of the more revealing characterizations of No as an absolute continuum.
A new computational methodology for executing calculations with infinite
and infinitesimal quantities is described in this paper. It is based on the
principle ‘The part is less than the whole’ introduced by Ancient Greeks and applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). It is shown that it becomes possible to write down finite, infinite, and infinitesimal numbers by a finite number of symbols as particular cases of a unique framework. The new methodology has allowed us to introduce the Infinity Computer working with such numbers (its simulator has already been realized). Examples dealing with divergent series, infinite sets, and limits are given.
We analyze combinatorial properties of open covers of sets of real numbers by using filters on the natural numbers. In fact, the goal of this paper is to characterize known properties related to ω-covers of the space in terms of combinatorial properties of filters associated with these ω-covers. As an example, we show that all finite powers of a set R of real numbers have the covering property of Menger if, and only if, each filter on ω associated with its countable ω-cover is a P + filter.
In this paper, I suggest that infinite numbers are large finite numbers, and that infinite numbers, properly understood, are 1) of the structure omega + (omega* + omega)Ө + omega*, and 2) the part is smaller than the whole. I present an explanation of these claims in terms of epistemic limitations. I then consider the importance, part of which is demonstrating the contradiction that lies at the heart of Cantorian set theory: the natural numbers are too large to be counted by any finite number, but too small to be counted by any infinite number – there is no number of natural numbers.
Abstract A number is the number of a class which is an objective, nonactual, mathematical object. The concept of class is analyzed and it is concluded that a number is the number of a pure founded class. A tempting strategy of explaining numbers away is rejected. Some well?known definitions of numbers are analyzed and it is concluded that this analysis purports the thesis that the unique notion of number does not exist. Numbers are conventional. Nevertheless, an argument is offered purporting the thesis that von Neumann's ordinal numbers are the ordinal numbers. Accordingly, the corresponding von Neumann's cardinal numbers are the numbers.
A number is the number of a class which is an objective, nonactual, mathematical object. The concept of class is analyzed and it is concluded that a number is the number of a pure founded class. A tempting strategy of explaining numbers away is rejected. Some well-known definitions of numbers are analyzed and it is concluded that this analysis purports the thesis that the unique notion of number does not exist. Numbers are conventional. Nevertheless, an argument is offered purporting the thesis that von Neumann's ordinal numbers are the ordinal numbers. Accordingly, the corresponding von Neumann's cardinal numbers are the numbers.
Discussion of Eric Steinhart, Why numbers are sets
|
|
There are no threads in this forum |
Nothing in this forum yet.

