Baumgartner’s isomorphism problem for $$\aleph _2$$ ℵ 2 -dense suborders of $$\mathbb {R}$$ R

Archive for Mathematical Logic 56 (7-8):1105-1114 (2017)
  Copy   BIBTEX

Abstract

In this paper we will analyze Baumgartner’s problem asking whether it is consistent that \ and every pair of \-dense subsets of \ are isomorphic as linear orders. The main result is the isolation of a combinatorial principle \\) which is immune to c.c.c. forcing and which in the presence of \ implies that two \-dense sets of reals can be forced to be isomorphic via a c.c.c. poset. Also, it will be shown that it is relatively consistent with ZFC that there exists an \ dense suborder X of \ which cannot be embedded into \ in any outer model with the same \.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

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

The computable Lipschitz degrees of computably enumerable sets are not dense.Adam R. Day - 2010 - Annals of Pure and Applied Logic 161 (12):1588-1602.
Meager nowhere-dense games (IV): N-tactics.Marion Scheepers - 1994 - Journal of Symbolic Logic 59 (2):603-605.
The isomorphism problem for classes of computable fields.Wesley Calvert - 2004 - Archive for Mathematical Logic 43 (3):327-336.
Maximally embeddable components.Miloš S. Kurilić - 2013 - Archive for Mathematical Logic 52 (7-8):793-808.
Van Douwen’s diagram for dense sets of rationals.Jörg Brendle - 2006 - Annals of Pure and Applied Logic 143 (1-3):54-69.
Quotients of Boolean algebras and regular subalgebras.B. Balcar & T. Pazák - 2010 - Archive for Mathematical Logic 49 (3):329-342.

Analytics

Added to PP
2017-09-20

Downloads
38 (#420,897)

6 months
4 (#795,160)

Historical graph of downloads
How can I increase my downloads?