Switch to: References

Add citations

You must login to add citations.
  1. Zf + dc + ax4.Saharon Shelah - 2016 - Archive for Mathematical Logic 55 (1-2):239-294.
    We consider mainly the following version of set theory: “ZF+DC and for every λ,λℵ0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\lambda, \lambda^{\aleph_0}}$$\end{document} 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 δ¯=⟨δs:s∈Y⟩,cf\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Pcf without choice Sh835.Saharon Shelah - 2024 - Archive for Mathematical Logic 63 (5):623-654.
    We mainly investigate models of set theory with restricted choice, e.g., ZF + DC + the family of countable subsets of $$\lambda $$ is well ordered for every $$\lambda $$ (really local version for a given $$\lambda $$ ). We think that in this frame much of pcf theory, (and combinatorial set theory in general) can be generalized. We prove here, in particular, that there is a proper class of regular cardinals, every large enough successor of singular is not measurable (...)
    Download  
     
    Export citation  
     
    Bookmark