[2302.05695] Monadic NIP in monotone classes of relational structures
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Mathematics > Logic

arXiv:2302.05695 (math)
[Submitted on 11 Feb 2023]

Title:Monadic NIP in monotone classes of relational structures

Authors:Samuel Braunfeld, Anuj Dawar, Ioannis Eleftheriadis, Aris Papadopoulos
View PDF
Abstract:We prove that for any monotone class of finite relational structures, the first-order theory of the class is NIP in the sense of stability theory if, and only if, the collection of Gaifman graphs of structures in this class is nowhere dense. This generalises to relational structures a result previously known for graphs and answers an open question posed by Adler and Adler (2014). The result is established by the application of Ramsey-theoretic techniques and shows that the property of being NIP is highly robust for monotone classes. We also show that the model-checking problem for first-order logic is intractable on any class of monotone structures that is not (monadically) NIP. This is a contribution towards the conjecture of Bonnet et al. that the hereditary classes of structures admitting fixed-parameter tractable model-checking are precisely those that are monadically NIP.
Subjects: Logic (math.LO); Logic in Computer Science (cs.LO); Combinatorics (math.CO)
MSC classes: 3C13, 03C45, 05C75, 68R05, 68Q27
ACM classes: F.4.1; G.2.1
Cite as: arXiv:2302.05695 [math.LO]
  (or arXiv:2302.05695v1 [math.LO] for this version)
  https://doi.org/10.48550/arXiv.2302.05695

Submission history

From: Ioannis Eleftheriadis [view email]
[v1] Sat, 11 Feb 2023 13:42:07 UTC (29 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
math.LO
< prev   |   next >
new | recent | 2023-02
Change to browse by:
cs
cs.LO
math
math.CO

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)