2000 character limit reached
Successor-Invariant First-Order Logic on Classes of Bounded Degree (2009.11758v4)
Published 24 Sep 2020 in cs.LO
Abstract: We study the expressive power of successor-invariant first-order logic, which is an extension of first-order logic where the usage of an additional successor relation on the structure is allowed, as long as the validity of formulas is independent of the choice of a particular successor on finite structures. We show that when the degree is bounded, successor-invariant first-order logic is no more expressive than first-order logic.