On combinatorial model categories (Q839591)

A combinatorial model category is a locally presentable category which is cofibrantly generated; for example, the category of simplicial sets is a combinatorial model category. Let \({\mathcal W}\) and \({\mathcal X}\) be classes of morphisms in a locally presentable category \({\mathcal K}\). The author shows that \({\mathcal K}\) is a combinatorial model category with cofibrations generated by \({\mathcal X}\) and with weak equivalences \({\mathcal W}\) if and only if \({\mathcal W}\) satisfies certain closure conditions and a solution set condition. He also shows that the solution set condition is redundant if and only if a strong axiom of infinity called Vopěnka's principle is satisfied.