首页> 外文会议>International Symposium on Fundamentals of Computation Theory >Completeness and Compactness of Quantitative Domains
【24h】

Completeness and Compactness of Quantitative Domains

机译:定量域的完整性和紧凑性

获取原文

摘要

In this paper we study the interplay between metric and order completeness of semantic domains equipped with generalised distances. We prove that for bounded complete posets directed-complete-ness and partial metric completeness are interdefinable. Moreover, we demonstrate that Lawson-compact, countably based domains are precisely the compact pmetric spaces that are continuously ordered.
机译:在本文中,我们研究了具有广义距离的语义域的度量和订单完整性之间的相互作用。我们证明,对于有界完整的Posets,可用于互通的完整 - NESS和部分公制完整性是可互换的。此外,我们证明了劳动紧凑,可相当基础的域正是持续订购的紧凑型粉碎空间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号