{"title":"Sketches","authors":"J. Power, M. Takeyama, Y. Kinoshita","doi":"10.1142/9789811204746_0007","DOIUrl":null,"url":null,"abstract":"We generalise the notion of sketch. For any locally nitely presentable category, one can speak of algebraic structure on the category, or equivalently, a nitary monad on it. For any such nitary monad, we de ne the notions of sketch and strict model and prove that any sketch has a generic strict model on it. This is all done with enrichment in any monoidal biclosed category that is locally nitely presentable as a closed category. Restricting our attention to enrichment in Cat, we mildly extend the de nition of strict model to give a de nition of model, and we prove that every sketch has a generic model on it. The leading example is the category of small categories together with the monad for small categories with nite products: we then recover the usual notions of nite product sketch and model; and that is typical. This generalises many of the extant notions of sketch. c © 1998 Elsevier Science B.V. All rights reserved. MSC: 18C05; 18C20; 18D20","PeriodicalId":91988,"journal":{"name":"\"Medical Computer Vision: Algorithms for Big Data\" : International Workshop, MCV 2015, held in conjunction with MICCAI 2015, Munich, Germany, October 9, 2015 : revised selected papers. MCV (Workshop) (5th : 2015 : Munich, Germany)","volume":"13 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"\"Medical Computer Vision: Algorithms for Big Data\" : International Workshop, MCV 2015, held in conjunction with MICCAI 2015, Munich, Germany, October 9, 2015 : revised selected papers. MCV (Workshop) (5th : 2015 : Munich, Germany)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789811204746_0007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

We generalise the notion of sketch. For any locally nitely presentable category, one can speak of algebraic structure on the category, or equivalently, a nitary monad on it. For any such nitary monad, we de ne the notions of sketch and strict model and prove that any sketch has a generic strict model on it. This is all done with enrichment in any monoidal biclosed category that is locally nitely presentable as a closed category. Restricting our attention to enrichment in Cat, we mildly extend the de nition of strict model to give a de nition of model, and we prove that every sketch has a generic model on it. The leading example is the category of small categories together with the monad for small categories with nite products: we then recover the usual notions of nite product sketch and model; and that is typical. This generalises many of the extant notions of sketch. c © 1998 Elsevier Science B.V. All rights reserved. MSC: 18C05; 18C20; 18D20
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
草图
我们概括了素描的概念。对于任何局部可表示的范畴,我们可以说范畴上的代数结构,或者等价地说范畴上的一元。对于任意这样的一元单子,我们定义了草图和严格模型的概念,并证明了任何草图都有一个通用的严格模型。这一切都是通过在任何单面双闭类别中进行富集来完成的,这些类别在局部上看起来很像一个封闭类别。本文将严格模型的定义适度扩展,给出了模型的定义,并证明了每个草图上都有一个通用模型。最主要的例子是小类别的类别和小类别的单子,包括小类别的产品:然后我们恢复了小产品草图和模型的通常概念;这很典型。这概括了许多现存的素描概念。c©1998 Elsevier Science B.V.保留所有权利。MSC: 18 c05;18甜;18 d20开头
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Algorithms for Large-scale Network Analysis and the NetworKit Toolkit Energy-Efficient Scheduling The GENO Software Stack Skeleton-Based Clustering by Quasi-Threshold Editing Graph-Based Methods for Rational Drug Design
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1