* About accessibility of the weak equivalences of a combinatorial model category
@ 2006-01-19 17:34 Gaucher Philippe
0 siblings, 0 replies; only message in thread
From: Gaucher Philippe @ 2006-01-19 17:34 UTC (permalink / raw)
To: categories
Dear All,
How can we prove that the class of weak equivalences of a combinatorial model
category is accessible ? I know how to prove that the class of weak
equivalences of a combinatorial model category is accessibly embedded in the
whole class of morphisms. And then it is accessible using Vopenka's principle
by [Adamek-Rosicky's book Theorem 6.17] . Can we remove Vopenka's principle
from the argument ? Or is this fact in the definition of a "combinatorial
model category" (for me, it's a cofibrantly generated model category such
that the underlying category is locally presentable) ?
Thanks in advance. pg.
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2006-01-19 17:34 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2006-01-19 17:34 About accessibility of the weak equivalences of a combinatorial model category Gaucher Philippe
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).