Posets of copies of countable scattered linear orders

Annals of Pure and Applied Logic 165 (3):895-912 (2014)
  Copy   BIBTEX

Abstract

We show that the separative quotient of the poset 〈P,⊂〉 of isomorphic suborders of a countable scattered linear order L is σ-closed and atomless. So, under the CH, all these posets are forcing-equivalent /Fin)+)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Extending partial orders to dense linear orders.Theodore A. Slaman & W. Hugh Woodin - 1998 - Annals of Pure and Applied Logic 94 (1-3):253-261.
Cardinal characteristics and projective wellorders.Vera Fischer & Sy David Friedman - 2010 - Annals of Pure and Applied Logic 161 (7):916-922.
Hypergraphs and proper forcing.Jindřich Zapletal - 2019 - Journal of Mathematical Logic 19 (2):1950007.
Reflection and forcing in E-recursion theory.Theodore A. Slaman - 1985 - Annals of Pure and Applied Logic 29 (1):79-106.
The metamathematics of scattered linear orderings.P. Clote - 1989 - Archive for Mathematical Logic 29 (1):9-20.
Countable ultraproducts without CH.Michael Canjar - 1988 - Annals of Pure and Applied Logic 37 (1):1-79.

Analytics

Added to PP
2014-01-16

Downloads
19 (#791,817)

6 months
8 (#506,022)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Isomorphic and strongly connected components.Miloš S. Kurilić - 2015 - Archive for Mathematical Logic 54 (1-2):35-48.
Different similarities.Miloš S. Kurilić - 2015 - Archive for Mathematical Logic 54 (7-8):839-859.

Add more citations

References found in this work

Forcing by non-scattered sets.Miloš S. Kurilić & Stevo Todorčević - 2012 - Annals of Pure and Applied Logic 163 (9):1299-1308.
Maximally embeddable components.Miloš S. Kurilić - 2013 - Archive for Mathematical Logic 52 (7-8):793-808.
Linear Orderings.Joseph G. Rosenstein - 1983 - Journal of Symbolic Logic 48 (4):1207-1209.

Add more references