Abstract
We consider mainly the following version of set theory: “ZF+DC and for every \({\lambda, \lambda^{\aleph_0}}\) is well ordered”, our thesis is that this is a reasonable set theory, e.g. on the one hand it is much weaker than full choice, and on the other hand much can be said or at least this is what the present work tries to indicate. In particular, we prove that for a sequence \({\overline{\delta} = \langle\delta_{s}: s \in Y\rangle, {\rm cf}(\delta_{s})}\) large enough compared to Y, we can prove the pcf theorem with minor changes (in particular, using true cofinalities not the pseudo ones).We then deduce the existence of covering numbers and define and prove existence of a class of true successor cardinals. Using this we give some diagonalization arguments (more specifically some black boxes and consequences) on Abelian groups, chosen as a characteristic case.We end by showing that some such consequences hold even in ZF above.
Similar content being viewed by others
References
Eklof, P.C., Mekler, A.: Almost Free Modules: Set Theoretic Methods, North–Holland Mathematical Library, vol. 65, Revised edn. North–Holland Publishing Co., Amsterdam (2002)
Dzamonja, M., Shelah, S.: On squares, outside guessing of clubs and \({I_{<f}[\lambda]}\). Fundam. Math. 148, 165–198 (1995). arXiv:math.LO/9510216
Gitik M., Köepke P.: Violating the singular cardinals hypothesis without large cardinals Isr. J. Math. 191, 901–922 (2012)
Göbel, R., Trlifaj, J.: Approximations and Endomorphism Algebras of Modules, vols. I, II. de Gruyter Expositions in Mathematics. Walter de Gruyter, Berlin/Boston (2012)
Göbel R., Shelah S.: \({\aleph_n}\)-free modules with trivial dual. Results Math. 54, 53–64 (2009)
Göbel R., Herden D., Shelah S.: Prescribing endomorphism rings of \({\aleph_n}\)-free modules. J. Eur. Math. Soc. 16, 1775–1816 (2014)
Göbel R., Shelah S., Struengmann L.: \({\aleph_n}\)-free modules over complete discrete valuation domains with small dual. Glasg. Math. J. 55, 369–380 (2013)
Larson P., Shelah S.: Splitting stationary sets from weak forms of choice. Math. Log. Q. 55, 299–306 (2009)
Rubin M., Shelah S.: Combinatorial problems on trees: partitions, Δ-systems and large free subtrees. Ann. Pure Appl. Log. 33, 43–81 (1987)
Shelah, S.: Proper Forcing, Lecture Notes in Mathematics, vol. 940, Springer, Berlin, xxix+496 pp (1982)
Shelah, S.: Cardinal Arithmetic, Oxford Logic Guides, vol. 29. Oxford University Press, Oxford (1994)
Shelah, S.: Combinatorial Background for Non-structure arXiv:1512.04767 [math.LO]
Shelah, S.: PCF: The Advanced PCF Theorems. arXiv:1512.07063
Shelah, S.: A combinatorial principle and endomorphism rings. I. On p-groups. Isr. J. Math. 49, 239–257 (1984). Proceedings of the 1980/1 Jerusalem Model Theory year
Shelah, S.: Black Boxes. arXiv:0812.0656
Shelah S.: Products of regular cardinals and cardinal invariants of products of Boolean algebras. Isr. J. Math. 70, 129–187 (1990)
Shelah S.: Reflecting stationary sets and successors of singular cardinals. Arch. Math. Log. 31, 25–53 (1991)
Shelah, Saharon: Further cardinal arithmetic. Isr. J. Math. 95, 61–114 (1996). arXiv:math.LO/9610226
Shelah, S.: The generalized continuum hypothesis revisited. Isr. J. Math. 116, 285–321 (2000). arXiv:math.LO/9809200
Shelah, S.: Set theory without choice: not everything on cofinality is possible. Arch. Math. Log. 36, 81–125 (1997). A special volume dedicated to Prof. Azriel Levy. arXiv:math.LO/9512227
Shelah, S.: The pcf-theorem revisited. In: Graham, N. (eds) The Mathematics of Paul Erdős, II, Algorithms and Combinatorics, vol. 14, pp. 420–459. Springer (1997). arXiv:math.LO/9502233
Shelah, S.: More on the Revised GCH and the Black Box. Ann. Pure Appl. Log. 140, 133–160 (2006). arXiv:math.LO/0406482
Shelah, S.: PCF without choice. Arch. Math. Log. submitted. arXiv:math.LO/0510229
Shelah, S.: \({\aleph_n}\)-free abelain group with no non-zero homomorphism to \({\mathbb{Z}}\). CUBO Math. J. 9, 59–79 (2007). arXiv:math.LO/0609634
Shelah, S.: Models of expansions of \({\mathbb{N}}\) with no end extensions. Math. Log. Q. 57, 341–365 (2011). arXiv:0808.2960
Shelah, S.: PCF arithmetic without and with choice. Isr. J. Math. 191, 1–40 (2012). arXiv:0905.3021
Shelah S.: Pseudo pcf. Isr. J. Math. 201, 185–231 (2014)
Shelah, S.: Quite free complicated abelian groups, PCF and Black Boxes, Isr. J. Math. submitted
Shelah, S.: Set theory with weak choice: Ax 4 and Abelian groups (in preparation)
Shelah, S. and Kojman, The PCF trichotomy theorem does not hold for short sequences, Arch. Math. Log. 39, 213–218 (2000)
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to the memory of Richard Laver.
References to outside papers like [23, 2.13 = Ls.2] means to 2.13 where s.2 is the label used there, so intended only to help the author if more is added to [23].
The author thanks Alice Leonhardt for the beautiful typing. The author would like to thank the Israel Science Foundation for partial support of this research (Grant No. 1053/11). Publication 1005.
Rights and permissions
About this article
Cite this article
Shelah, S. ZF + DC + AX4 . Arch. Math. Logic 55, 239–294 (2016). https://doi.org/10.1007/s00153-015-0469-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-015-0469-0