A dichotomy result for countably based sober spaces

IF 0.8 4区 计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS
Hualin Miao , Qingguo Li
{"title":"A dichotomy result for countably based sober spaces","authors":"Hualin Miao ,&nbsp;Qingguo Li","doi":"10.1016/j.ic.2025.105293","DOIUrl":null,"url":null,"abstract":"<div><div>Cartesian closed categories have been playing fundamental roles in providing denotational semantic for higher-order programming languages. In this paper we try to identify Cartesian closed subcategories of the category <span><math><mi>C</mi><msub><mrow><mi>S</mi></mrow><mrow><mo>⊥</mo></mrow></msub></math></span> of pointed countably based sober spaces, and we present a conclusion known as the dichotomy result in the category <span><math><mi>C</mi><msub><mrow><mi>S</mi></mrow><mrow><mo>⊥</mo></mrow></msub></math></span>. This result explains that any Cartesian closed full subcategory of <span><math><mi>C</mi><msub><mrow><mi>S</mi></mrow><mrow><mo>⊥</mo></mrow></msub></math></span> is contained within either the category of weakly compact open connected spaces or that of principally connected spaces.</div><div>To prove our dichotomy theorem, we first deduce that every pointed countably based sober space <em>X</em> is locally connected, if the space of all continuous functions from <em>X</em> to <em>X</em> is locally compact. Next, we demonstrate that a function space in <span><math><mi>C</mi><msub><mrow><mi>S</mi></mrow><mrow><mo>⊥</mo></mrow></msub></math></span> is locally connected only if its input space is either weakly compact open connected or its output space is principally connected.</div></div>","PeriodicalId":54985,"journal":{"name":"Information and Computation","volume":"304 ","pages":"Article 105293"},"PeriodicalIF":0.8000,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Information and Computation","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S089054012500029X","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Cartesian closed categories have been playing fundamental roles in providing denotational semantic for higher-order programming languages. In this paper we try to identify Cartesian closed subcategories of the category CS of pointed countably based sober spaces, and we present a conclusion known as the dichotomy result in the category CS. This result explains that any Cartesian closed full subcategory of CS is contained within either the category of weakly compact open connected spaces or that of principally connected spaces.
To prove our dichotomy theorem, we first deduce that every pointed countably based sober space X is locally connected, if the space of all continuous functions from X to X is locally compact. Next, we demonstrate that a function space in CS is locally connected only if its input space is either weakly compact open connected or its output space is principally connected.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Information and Computation
Information and Computation 工程技术-计算机:理论方法
CiteScore
2.30
自引率
0.00%
发文量
119
审稿时长
140 days
期刊介绍: Information and Computation welcomes original papers in all areas of theoretical computer science and computational applications of information theory. Survey articles of exceptional quality will also be considered. Particularly welcome are papers contributing new results in active theoretical areas such as -Biological computation and computational biology- Computational complexity- Computer theorem-proving- Concurrency and distributed process theory- Cryptographic theory- Data base theory- Decision problems in logic- Design and analysis of algorithms- Discrete optimization and mathematical programming- Inductive inference and learning theory- Logic & constraint programming- Program verification & model checking- Probabilistic & Quantum computation- Semantics of programming languages- Symbolic computation, lambda calculus, and rewriting systems- Types and typechecking
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信