Julien Grange - Successor-Invariant First-Order Logic on Classes of Bounded Degree

lmcs:6803 - Logical Methods in Computer Science, August 13, 2021, Volume 17, Issue 3 - https://doi.org/10.46298/lmcs-17(3:20)2021
Successor-Invariant First-Order Logic on Classes of Bounded DegreeArticle

Authors: Julien Grange ORCID

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.


Volume: Volume 17, Issue 3
Secondary volumes: Selected Papers of the 34th and 35th ACM/IEEE Symposium on Logic in Computer Science (LICS 2019 and 2020)
Published on: August 13, 2021
Accepted on: July 21, 2021
Submitted on: September 25, 2020
Keywords: Computer Science - Logic in Computer Science, F.4.1

1 Document citing this article

Consultation statistics

This page has been seen 2127 times.
This article's PDF has been downloaded 988 times.