The Composition Lemma for n-dependence
Artem Chernikov, Yuyan He
math.LOarXiv:2609.01230
Abstract
We prove that a relation obtained by composing arbitrary functions of arity ≤ k with a relation definable in an n-dependent structure is kn-dependent. This confirms a conjecture of Chernikov and Hempel. We also demonstrate optimality of the result.
Create a lesson
Related papers
A choice-free proof of the Erdös--Dushnik--Miller theorem
Guozhen Shen
Ampleness in the Farey graph
Zahra Mohammadi Khangheshlaghi, Rizos Sklinos
Baumslag-Solitar Subgroups Obstruct Model Companions for Fields with Group Actions
Makoto Yanagawa
The weakness of typicality
Eric P. Astor, Laurent Bienvenu, Damir Dzhafarov et al.
Modalities in non-classical variations of S4
Leonardo Pacheco
Infinite Communication Complexity and KW Games
Evan Leach