Open Access
2005 Some Problems in Singular Cardinals Combinatorics
Matthew Foreman
Notre Dame J. Formal Logic 46(3): 309-322 (2005). DOI: 10.1305/ndjfl/1125409329

Abstract

This paper attempts to present and organize several problems in the theory of Singular Cardinals. The most famous problems in the area (bounds for the ℶ-function at singular cardinals) are well known to all mathematicians with even a rudimentary interest in set theory. However, it is less well known that the combinatorics of singular cardinals is a thriving area with results and problems that do not depend on a solution of the Singular Cardinals Hypothesis. We present here an annotated collection of representative problems with some references. Where the problems are novel, attribution is attempted and it is noted where money is attached to particular problems.

Three closely related themes are represented in these problems: stationary sets and stationary set reflection, variations of square and approachability, and the singular cardinals hypothesis. Underlying many of them are ideas from Shelah's PCF theory. Important subthemes were mutual stationarity, Aronszajn trees, and superatomic Boolean Algebras.

The author notes considerable overlap between this paper and the unpublished report submitted to the Banff Center for the Workshop on Singular Cardinals Combinatorics, May 1–5, 2004.

Citation

Download Citation

Matthew Foreman. "Some Problems in Singular Cardinals Combinatorics." Notre Dame J. Formal Logic 46 (3) 309 - 322, 2005. https://doi.org/10.1305/ndjfl/1125409329

Information

Published: 2005
First available in Project Euclid: 30 August 2005

zbMATH: 1092.03022
MathSciNet: MR2160660
Digital Object Identifier: 10.1305/ndjfl/1125409329

Subjects:
Primary: 03E35 , 03E55
Secondary: 03E05

Keywords: Aronszajn trees , I[\lambda] , mutual stationarity , PCF theory , singular cardinals , singular cardinals hypothesis , superatomic Boolean algebras

Rights: Copyright © 2005 University of Notre Dame

Vol.46 • No. 3 • 2005
Back to Top