PCF arithmetic without and with choice

Saharon Shelah*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

We deal with relatives of GCH which are provable. In particular, we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed, but some of the results give us additional information even in ZFC. We also start to deal with pcf for pseudo-cofinality (in ZFC with little choice).

Original languageEnglish
Pages (from-to)1-40
Number of pages40
JournalIsrael Journal of Mathematics
Volume191
Issue number1
DOIs
StatePublished - Sep 2012

Fingerprint

Dive into the research topics of 'PCF arithmetic without and with choice'. Together they form a unique fingerprint.

Cite this