Computable approximations of a chainable continuum with a computable endpoint

IF 0.3 4区数学 Q1 Arts and Humanities

Archive for Mathematical Logic Pub Date : 2023-09-13 DOI:10.1007/s00153-023-00891-5

Zvonko Iljazović, Matea Jelić

引用次数: 0

Abstract

It is known that a semicomputable continuum S in a computable topological space can be approximated by a computable subcontinuum by any given precision under condition that S is chainable and decomposable. In this paper we show that decomposability can be replaced by the assumption that S is chainable from a to b, where a is a computable point.

查看原文本刊更多论文

具有可计算端点的可链连续体的可计算近似值

众所周知，在可计算拓扑空间中的半可计算连续体 S，在 S 是可链和可分解的条件下，可以用任意给定精度的可计算子连续体来逼近。在本文中，我们证明可分解性可以用 S 从 a 到 b 是可链的假设来代替，其中 a 是一个可计算点。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Archive for Mathematical Logic MATHEMATICS-LOGIC

CiteScore

0.80

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： The journal publishes research papers and occasionally surveys or expositions on mathematical logic. Contributions are also welcomed from other related areas, such as theoretical computer science or philosophy, as long as the methods of mathematical logic play a significant role. The journal therefore addresses logicians and mathematicians, computer scientists, and philosophers who are interested in the applications of mathematical logic in their own field, as well as its interactions with other areas of research.