Maximally embeddable components
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.
- The joint embedding property and maximal models
- Maximum genus of strong embeddings
- scientific article; zbMATH DE number 942688
- scientific article; zbMATH DE number 5145450
- Embeddability of the combinohedron
- On strong embeddability and finite decomposition complexity
- Extremal properties of principal embeddings
- Embeddings of Decomposition Spaces
- Maximal elements and equilibria of condensing multimaps
- Almost-compact embeddings
- Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
- Countable Ultrahomogeneous Undirected Graphs
- Distributivity of quotients of countable products of Boolean algebras
- From \(A_{1}\) to \(D_{5}\): towards a forcing-related classification of relational structures
- scientific article; zbMATH DE number 1228763 (Why is no real title available?)
- Posets of copies of countable scattered linear orders
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Posets of copies of countable non-scattered labeled linear orders
- Isomorphic and strongly connected components
- Condensational equivalence, equimorphism, elementary equivalence and similar similarities
- The poset of all copies of the random graph has the 2-localization property
- From \(A_{1}\) to \(D_{5}\): towards a forcing-related classification of relational structures
- Posets of copies of countable scattered linear orders
- Posets of isomorphic substructures of relational structures
- The components of maximum
- Different similarities
This page was built for publication: Maximally embeddable components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q377481)
