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 . When is second countable, we observe that the family of monitorable sets is and determine the exact complexities it can have. In contrast, we show that if is not second countable then the family of monitorable sets can be much more complex, giving an example where it is -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}
}