Cantor s two views of ordinal numbers

Similar documents
Cantor s Letter to Dedekind

Philosophy of Religion. Notes on Infinity

Separating Hierarchy and Replacement

DO FIVE OUT OF SIX ON EACH SET PROBLEM SET

The Axiom of Infinity, Quantum Field Theory, and Large Cardinals. Paul Corazza Maharishi University

Zermelo-Fraenkel Set Theory

Leibniz and Cantor on the Actual Infinite

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals

CITS2211 Discrete Structures (2017) Cardinality and Countability

Well-Ordered Sets, Ordinals and Cardinals Ali Nesin 1 July 2001

2. Ordered sets. A theorem of Hausdorff.

Equivalent Forms of the Axiom of Infinity

Understanding Computation

form, but that fails as soon as one has an object greater than every natural number. Induction in the < form frequently goes under the fancy name \tra

Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009

Axioms for Set Theory

Cardinality of Sets. P. Danziger

The nature of Reality: Einstein-Podolsky-Rosen Argument in QM

MAGIC Set theory. lecture 1

Thomas Jech. The Pennsylvania State University. Until the 19th century the study of the innite was an exclusive domain of

20 Ordinals. Definition A set α is an ordinal iff: (i) α is transitive; and. (ii) α is linearly ordered by. Example 20.2.

Russell s logicism. Jeff Speaks. September 26, 2007

Zeno s Paradox #1. The Achilles

This section will take the very naive point of view that a set is a collection of objects, the collection being regarded as a single object.

Short notes on Axioms of set theory, Well orderings and Ordinal Numbers

NOTES ON WELL ORDERING AND ORDINAL NUMBERS. 1. Logic and Notation Any formula in Mathematics can be stated using the symbols

Section 7.5: Cardinality

The Different Sizes of Infinity

Set Theory and the Foundation of Mathematics. June 19, 2018

MAGIC Set theory. lecture 6

Footnotes to Linear Algebra (MA 540 fall 2013), T. Goodwillie, Bases

KRIPKE S THEORY OF TRUTH 1. INTRODUCTION

Uncountable computable model theory

Math From Scratch Lesson 28: Rational Exponents

In N we can do addition, but in order to do subtraction we need to extend N to the integers

CONSTRUCTION OF THE REAL NUMBERS.

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos

Realizable Extensions of Intuitionistic Analysis: Brouwer, Kleene, Kripke and the End of Time

A NEW SET THEORY FOR ANALYSIS

Basic set-theoretic techniques in logic Part III, Transfinite recursion and induction

A Little History Incompleteness The First Theorem The Second Theorem Implications. Gödel s Theorem. Anders O.F. Hendrickson

Meta-logic derivation rules

Chapter One. The Real Number System

Part II. Logic and Set Theory. Year

6 Cosets & Factor Groups

Abstract and Variable Sets in Category Theory 1

Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)

Completeness Theorems and λ-calculus

DECISIONS UNDER UNCERTAINTY

Almost von Neumann, Definitely Gödel: The Second Incompleteness Theorem s Early Story

DENSELY k-separable COMPACTA ARE DENSELY SEPARABLE

Yablo s Paradox and the Omitting Types Theorem for Propositional Languages

Difficulties of the set of natural numbers


REU 2007 Transfinite Combinatorics Lecture 9

The constructible universe

CHAPTER 4: EXPLORING Z

STA2112F99 ε δ Review

Metainduction in Operational Set Theory

Cardinality and ordinal numbers

Notes on ordinals and cardinals

2. Prime and Maximal Ideals

Algorithms: Lecture 2

FORCING WITH SEQUENCES OF MODELS OF TWO TYPES

INDEPENDENCE OF THE CONTINUUM HYPOTHESIS

INCOMPLETENESS I by Harvey M. Friedman Distinguished University Professor Mathematics, Philosophy, Computer Science Ohio State University Invitation

Victoria Gitman and Thomas Johnstone. New York City College of Technology, CUNY

