Successor-Invariant First-Order Logic on Classes of Bounded Degree
Logic in Computer Science
2023-06-22 v4
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.
Cite
@article{arxiv.2009.11758,
title = {Successor-Invariant First-Order Logic on Classes of Bounded Degree},
author = {Julien Grange},
journal= {arXiv preprint arXiv:2009.11758},
year = {2023}
}