Posets of copies of countable non-scattered labeled linear orders

DOI10.1007/s11083-019-09492-5zbMath1481.03054OpenAlexW2953585341MaRDI 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

zbMATH Keywords

Sacks forcing\( \sigma \)-closed forcingcountable homogeneous universal \(n\)-labeled linear order

Mathematics Subject Classification ID

Partial orders, general (06A06) Consistency and independence results (03E35) Other combinatorial set theory (03E05) Models with special properties (saturated, rigid, etc.) (03C50) Other aspects of forcing and Boolean-valued models (03E40)

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

This page was built for publication: Posets of copies of countable non-scattered labeled linear orders