The complexity of being monitorable
By: Riccardo Camerlo, Francesco Dagnino
Potential Business Impact:
Makes computers understand complex patterns better.
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.
Similar Papers
Constraint satisfaction problems, compactness and non-measurable sets
Logic in Computer Science
Proves math ideas or finds impossible numbers.
The role of counting quantifiers in laminar set systems
Logic in Computer Science
Turns complex group rules into simple tree maps.
Dichotomy results for classes of countable graphs
Logic
Organizes computer problems by difficulty.