找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Domains and Processes; Proceedings of the 1 Klaus Keimel,Guo-Qiang Zhang,Yi-Xang Chen Conference proceedings 2001 Kluwer Academic Publisher

[复制链接]
楼主: Awkward
发表于 2025-3-26 22:04:43 | 显示全部楼层
U,-Admitting DCPOS Need not be Sober,. implies .⊂. for some . ⊂ .. In this note, we construct an example of a ..-admitting dcpo which is not sober, thus giving a negative answer to an open problem posed by Heckmann in 1991. Moreover, we prove that for every locally compact dcpo, ..-admitting is equivalent to sober.
发表于 2025-3-27 03:22:33 | 显示全部楼层
Normal Subsets in Abstract Bases,, the problem of definition and characterization of sub-domains in the category of continuous domains will be discussed. Then a dcpo class of abstract bases will be introduced and a fixed point theorem of continuous mappings on the class will be addressed. Finally, connections with other approaches to domain equations will be discussed briefly.
发表于 2025-3-27 05:26:56 | 显示全部楼层
发表于 2025-3-27 12:00:13 | 显示全部楼层
https://doi.org/10.1007/978-3-322-81404-3In this paper continuity for abstract semantics defined for lattices is generalized to the case of bc-domains, an equivalent characterization for semantics being continuous is given. Relation between continuity and compactness is given. Finally, application to fuzzy logic is discussed.
发表于 2025-3-27 14:32:13 | 显示全部楼层
The Lawson Topology on Quasicontinuous Domains,For a directed complete poset ., let λ(.) and σ(.) be the lower topology and the Lawson topology on . respectively. We constructively prove that if . is a quasicontinuous domain and all lower closed subsets in (., λ(.)) are closed in (., ω(.)),then (.,λ(P)) is strictly completely regular ordered space.
发表于 2025-3-27 20:01:53 | 显示全部楼层
Compact Semantics on BC-Domains,In this paper continuity for abstract semantics defined for lattices is generalized to the case of bc-domains, an equivalent characterization for semantics being continuous is given. Relation between continuity and compactness is given. Finally, application to fuzzy logic is discussed.
发表于 2025-3-28 01:12:58 | 显示全部楼层
https://doi.org/10.1007/978-94-010-0654-5C programming language; Equivalence; computability; logic; proof; semantics
发表于 2025-3-28 03:33:51 | 显示全部楼层
发表于 2025-3-28 07:53:12 | 显示全部楼层
发表于 2025-3-28 14:25:29 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 21:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表