The complexity of being monitorable

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.

Authors

Publication Details

Journal
Logical Methods in Computer Science
Published
2026-11-09
DOI
https://doi.org/10.46298/lmcs-22(4:19)2026
Citations
1
Primary Topic
Advanced Topology and Set Theory
Type
article
Field-Weighted Citation Impact
1.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

The complexity of being monitorable

Riccardo Camerlo, Francesco Dagnino
1 citations
Logical Methods in Computer Science
Advanced Topology and Set Theory
1.97
article

The complexity of being monitorable

Riccardo Camerlo, Francesco Dagnino
article en
1 citations

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.

Logical Methods in Computer ScienceVol. Volume 22, Issue 4
Openalex Percentile: Top 23%
Advanced Topology and Set Theory
1.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
The complexity of being monitorable — Riccardo Camerlo, Francesco Dagnino · Logical Methods in Computer Science (2026) | TGRS Research Map | TGRS