每个 Δ⁰₂ 波兰空间都是可计算的拓扑空间。

IF 0.8 3区数学 Q2 MATHEMATICS

Proceedings of the American Mathematical Society Pub Date : 2024-02-07 DOI:10.1090/proc/16797

Nikolay Bazhenov, Alexander Melnikov, Keng Meng Ng

引用次数: 0

摘要

我们证明，每一个 Δ 2 0 \Delta ^0_2 波兰空间都有一个可计算的拓扑呈现，它由空间中一些非空开集的有效索引给出。

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

查看原文本刊更多论文

Every Δ⁰₂ Polish space is computable topological

We show that every Δ 2 0 \Delta ^0_2 Polish space admits a computable topological presentation given by an effective indexing of some non-empty open sets in the space.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the American Mathematical Society 数学-数学

CiteScore

1.70

自引率

10.00%

发文量

207

审稿时长

2-4 weeks

期刊介绍： All articles submitted to this journal are peer-reviewed. The AMS has a single blind peer-review process in which the reviewers know who the authors of the manuscript are, but the authors do not have access to the information on who the peer reviewers are. This journal is devoted to shorter research articles (not to exceed 15 printed pages) in all areas of pure and applied mathematics. To be published in the Proceedings, a paper must be correct, new, and significant. Further, it must be well written and of interest to a substantial number of mathematicians. Piecemeal results, such as an inconclusive step toward an unproved major theorem or a minor variation on a known result, are in general not acceptable for publication. Longer papers may be submitted to the Transactions of the American Mathematical Society. Published pages are the same size as those generated in the style files provided for AMS-LaTeX.