pith. sign in

arxiv: 2601.04256 · v2 · pith:VNUPGX3Inew · submitted 2026-01-06 · 🧮 math.LO · cs.LO

The complexity of being monitorable

classification 🧮 math.LO cs.LO
keywords monitorablesetscountablefamilycomplexitysecondcompletecomplex
0
0 comments X
read the original 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 $\Pi^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 $ \Pi^1_1$-complete.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.