English

The complexity of being monitorable

Logic 2026-01-09 v1 Logic in Computer Science

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 XX. When XX is second countable, we observe that the family of monitorable sets is Π30\Pi^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 \Pi^1_1-complete.

Keywords

Cite

@article{arxiv.2601.04256,
  title  = {The complexity of being monitorable},
  author = {Riccardo Camerlo and Francesco Dagnino},
  journal= {arXiv preprint arXiv:2601.04256},
  year   = {2026}
}