Unbounded envelope heights for finite subsets

Let \strH\str H and \strG\str G be the structures in the source, let φ ⁣:\strH\strG\varphi\colon\str H\to\str G be an embedding, and let an envelope of a finite subset have the source's valuation-tree meaning. Assume that for every nωn\in\omega there is aωa\in\omega such that the number of relations of arity aa is at least nn. Unbounded envelope-height conjecture. For every embedding φ ⁣:\strH\strG\varphi\colon\str H\to\str G, there is some kωk\in\omega such that for every RωR\in\omega there is a set Sφ[\strH]S\subseteq\varphi[\str H] with S=k|S|=k whose every envelope has height at least RR. This strengthens the claim that no single embedding is uniformly kk-enveloping.

Sources & referencesView supporting material

Primary source

Samuel Braunfeld, David Chodounský, Noé de Rancourt, Jan Hubička, Jamal Kawach and Matěj Konečný, “Big Ramsey Degrees and Infinite Languages”, arXiv:2301.13116 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.