arXiv (All)
open access
The Composition Lemma for $n$-dependence
We prove that a relation obtained by composing arbitrary functions of arity $\leq 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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the distribution of addition chains#158586
- Nested Regime Composition: Certified Interfaces, Obligation Flow, and the Soundness of Level Ascent#690950
- Ontoformatting Theory#725904
- Confluence relations for $q$-analogues of multiple zeta values#821497
- Iteration and Dependence Again#100011
Record · ID 821186
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive