首页> 外文会议>Conference on Computability in Europe(CiE 2007); 20070618-23; Siena(IT) >Borel Complexity of Topological Operations on Computable Metric Spaces
【24h】

Borel Complexity of Topological Operations on Computable Metric Spaces

机译:可计算度量空间上拓扑运算的Borel复杂度

获取原文
获取原文并翻译 | 示例

摘要

We study the Borel complexity of topological operations on closed subsets of computable metric spaces. The investigated operations include set theoretic operations as union and intersection, but also typical topological operations such as the closure of the complement, the closure of the interior, the boundary and the derivative of a set. These operations are studied with respect to different computability structures on the hyperspace of closed subsets. These structures include positive or negative information on the represented closed subsets. Topologically, they correspond to the lower or upper Fell topology, respectively, and the induced computability concepts generalize the classical notions of r.e. or co-r.e. subsets, respectively. The operations are classified with respect to effective measurability in the Borel hierarchy and it turns out that most operations can be located in the first three levels of the hierarchy, or they are not even Borel measurable at all. In some cases the effective Borel measurability depends on further properties of the underlying metric spaces, such as effective local compactness and effective local connectedness.
机译:我们研究可计算度量空间的封闭子集上拓扑运算的Borel复杂性。所研究的运算包括集合理论运算(如合集和相交),还包括典型的拓扑运算,例如补集的闭包,内部的闭包,边界和集合的导数。针对封闭子集的超空间上的不同可计算性结构,研究了这些运算。这些结构包括有关表示的封闭子集的肯定或否定信息。在拓扑上,它们分别对应于较低或较高的Fell拓扑,并且引入的可计算性概念概括了r.e.的经典概念。或合作子集。这些操作是根据Borel层次结构中的有效可度量性进行分类的,事实证明,大多数操作可以位于层次结构的前三个级别中,或者根本无法测量Borel。在某些情况下,有效的Borel可测量性取决于基础度量空间的其他属性,例如有效的局部紧实度和有效的局部连通性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号