Posets of copies of countable non-scattered labeled linear orders
From MaRDI portal
Publication:2183097
DOI10.1007/s11083-019-09492-5zbMath1481.03054MaRDI QIDQ2183097
Miloš S. Kurilić, Stevo Todorčević
Publication date: 26 May 2020
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-019-09492-5
Sacks forcing; \( \sigma \)-closed forcing; countable homogeneous universal \(n\)-labeled linear order
06A06: Partial orders, general
03E35: Consistency and independence results
03E05: Other combinatorial set theory
03C50: Models with special properties (saturated, rigid, etc.)
03E40: Other aspects of forcing and Boolean-valued models
Cites Work
- Unnamed Item
- Unnamed Item
- The poset of all copies of the random graph has the 2-localization property
- Posets of copies of countable scattered linear orders
- Forcing by non-scattered sets
- Different similarities
- Set theory. An introduction to independence proofs
- Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
- Copies of the random graph
- Countably categorical coloured linear orders
- Overgroups of the Automorphism Group of the Rado Graph
- Forcing with copies of countable ordinals
- Countable Homogeneous Tournaments