The complexity of being monitorable
Abstract
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.
Fields of Study & Subjects
Advanced Topology and Set Theory
Computability
Logic
AI Algorithms
Cellular Automata and Applications
Publication details
- Journal / source
- arXiv (Cornell University)
- Publication date
- 6 January 2026
- Document type
- Preprint