Order-invariant cluster first-order logic has the same expressive power as first-order logic on every class of graphs with bounded degree.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Order-invariant cluster first-order logic on graph classes of bounded degree
Order-invariant cluster first-order logic has the same expressive power as first-order logic on every class of graphs with bounded degree.