Maximally embeddable components (Q377481): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4932001 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Posets of copies of countable scattered linear orders / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Countable Ultrahomogeneous Undirected Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4221856 / rank | |||
Normal rank |
Latest revision as of 01:05, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximally embeddable components |
scientific article |
Statements
Maximally embeddable components (English)
0 references
6 November 2013
0 references
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.
0 references
relational structure
0 references
isomorphic substructure
0 references
poset
0 references
forcing equivalents
0 references
0 references
0 references