Forcing by non-scattered sets
From MaRDI portal
Publication:435203
Recommendations
Cites work
Cited in
(15)- Isomorphic and strongly connected components
- The poset of all copies of the random graph has the 2-localization property
- Posets of copies of countable ultrahomogeneous tournaments
- Maximal chains of isomorphic suborders of countable ultrahomogeneous partial orders.
- Antichains of copies of ultrahomogeneous structures
- Different similarities
- Maximal chains of copies of the rational line
- Copies of the random graph
- Forcing with copies of the Rado and Henson graphs
- On non-wellfounded iterations of the perfect set forcing
- Posets of copies of countable non-scattered labeled linear orders
- Condensational equivalence, equimorphism, elementary equivalence and similar similarities
- Forcing with copies of countable ordinals
- Oscillation stability for continuous monotone surjections
- Posets of copies of countable scattered linear orders
This page was built for publication: Forcing by non-scattered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q435203)