{"title":"富集类石斑鱼的初级纤维化","authors":"Jacopo Emmenegger, Fabio Pasquali, G. Rosolini","doi":"10.1017/S096012952100030X","DOIUrl":null,"url":null,"abstract":"Abstract The present paper aims at stressing the importance of the Hofmann–Streicher groupoid model for Martin Löf Type Theory as a link with the first-order equality and its semantics via adjunctions. The groupoid model was introduced by Martin Hofmann in his Ph.D. thesis and later analysed in collaboration with Thomas Streicher. In this paper, after describing an algebraic weak factorisation system \n$$\\mathsf {L, R}$$\n on the category \n$${\\cal C}-{\\cal Gpd}$$\n of \n$${\\cal C}$$\n -enriched groupoids, we prove that its fibration of algebras is elementary (in the sense of Lawvere) and use this fact to produce the factorisation of diagonals for \n$$\\mathsf {L, R}$$\n needed to interpret identity types.","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":"31 1","pages":"958 - 978"},"PeriodicalIF":0.4000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Elementary fibrations of enriched groupoids\",\"authors\":\"Jacopo Emmenegger, Fabio Pasquali, G. Rosolini\",\"doi\":\"10.1017/S096012952100030X\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract The present paper aims at stressing the importance of the Hofmann–Streicher groupoid model for Martin Löf Type Theory as a link with the first-order equality and its semantics via adjunctions. The groupoid model was introduced by Martin Hofmann in his Ph.D. thesis and later analysed in collaboration with Thomas Streicher. In this paper, after describing an algebraic weak factorisation system \\n$$\\\\mathsf {L, R}$$\\n on the category \\n$${\\\\cal C}-{\\\\cal Gpd}$$\\n of \\n$${\\\\cal C}$$\\n -enriched groupoids, we prove that its fibration of algebras is elementary (in the sense of Lawvere) and use this fact to produce the factorisation of diagonals for \\n$$\\\\mathsf {L, R}$$\\n needed to interpret identity types.\",\"PeriodicalId\":49855,\"journal\":{\"name\":\"Mathematical Structures in Computer Science\",\"volume\":\"31 1\",\"pages\":\"958 - 978\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2021-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical Structures in Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1017/S096012952100030X\",\"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/S096012952100030X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
Abstract The present paper aims at stressing the importance of the Hofmann–Streicher groupoid model for Martin Löf Type Theory as a link with the first-order equality and its semantics via adjunctions. The groupoid model was introduced by Martin Hofmann in his Ph.D. thesis and later analysed in collaboration with Thomas Streicher. In this paper, after describing an algebraic weak factorisation system
$$\mathsf {L, R}$$
on the category
$${\cal C}-{\cal Gpd}$$
of
$${\cal C}$$
-enriched groupoids, we prove that its fibration of algebras is elementary (in the sense of Lawvere) and use this fact to produce the factorisation of diagonals for
$$\mathsf {L, R}$$
needed to interpret identity types.
期刊介绍:
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.