The accessibility rank of weak equivalences

From MaRDI portal
Publication:5261930

zbMATH Open1320.55019arXiv1403.3042MaRDI QIDQ5261930FDOQ5261930

George Raptis, Jiří Rosický

Publication date: 8 July 2015

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.


Full work available at URL: https://arxiv.org/abs/1403.3042

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations





Cited In (8)





This page was built for publication: The accessibility rank of weak equivalences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261930)