Forcing with copies of countable ordinals

DOI10.1090/S0002-9939-2014-12360-4zbMath1386.03065arXiv1304.7714OpenAlexW2594228161MaRDI QIDQ5179345

Miloš S. Kurilić

Publication date: 19 March 2015

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.7714

Mathematics Subject Classification ID

Partial orders, general (06A06) Consistency and independence results (03E35) Ordinal and cardinal numbers (03E10) Other aspects of forcing and Boolean-valued models (03E40) Model theory of denumerable and separable structures (03C15)

Related Items (10)

The poset of all copies of the random graph has the 2-localization property ⋮ Antichains of copies of ultrahomogeneous structures ⋮ Condensational equivalence, equimorphism, elementary equivalence and similar similarities ⋮ Posets of copies of countable non-scattered labeled linear orders ⋮ Different similarities ⋮ Forcing with copies of the Rado and Henson graphs ⋮ Isomorphic and strongly connected components ⋮ Copies of the random graph ⋮ CLASSES OF BARREN EXTENSIONS ⋮ Ramsey degrees of ultrafilters, pseudointersection numbers, and the tools of topological Ramsey spaces

Cites Work

• Posets of copies of countable scattered linear orders
• Forcing by non-scattered sets
• Set theory. An introduction to independence proofs
• Theory of relations. Transl. from the French by P. Clote. With an appendix by Norbert Sauer.
• On Fraissé's order type conjecture
• FROM A1 TO D5: TOWARDS A FORCING-RELATED CLASSIFICATION OF RELATIONAL STRUCTURES
• THE NEXT BEST THING TO A P-POINT
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Forcing with copies of countable ordinals