Successor-Invariant First-Order Logic on Classes of Bounded Degree
-
Published:2021-08-13
Issue:
Volume:Volume 17, Issue 3
Page:
-
ISSN:1860-5974
-
Container-title:Logical Methods in Computer Science
-
language:en
-
Short-container-title:
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.
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science