PCF arithmetic without and with choice

DOI10.1007/S11856-012-0026-ZMaRDI QIDQ1760369zbMATH OpenOpenAlexFDO

Authors S. Shelah

Publication date 13 November 2012

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0905.3021

Mathematics Subject Classification ID

Ordered sets and their cofinalities; pcf theory (03E04) Axiom of choice and related propositions (03E25) Continuum hypothesis and Martin's axiom (03E50)

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 gives us additional information even in ZFC.

Recommendations

• Pseudo pcf
• The PCF conjecture and large cardinals
• scientific article; zbMATH DE number 970820
• Weak Forms of the Axiom of Choice and the Generalized Continuum Hypothesis
• Cardinal arithmetic for skeptics

Cites work

• A note on cardinal exponentiation
• More on the revised GCH and the black box
• On long increasing chains modulo flat ideals
• PCF and infinite free subsets in an algebra
• Set theory without choice: Not everything on cofinality is possible
• Splitting stationary sets from weak forms of Choice
• The generalized continuum hypothesis revisited

Cited in

(5)

• The PCF conjecture and large cardinals
• Pseudo pcf
• Generic at
• \(\mathrm{ZF}+\mathrm{DC}+\mathrm{AX}_4\)
• Pcf without choice Sh835

This page was built for publication: PCF arithmetic without and with choice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1760369)