4,997 research outputs found

    On what I do not understand (and have something to say): Part I

    Full text link
    This is a non-standard paper, containing some problems in set theory I have in various degrees been interested in. Sometimes with a discussion on what I have to say; sometimes, of what makes them interesting to me, sometimes the problems are presented with a discussion of how I have tried to solve them, and sometimes with failed tries, anecdote and opinion. So the discussion is quite personal, in other words, egocentric and somewhat accidental. As we discuss many problems, history and side references are erratic, usually kept at a minimum (``see ... '' means: see the references there and possibly the paper itself). The base were lectures in Rutgers Fall'97 and reflect my knowledge then. The other half, concentrating on model theory, will subsequently appear

    Template iterations with non-definable ccc forcing notions

    Full text link
    We present a version with non-definable forcing notions of Shelah's theory of iterated forcing along a template. Our main result, as an application, is that, if κ\kappa is a measurable cardinal and θ<κ<μ<λ\theta<\kappa<\mu<\lambda are uncountable regular cardinals, then there is a ccc poset forcing s=θ<b=μ<a=λ\mathfrak{s}=\theta<\mathfrak{b}=\mu<\mathfrak{a}=\lambda. Another application is to get models with large continuum where the groupwise-density number g\mathfrak{g} assumes an arbitrary regular value.Comment: To appear in the Annals of Pure and Applied Logic, 45 pages, 2 figure

    A family of trees with no uncountable branches

    Get PDF
    We construct a family of 2 ℵ1 trees of size ℵ1 and no uncountable branches that in a certain way codes all ω1sequences of infinite subsets of ω. This coding allows us to conclude that in the presence of the club guessing between ℵ1 and ℵ0, these trees are pairwise very different. In such circumstances we can also conclude that the universality number of the ordered class of trees of size ℵ1 with no uncountable branches under “metric-preserving ” reductions must be at least the continuum. From the topological point of view, the above results show that under the same assumptions there are 2 ℵ1 pairwise non-isometrically embeddable first countable ω1metric spaces with a strong non-ccc property, and that their universality number under isometric embeddings is at least the continuum. Without the non-ccc requirement, a family of 2 ℵ1 pairwise non-isometrically embeddable first countable ω1-metric spaces exists in ZFC by an earlier result of S. Todorčević. The set-theoretic assumptions mentioned above are satisfied in many natural models of set theory (such as the ones obtained after forcing by a ccc forcing over a model of ♦). We use a similar method to discuss trees of size κ with no uncountable branches, for any regular uncountable κ
    corecore