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 $X$. When $X$ is second countable, we observe that the family of monitorable sets is $Π^0_3$ and determine the exact complexities it can have. In contrast, we show that if $X$ is not second countable then the family of monitorable sets can be much more complex, giving an example where it is $ Π^1_1$-complete.
Authors
- Riccardo Camerlo (ORCID: https://orcid.org/0000-0001-8362-4393)
- Francesco Dagnino (ORCID: https://orcid.org/0000-0003-3599-3535)
Publication Details
- Journal
- Logical Methods in Computer Science
- Published
- 2026-11-09
- DOI
- https://doi.org/10.46298/lmcs-22(4:19)2026
- Citations
- 1
- Primary Topic
- Advanced Topology and Set Theory
- Type
- article
- Field-Weighted Citation Impact
- 1.97