PCF without choice
Logic
2019-01-29 v3
Abstract
We mainly investigate model 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). In this frame much of pcf theory can be generalized. E.g., there is a class of regular cardinals, and we can prove cardinal inequality.
Cite
@article{arxiv.math/0510229,
title = {PCF without choice},
author = {Saharon Shelah},
journal= {arXiv preprint arXiv:math/0510229},
year = {2019}
}