Singular cardinals and the pcf theory

Bulletin of Symbolic Logic 1 (4):408-424 (1995)
  Copy   BIBTEX

Abstract

§1. Introduction. Among the most remarkable discoveries in set theory in the last quarter century is the rich structure of the arithmetic of singular cardinals, and its deep relationship to large cardinals. The problem of finding a complete set of rules describing the behavior of the continuum function 2ℵα for singular ℵα's, known as the Singular Cardinals Problem, has been attacked by many different techniques, involving forcing, large cardinals, inner models, and various combinatorial methods. The work on the singular cardinals problem has led to many often surprising results, culminating in a beautiful theory of Saharon Shelah called the pcf theory. The most striking result to date states that if 2ℵn < ℵω for every n = 0, 1, 2, …, then 2ℵω < ℵω4.In this paper we present a brief history of the singular cardinals problem, the present knowledge, and an introduction into Shelah's pcf theory. In Sections 2, 3 and 4 we introduce the reader to cardinal arithmetic and to the singular cardinals problems. Sections 5, 6, 7 and 8 describe the main results and methods of the last 25 years and explain the role of large cardinals in the singular cardinals problem. In Section 9 we present an outline of the pcf theory.§2. The arithmetic of cardinal numbers. Cardinal numbers were introduced by Cantor in the late 19th century and problems arising from investigations of rules of arithmetic of cardinal numbers led to the birth of set theory. The operations of addition, multiplication and exponentiation of infinite cardinal numbers are a natural generalization of such operations on integers. Addition and multiplication of infinite cardinals turns out to be simple: when at least one of the numbers κ, λ is infinite then both κ + λ and κ·λ are equal to max {κ, λ}. In contrast with + and ·, exponentiation presents fundamental problems. In the simplest nontrivial case, 2κ represents the cardinal number of the power set P, the set of all subsets of κ. (Here we adopt the usual convention of set theory that the number κ is identified with a set of cardinality κ, namely the set of all ordinal numbers smaller than κ.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Gap forcing: Generalizing the lévy-Solovay theorem.Joel David Hamkins - 1999 - Bulletin of Symbolic Logic 5 (2):264-272.
The PCF Conjecture and Large Cardinals.Luís Pereira - 2008 - Journal of Symbolic Logic 73 (2):674 - 688.
Successive weakly compact or singular cardinals.Ralf-Dieter Schindler - 1999 - Journal of Symbolic Logic 64 (1):139-146.
Ad and patterns of singular cardinals below θ.Arthur W. Apter - 1996 - Journal of Symbolic Logic 61 (1):225-235.
Applications of PCF theory.Saharon Shelah - 2000 - Journal of Symbolic Logic 65 (4):1624-1674.
Nonexistence of universal orders in many cardinals.Menachem Kojman & Saharon Shelah - 1992 - Journal of Symbolic Logic 57 (3):875-891.

Analytics

Added to PP
2009-01-28

Downloads
132 (#142,024)

6 months
23 (#124,787)

Historical graph of downloads
How can I increase my downloads?

References found in this work

The core model.A. Dodd & R. Jensen - 1981 - Annals of Mathematical Logic 20 (1):43-75.
The negation of the singular cardinal hypothesis from o(K)=K++.Moti Gitik - 1989 - Annals of Pure and Applied Logic 43 (3):209-234.
Shelah's pcf theory and its applications.Maxim R. Burke & Menachem Magidor - 1990 - Annals of Pure and Applied Logic 50 (3):207-254.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.

View all 22 references / Add more references