Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/8571
Title: | Maximally embeddable components | Authors: | Kurilić, Miloš | Issue Date: | 1-Nov-2013 | Journal: | Archive for Mathematical Logic | Abstract: | We investigate the partial orderings of the form 〈 ℙ(X), ⊂ 〉, where X = 〈X, ρ〉 is a countable binary relational structure and ℙ(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally embeddable and satisfy an additional condition related to connectivity, then the poset 〈ℙ(X), ⊂〉 is forcing equivalent to a finite power of (P(ω)/ Fin)+, or to the poset (P(ω × ω)/(Fin × Fin))+, or to the product, for some n ∈ ω. In particular we obtain forcing equivalents of the posets of copies of countable equivalence relations, disconnected ultrahomogeneous graphs and some partial orderings. © 2013 Springer-Verlag Berlin Heidelberg. | URI: | https://open.uns.ac.rs/handle/123456789/8571 | ISSN: | 09335846 | DOI: | 10.1007/s00153-013-0344-9 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
6
checked on Sep 9, 2023
Page view(s)
15
Last Week
7
7
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.