Non-conglomerability for countably additive measures that are not -additive* Mark Schervish, Teddy Seidenfeld, and Joseph Kadane CMU

To Infinity and Beyond

COMPLETE NORMALITY AND COUNTABLE COMPACTNESS

2. Two binary operations (addition, denoted + and multiplication, denoted

MATH 3300 Test 1. Name: Student Id:

The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)

Gödel s Programm and Ultimate L

Open access to the SEP is made possible by a world-wide funding initiative. Please Read How You Can Help Keep the Encyclopedia Free

Successive cardinals with the tree property

A Super Introduction to Reverse Mathematics

Philosophies of Mathematics. The Search for Foundations

HOW DO ULTRAFILTERS ACT ON THEORIES? THE CUT SPECTRUM AND TREETOPS

We are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero

1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9

NOTES ON BEING AND EVENT (PART 3)

Chapter 1: The Logic of Compound Statements. January 7, 2008

Chapter 1 The Real Numbers

CHAPTER VII. Ladder and complex algebra 7.1. Introduction The inconsistency of the UCH property for N N.

Let us first solve the midterm problem 4 before we bring up the related issues.

A Note on Singular Cardinals in Set Theory without Choice

Recursive Ordinals and Ordinal Notations

Introduction. Chapter 1. Contents. EECS 600 Function Space Methods in System Theory Lecture Notes J. Fessler 1.1

Confusion in Thermodynamics. J. Dunning Davies and D. Sands, Physics Department, Hull University, Hull HU6 7RX, England.

Numbers, Ordinals and Cardinals

Ordinals. Mustafa Elsheikh elsheimm at mcmaster dot ca. Wed 18 Nov 2008

Hilbert and the concept of axiom

How Philosophy Impacts on Mathematics

There are seven questions, of varying point-value. Each question is worth the indicated number of points.

Some. AWESOME Great Theoretical Ideas in Computer Science about Generating Functions Probability

Throwing Darts, Time, and the Infinite

6. The transfinite ordinals*

The Axiom of Choice and Some Equivalences:

Tallness and Level by Level Equivalence and Inequivalence

Transcription:

University of Barcelona July 2008

The precursor s of Cantor s ordinal numbers are the symbols of infinity. They arose as indexes in infinite iterations of the derivative operation P P, where P R is bounded and P is the set of its accumulation points.

In 1872 Cantor considered finite iterations of the derivative operation: P (1) P (2) P (3) P (n), where P (1) = P, and P (k+1) = (P (k) )

In 1880, Cantor extended the iteration beyond the finite. He started with P ( ) = P (n) n By example, he showed how to get iterates of the general form: P (n 0 m +n 1 m 1 + +n m) He concluded that with the suggested procedure one successively reaches the further concepts : P ( ), P ( ), P ( ),......

Cantor did not iterate along the symbols of infinity. They had no independent status: They were mere indices of the iteration. They indicated how each iterate was built from previous ones. Cantor gave no definition of them, and he was elusive as to how far the iteration can proceed (he only said that the process goes always farther). In particular: Can one iterate past the indices,,,...,...?

1882 Theorem. If some P (α) is empty, then P, and hence P is countable. Cantor s account of the iteration was enough for the proof of the theorem. But it was not precise enough to establish the following conjecture: Conjecture. If P is countable, then P (α) is empty, for some α. Work on the conjecture led him to the discovery of the transfinite ordinal numbers.

First Cantor reached the countable ordinals, which he viewed as the old symbols of infinity. He saw that they form an uncountable set. This was crucial for the proof of the conjecture. The countable ordinals were the first natural extension of the finite number sequence. Cantor then conceived of the ultimate extension: one provably admitting no further extensions.

Cantor s generating principles. Grundlagen (1883) 1. If α is a generated number, so is its immediate successor α + 1. 2. Whenever a definite succession of generated numbers is given, having no largest term, a new number is created which we conceive as the limit of those numbers, i.e., it is defined as the number immediately greater than all of them. ( A definite succession of numbers is a set of numbers.)

