No CrossRef data available.
Published online by Cambridge University Press: 27 June 2022
Weak  $\omega$-categories are notoriously difficult to define because of the very intricate nature of their axioms. Various approaches have been explored based on different shapes given to the cells. Interestingly, homotopy type theory encompasses a definition of weak
$\omega$-categories are notoriously difficult to define because of the very intricate nature of their axioms. Various approaches have been explored based on different shapes given to the cells. Interestingly, homotopy type theory encompasses a definition of weak  $\omega$-groupoid in a globular setting, since every type carries such a structure. Starting from this remark, Brunerie could extract this definition of globular weak
$\omega$-groupoid in a globular setting, since every type carries such a structure. Starting from this remark, Brunerie could extract this definition of globular weak  $\omega$-groupoids, formulated as a type theory. By refining its rules, Finster and Mimram have then defined a type theory called
$\omega$-groupoids, formulated as a type theory. By refining its rules, Finster and Mimram have then defined a type theory called  $\mathsf{CaTT}$, whose models are weak
$\mathsf{CaTT}$, whose models are weak  $\omega$-categories. Here, we generalize this approach to monoidal weak
$\omega$-categories. Here, we generalize this approach to monoidal weak  $\omega$-categories. Based on the principle that they should be equivalent to weak
$\omega$-categories. Based on the principle that they should be equivalent to weak  $\omega$-categories with only one 0-cell, we are able to derive a type theory
$\omega$-categories with only one 0-cell, we are able to derive a type theory  $\mathsf{MCaTT}$ whose models are monoidal weak
$\mathsf{MCaTT}$ whose models are monoidal weak  $\omega$-categories. This requires changing the rules of the theory in order to encode the information carried by the unique 0-cell. The correctness of the resulting type theory is shown by defining a pair of translations between our type theory
$\omega$-categories. This requires changing the rules of the theory in order to encode the information carried by the unique 0-cell. The correctness of the resulting type theory is shown by defining a pair of translations between our type theory  $\mathsf{MCaTT}$ and the type theory
$\mathsf{MCaTT}$ and the type theory  $\mathsf{CaTT}$. Our main contribution is to show that these translations relate the models of our type theory to the models of the type theory
$\mathsf{CaTT}$. Our main contribution is to show that these translations relate the models of our type theory to the models of the type theory  $\mathsf{CaTT}$ consisting of
$\mathsf{CaTT}$ consisting of  $\omega$-categories with only one 0-cell by analyzing in details how the notion of models interact with the structural rules of both type theories.
$\omega$-categories with only one 0-cell by analyzing in details how the notion of models interact with the structural rules of both type theories.
 $\infty$
-groupoïdes de Grothendieck et une variante
$\infty$
-groupoïdes de Grothendieck et une variante 
 $\infty$
-catégorique. Phd thesis, Université Paris 7.Google Scholar
$\infty$
-catégorique. Phd thesis, Université Paris 7.Google Scholar $\omega$
-Categories and Related Higher Structures. Phd thesis, Institut Polytechnique de Paris.Google Scholar
$\omega$
-Categories and Related Higher Structures. Phd thesis, Institut Polytechnique de Paris.Google Scholar $\omega$
-categories as models of a type theory. arXiv preprint, arXiv:2106.04475.Google Scholar
$\omega$
-categories as models of a type theory. arXiv preprint, arXiv:2106.04475.Google Scholar $\omega$
-categories. In: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1–12.Google Scholar
$\omega$
-categories. In: 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1–12.Google Scholar $\infty$
-categories. arXiv preprint arXiv:2007.08307.Google Scholar
$\infty$
-categories. arXiv preprint arXiv:2007.08307.Google Scholar $\omega$
-categories from intensional type theory. In: International Conference on Typed Lambda Calculi and Applications, Springer, 172–187.Google Scholar
$\omega$
-categories from intensional type theory. In: International Conference on Typed Lambda Calculi and Applications, Springer, 172–187.Google Scholar $\infty$
-groupoids, and still another definition of
$\infty$
-groupoids, and still another definition of 
 $\infty$
-categories. Preprint arXiv:1009.2331.Google Scholar
$\infty$
-categories. Preprint arXiv:1009.2331.Google Scholar $\omega$
-groupoids. Proceedings of the London Mathematical Society 102 (2) 370–394.Google Scholar
$\omega$
-groupoids. Proceedings of the London Mathematical Society 102 (2) 370–394.Google Scholar