The accessibility rank of weak equivalences
arXiv:1403.3042
Abstract
We study the accessibility properties of trivial cofibrations and weak equivalences in a combinatorial model category and prove an estimate for the accessibility rank of weak equivalences. In particular, we show that the class of weak equivalences between simplicial sets is finitely accessible.
The main result is improved and its proof is simplified. To appear in Theory and Applications of Categories. 15 pages