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

From MaRDI portal
Publication:5145657

DOI10.1145/3373718.3394767zbMATH Open1498.03069arXiv2009.11758OpenAlexW3032610015WikidataQ130826261 ScholiaQ130826261MaRDI QIDQ5145657FDOQ5145657

Julien Grange

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2009.11758





Cites Work


Cited In (4)






This page was built for publication: Successor-Invariant First-Order Logic on Classes of Bounded Degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145657)