Journal Title
Title of Journal: Arch Math Logic
|
Abbravation: Archive for Mathematical Logic
|
Publisher
Springer Berlin Heidelberg
|
|
|
|
Authors: Miloš S Kurilić
Publish Date: 2013/06/06
Volume: 52, Issue: 7-8, Pages: 793-808
Abstract
We investigate the partial orderings of the form langle mathbbPmathbbX subset rangle where mathbbX =langle X rho rangle is a countable binary relational structure and mathbbP mathbbX the set of the domains of its isomorphic substructures and show that if the components of mathbbX are maximally embeddable and satisfy an additional condition related to connectivity then the poset langle mathbbP mathbbX subset rangle is forcing equivalent to a finite power of Pω/ Fin+ or to the poset Pω × ω/Fin × Fin+ or to the product PDelta /fancyscriptEfancyscriptD rm fin+ times Pomega /rm Fin+n for some n in omega In particular we obtain forcing equivalents of the posets of copies of countable equivalence relations disconnected ultrahomogeneous graphs and some partial orderings
Keywords:
.
|
Other Papers In This Journal:
|