The identity type weak factorisation system

dc.creatorGambino, Nicola
dc.creatorGarner, Richard
dc.date2008-03-31
dc.date2008-09-01
dc.date.accessioned2026-07-07T10:16:43Z
dc.date.available2026-07-07T10:16:43Z
dc.descriptionWe show that the classifying category C(T) of a dependent type theory T with axioms for identity types admits a non-trivial weak factorisation system. We provide an explicit characterisation of the elements of both the left class and the right class of the weak factorisation system. This characterisation is applied to relate identity types and the homotopy theory of groupoids.
dc.description25 pages; accepted for publication in Theoretical Computer Science
dc.identifierhttps://arxiv.org/abs/0803.4349
dc.identifierhttp://arxiv.org/abs/0803.4349
dc.identifierTheoretical Computer Science 409 (2008), no. 1, 94--109
dc.identifierdoi:10.1016/j.tcs.2008.08.030
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173605
dc.subjectLogic
dc.subjectCategory Theory
dc.subject03B15; 18C50; 18B40
dc.titleThe identity type weak factorisation system
dc.typetext

Files

Collections