跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2601.04256 · v4

The complexity of being monitorable

首次提交 2026-01-07 06:32
版本更新 2026-11-06 05:03
雷达观测 2026-11-09 10:16
arXiv ↗PDF ↗

摘要

We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space XX. When XX is second countable, we observe that the family of monitorable sets is Π30Π^0_3 and determine the exact complexities it can have. In contrast, we show that if XX is not second countable then the family of monitorable sets can be much more complex, giving an example where it is Π11 Π^1_1-complete.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v4,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v4 · 2026-11-06 05:03 · 最新观测版本

The complexity of being monitorable

We study monitorable sets from a topological standpoint. In particular, we use descriptive set theory to describe the complexity of the family of monitorable sets in a countable space XX. When XX is second countable, we observe that the family of monitorable sets is Π30Π^0_3 and determine the exact complexities it can have. In contrast, we show that if XX is not second countable then the family of monitorable sets can be much more complex, giving an example where it is Π11 Π^1_1-complete.

查看此版本解读 →查看此版本原文 ↗