The category of well-filtered dcpos is not $Γ$-faithful

Hualin Miao, Huijun Hou, Xiaodong Jia, Qingguo Li
{"title":"The category of well-filtered dcpos is not $Γ$-faithful","authors":"Hualin Miao, Huijun Hou, Xiaodong Jia, Qingguo Li","doi":"arxiv-2409.01546","DOIUrl":null,"url":null,"abstract":"The Ho-Zhao problem asks whether any two dcpo's with isomorphic Scott closed\nset lattices are themselves isomorphic, that is, whether the category\n$\\mathbf{DCPO}$ of dcpo's and Scott-continuous maps is $\\Gamma$-faithful. In\n2018, Ho, Goubault-Larrecq, Jung and Xi answered this question in the negative,\nand they introduced the category $\\mathbf{DOMI}$ of dominated dcpo's and proved\nthat it is {$\\Gamma$-faithful}. Dominated dcpo's subsume many familiar families\nof dcpo's in domain theory, such as the category of bounded-complete dcpo's and\nthat of sober dcpo's, among others. However, it is unknown whether the category\nof dominated dcpo's dominates all well-filtered dcpo's, a class strictly larger\nthan that of bounded-complete lattices and that of sober dcpo's. In this paper,\nwe address this very natural question and show that the category $\\mathbf{WF}$\nof well-filtered dcpo's is not $\\Gamma$-faithful, and as a result of it,\nwell-filtered dcpo's need not be dominated in general. Since not all dcpo's are\nwell-filtered, our work refines the results of Ho, Goubault-Larrecq, Jung and\nXi. As a second contribution, we confirm that the Lawson's category of\n$\\Omega^{*}$-compact dcpo's is $\\Gamma$-faithful. Moreover, we locate a class\nof dcpo's which we call weakly dominated dcpo's, and show that this class is\n$\\Gamma$-faithful and strictly larger than $\\mathbf{DOMI}$.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"24 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.01546","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Ho-Zhao problem asks whether any two dcpo's with isomorphic Scott closed set lattices are themselves isomorphic, that is, whether the category $\mathbf{DCPO}$ of dcpo's and Scott-continuous maps is $\Gamma$-faithful. In 2018, Ho, Goubault-Larrecq, Jung and Xi answered this question in the negative, and they introduced the category $\mathbf{DOMI}$ of dominated dcpo's and proved that it is {$\Gamma$-faithful}. Dominated dcpo's subsume many familiar families of dcpo's in domain theory, such as the category of bounded-complete dcpo's and that of sober dcpo's, among others. However, it is unknown whether the category of dominated dcpo's dominates all well-filtered dcpo's, a class strictly larger than that of bounded-complete lattices and that of sober dcpo's. In this paper, we address this very natural question and show that the category $\mathbf{WF}$ of well-filtered dcpo's is not $\Gamma$-faithful, and as a result of it, well-filtered dcpo's need not be dominated in general. Since not all dcpo's are well-filtered, our work refines the results of Ho, Goubault-Larrecq, Jung and Xi. As a second contribution, we confirm that the Lawson's category of $\Omega^{*}$-compact dcpo's is $\Gamma$-faithful. Moreover, we locate a class of dcpo's which we call weakly dominated dcpo's, and show that this class is $\Gamma$-faithful and strictly larger than $\mathbf{DOMI}$.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
滤波良好的 dcpos 类别并非忠实于 $Γ$
何钊问题问的是任何两个具有同构斯科特闭集网格的dcpo本身是否同构,即dcpo和斯科特连续映射的范畴$\mathbf{DCPO}$是否忠实于$\Gamma$。2018年,Ho、Goubault-Larrecq、Jung和Xi对这一问题做出了否定的回答,他们引入了支配dcpo的范畴$\mathbf{DOMI}$,并证明它是{$\Gamma$-faithful}的。受支配的dcpo包含领域理论中许多熟悉的dcpo系列,例如有界完全dcpo类别和清醒dcpo类别等等。然而,我们还不知道被支配的 dcpo 范畴是否支配了所有好过滤的 dcpo,这个范畴严格来说要比有界完备格和清醒的 dcpo 大。在本文中,我们讨论了这个非常自然的问题,并证明了良好过滤的dcpo的类别$\mathbf{WF}$并不忠实于$\Gamma$,其结果是,良好过滤的dcpo在一般情况下不需要被支配。由于并非所有的 dcpo 都是良好过滤的,我们的工作完善了 Ho、Goubault-Larrecq、Jung 和 Xi 的结果。作为第二项贡献,我们证实了劳森的$\Omega^{*}$-compact dcpo类别是$\Gamma$-faithful的。此外,我们还找到了一类dcpo,我们称之为弱支配dcpo,并证明这一类dcpo是$\Gamma$忠实的,并且严格大于$\mathbf{DOMI}$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Imperative Language for Verified Exact Real-Number Computation On Randomized Computational Models and Complexity Classes: a Historical Overview Computation and Complexity of Preference Inference Based on Hierarchical Models Stability Property for the Call-by-Value $λ$-calculus through Taylor Expansion Resource approximation for the $λμ$-calculus
×
引用
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