{"title":"一元弱范畴作为类型论的模型","authors":"Thibaut Benjamin","doi":"10.1017/s0960129522000172","DOIUrl":null,"url":null,"abstract":"\n Weak \n \n \n \n$\\omega$\n\n \n -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 \n \n \n \n$\\omega$\n\n \n -groupoid in a globular setting, since every type carries such a structure. Starting from this remark, Brunerie could extract this definition of globular weak \n \n \n \n$\\omega$\n\n \n -groupoids, formulated as a type theory. By refining its rules, Finster and Mimram have then defined a type theory called \n \n \n \n$\\mathsf{CaTT}$\n\n \n , whose models are weak \n \n \n \n$\\omega$\n\n \n -categories. Here, we generalize this approach to monoidal weak \n \n \n \n$\\omega$\n\n \n -categories. Based on the principle that they should be equivalent to weak \n \n \n \n$\\omega$\n\n \n -categories with only one 0-cell, we are able to derive a type theory \n \n \n \n$\\mathsf{MCaTT}$\n\n \n whose models are monoidal weak \n \n \n \n$\\omega$\n\n \n -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 \n \n \n \n$\\mathsf{MCaTT}$\n\n \n and the type theory \n \n \n \n$\\mathsf{CaTT}$\n\n \n . Our main contribution is to show that these translations relate the models of our type theory to the models of the type theory \n \n \n \n$\\mathsf{CaTT}$\n\n \n consisting of \n \n \n \n$\\omega$\n\n \n -categories with only one 0-cell by analyzing in details how the notion of models interact with the structural rules of both type theories.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2022-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Monoidal weak ω-categories as models of a type theory\",\"authors\":\"Thibaut Benjamin\",\"doi\":\"10.1017/s0960129522000172\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\n Weak \\n \\n \\n \\n$\\\\omega$\\n\\n \\n -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 \\n \\n \\n \\n$\\\\omega$\\n\\n \\n -groupoid in a globular setting, since every type carries such a structure. Starting from this remark, Brunerie could extract this definition of globular weak \\n \\n \\n \\n$\\\\omega$\\n\\n \\n -groupoids, formulated as a type theory. By refining its rules, Finster and Mimram have then defined a type theory called \\n \\n \\n \\n$\\\\mathsf{CaTT}$\\n\\n \\n , whose models are weak \\n \\n \\n \\n$\\\\omega$\\n\\n \\n -categories. Here, we generalize this approach to monoidal weak \\n \\n \\n \\n$\\\\omega$\\n\\n \\n -categories. Based on the principle that they should be equivalent to weak \\n \\n \\n \\n$\\\\omega$\\n\\n \\n -categories with only one 0-cell, we are able to derive a type theory \\n \\n \\n \\n$\\\\mathsf{MCaTT}$\\n\\n \\n whose models are monoidal weak \\n \\n \\n \\n$\\\\omega$\\n\\n \\n -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 \\n \\n \\n \\n$\\\\mathsf{MCaTT}$\\n\\n \\n and the type theory \\n \\n \\n \\n$\\\\mathsf{CaTT}$\\n\\n \\n . Our main contribution is to show that these translations relate the models of our type theory to the models of the type theory \\n \\n \\n \\n$\\\\mathsf{CaTT}$\\n\\n \\n consisting of \\n \\n \\n \\n$\\\\omega$\\n\\n \\n -categories with only one 0-cell by analyzing in details how the notion of models interact with the structural rules of both type theories.\",\"PeriodicalId\":49855,\"journal\":{\"name\":\"Mathematical Structures in Computer Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2022-06-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Structures in Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1017/s0960129522000172\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Structures in Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1017/s0960129522000172","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Monoidal weak ω-categories as models of a type theory
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$
-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
$\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 with only one 0-cell, we are able to derive a type theory
$\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
$\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}$
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.
期刊介绍:
Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results.