In the following, we assume they chose (A,<A)– the case(B,<B)is defined analogously

Spoiler picks a structure(A,<A)and( B,<B)

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

browse 1 citing papers

representative citing papers

cs.LO · 2026-04-30 · unverdicted · novelty 7.0

Order-invariant cluster first-order logic has the same expressive power as first-order logic on every class of graphs with bounded degree.

Showing 1 of 1 citing paper.

Order-invariant cluster first-order logic on graph classes of bounded degree cs.LO · 2026-04-30 · unverdicted · none · ref 1
Order-invariant cluster first-order logic has the same expressive power as first-order logic on every class of graphs with bounded degree.