Changed “for all $-2 \le n \le \infty$” in proposition 3.3 (the existence of the ($n$-connected, $n$-truncated) factorization system) to “$-2 \le n \lt \infty$” to match the formulation of HTT’s example 5.2.8.16 (Lurie 2009: 390).

(Is it even true for $n=\infty$ with the definition of $n$-truncatedness given here, or do you need some hypercompleteness assumption?)

]]>subcategory of n-truncated objects is called \tau_n C

Anonymous

]]>Included the description of n-truncated objects in the category of presheaves being the presheaves taking values in n-truncated spaces.

]]>Fixed a typo.

]]>The theorem that presentable functors commute with truncation (HTT 5.5.6.28) omitted the hypothesis that the functor is left exact.

]]>Added the characterization of n-truncated morphisms via homotopy groups.

]]>added this pointer:

- Nima Rasekh,
*An Elementary Approach to Truncations*(arXiv:1812.10527)

In the section “In terms of truncations” I have added a few more cross links (both between the definitions in that section as well as to the respective items in HTT).

]]>