Numbers are generated from 0 by means of the generating principles. It is immediate that there is no definite succession (no set) containing all numbers. This, however, does not imply that the extended number sequence is large. That will depend on what sets of numbers there are (can be given). Cantor intended it to be inconceivably large: The extended number sequence is a symbol of the absolute.

A crucial feature of the absolute according to Cantor is that it cannot be known, not even approximately. In a positive formulation: If a succession of numbers can be characterized or defined, then it is a definite succession, i.e. a set. This leads to conditions on sethood, from which every number less than the first weakly inaccessible is secured.

Conditions on sethood 1. The totality of finite numbers is a set. 2. The totality of numbers equivalent to a given number is a set. 3. If α is a number, any succession {α ξ : ξ < α} of numbers indexed by α is a set.

In Grundlagen numbers were not defined as ordinals, but they were applied to play the role of ordinals: The Anzahl of a well-ordered set is its order-type: A and B have same Anzahl iff A = B. Every well-ordered set A has the same Anzahl as the set of predecessors of some number α. Cantor set the Anzahl of A equal to the number α.

Soon after Grundlagen Cantor abandoned the generating account of numbers on the grounds that it lacked mathematical rigor.

I limited myself to treat the matter in a purely mathematical way [1883]. I have already fulfilled to a certain extent your desire for a treatment of the matter of my Grundlagen which is purely mathematical and free from metaphysical aspects [1884]. For the rigorous foundation of this matter, discovered in 1882 and exposed in Grundlagen, we make use of the so-called ordinal types [1895].

He redefined the numbers in terms of order-types. First, as signs (Zeichen) for order-types of well-ordered sets. The whole numbers are nothing but signs for the various types of well-ordered sets. Then as general concepts obtained by abstracting from the nature of the elements of a well-ordered set, while retaining the order.

Two damaging effects of Cantor s turn: 1. He was unable to argue for the absolute infinity of transfinite numbers, because he had no strong principles of set existence. 2. When, later, he was in possession of stronger principles of set existence, he was unable to explain the paradoxes away in a convincing way.

After Beiträge (1897), Cantor distinguished between: 1. Completed or Consistent multiplicities, 2. Uncompleted or Inconsistent multiplicities. Completed multiplicities are sets. A multiplicity is a set if and only if their elements exist together, if and only if they all coexist.

In Beiträge I defined a set as a collection. But collecting together is only possible when existing together is possible [1897]. All elements of a multiplicity can be collected when their being together, their coexistence, can be thought without contradiction [1898]. A multiplicity is a completed set if all its elements can be thought without contradiction as being together, and hence as a thing in itself [1898].

The grounds of the distinction failed to convince even such advocates of set theory as Dedekind or Hilbert.

DEDEKIND (1899): Although I have read several times your entire letter, I am still unclear about your division of totalities [Inbegriffe] into consistent and inconsistent. I do not know what you mean when you speak of the being together of the elements of a multiplicity and of its opposite.

HILBERT (1904): G. Cantor sensed the contradictions just mentioned and expressed his awareness by differentiating between consistent and inconsistent sets. But, since in my opinion he does not provide a precise criterion for this distinction, I must characterize his conception on this point as one that still leaves latitude for subjective judgment and therefore affords no objective certainty.

Cantor s distinction is hard to make sense of under the assumption that all sets and numbers lie in an all encompassing universe. How can they fail to coexist if they inhabit the same such universe? (How, indeed, if, in Cantor s own words, they exist from all eternity as ideas in the divine intellect?)

But the distinction is completely natural in a generating setting, at least as it applies to the transfinite numbers. The reason why the multiplicity of all numbers is not a set is simply that the generating principles have no closure. This is what it means that the numbers do not all coexist.

As Cantor said, number generation is not purely mathematical. It cannot be appealed to in a mathematical proof. However, it may have a place in the justification of the set-theoretical axioms.