Low rank MSO, a restriction of MSO to bounded-cutrank set quantification, is expressively equivalent to flip-reachability logic on all undirected graphs, to separator logic on weakly sparse classes, and to flip-connectivity logic on bounded-VC-dimension classes.
The monadic second-order logic of graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Low rank MSO
Low rank MSO, a restriction of MSO to bounded-cutrank set quantification, is expressively equivalent to flip-reachability logic on all undirected graphs, to separator logic on weakly sparse classes, and to flip-connectivity logic on bounded-VC-dimension classes.