Maximally embeddable components (Q377481): Difference between revisions

Let \(\mathbb{X}=\langle X, \varrho\rangle\) be a countable binary relational structure and \(\mathbb{P}(\mathbb{X})\) the set of domains of its isomorphic substructures. The author investigates the partial orderings \(\langle\mathbb{P}(\mathbb{X}), \subset\rangle\) with the goal of determining their \textit{forcing equivalents}. (Two pre-orders \(\mathbb{P}\) and \(\mathbb{Q}\) are forcing equivalent if they give rise to the same generic extensions.) The author's main theorem, too complicated to be cited in a brief review, shows that if the components of \(\mathbb{X}\) are maximally embeddable and satisfy an additional condition related to connectivity, then \(\langle\mathbb{P}(\mathbb{X}), \subset\rangle\) is forcing equivalent to one of the following: a finite power of \((P(\omega)/\text{Fin})^{+}\); \((P(\omega\times\omega)/( \text{Fin}\times\text{Fin}))^{+}\); or \((P(\Delta)/\mathcal{E}\mathcal{D}_{\text{fin}})^{+}\times((P(\omega)/\text{Fin})^{+})^{n}\) for some \(n\in\omega\). The author thereby obtains forcing equivalents for countable equivalence relations, disconnected ultra-homogeneous graphs, and certain partial orderings.