Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
added this pointer:
Changed “for all −2≤n≤∞” in proposition 3.3 (the existence of the (n-connected, n-truncated) factorization system) to “−2≤n<∞” to match the formulation of HTT’s example 5.2.8.16 (Lurie 2009: 390).
(Is it even true for n=∞ with the definition of n-truncatedness given here, or do you need some hypercompleteness assumption?)
1 to 8 of 8