Models with second order properties. III. Omitting types for L(Q).
Large continuum, oracles
Our main theorem is about iterated forcing for making the continuum larger than ℵ2. We present a generalization of [2] which deal with oracles for random, (also for other cases and generalities), by replacing ℵ1,ℵ2 by λ, λ + (starting with λ = λ <λ > ℵ1). Well, we demand absolute c.c.c. So we get, e.g. the continuum is λ + but we can get cov(meagre) = λ and we give some applications. As in non-Cohen oracles [2], it is a “partial” countable support iteration but it is c.c.c.
On full Suslin trees
On Monk’s questions
We deal with Boolean algebras and their cardinal functions: π-weight π and π-character πχ. We investigate the spectrum of π-weights of subalgebras of a Boolean algebra B. Next we show that the π-character of an ultraproduct of Boolean algebras may be different from the ultraproduct of the π-characters of the factors.
Borel sets with large squares
For a cardinal μ we give a sufficient condition (involving ranks measuring existence of independent sets) for: if a Borel set B ⊆ ℝ × ℝ contains a μ-square (i.e. a set of the form A × A with |A| =μ) then it contains a -square and even a perfect square, and also for if has a model of cardinality μ then it has a model of cardinality continuum generated in a “nice”, “absolute” way. Assuming for transparency, those three conditions (, and ) are equivalent, and from this we deduce that...
σ-Entangled linear orders and narrowness of products of Boolean algebras
We investigate σ-entangled linear orders and narrowness of Boolean algebras. We show existence of σ-entangled linear orders in many cardinals, and we build Boolean algebras with neither large chains nor large pies. We study the behavior of these notions in ultraproducts.
A polarized partition relation and failure of GCH at singular strong limit
The main result is that for λ strong limit singular failing the continuum hypothesis (i.e. ), a polarized partition theorem holds.
Embedding Cohen algebras using pcf theory
Using a theorem from pcf theory, we show that for any singular cardinal ν, the product of the Cohen forcing notions on κ, κ < ν, adds a generic for the Cohen forcing notion on .
Covering of the null ideal may have countable cofinality
We prove that it is consistent that the covering number of the ideal of measure zero sets has countable cofinality.
On a problem of Steve Kalikow
The Kalikow problem for a pair (λ,κ) of cardinal numbers,λ > κ (in particular κ = 2) is whether we can map the family of ω-sequences from λ to the family of ω-sequences from κ in a very continuous manner. Namely, we demand that for η,ν ∈ ω we have: η, ν are almost equal if and only if their images are. We show consistency of the negative answer, e.g., for but we prove it for smaller cardinals. We indicate a close connection with the free subset property and its variants.
Strong covering without squares
Let W be an inner model of ZFC. Let κ be a cardinal in V. We say that κ-covering holds between V and W iff for all X ∈ V with X ⊆ ON and V ⊨ |X| < κ, there exists Y ∈ W such that X ⊆ Y ⊆ ON and V ⊨ |Y| < κ. Strong κ-covering holds between V and W iff for every structure M ∈ V for some countable first-order language whose underlying set is some ordinal λ, and every X ∈ V with X ⊆ λ and V ⊨ |X| < κ, there is Y ∈ W such that X ⊆ Y ≺ M and V ⊨ |Y| < κ. We prove that if κ is V-regular,...
Cellularity of free products of Boolean algebras (or topologies)
The aim this paper is to present an answer to Problem 1 of Monk [10], [11]. We do this by proving in particular that if μ is a strong limit singular cardinal, and then there are Boolean algebras such that . Further we improve this result, deal with the method and the necessity of the assumptions. In particular we prove that if is a ccc Boolean algebra and then satisfies the λ-Knaster condition (using the “revised GCH theorem”).
On what I do not understand (and have something to say): Part I
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, anecdotes and opinions. So the discussion is quite personal, in other words, egocentric and somewhat accidental. As we discuss many problems, history and side references...
When a first order T has limit models
We sort out to a large extent when a (first order complete theory) T has a superlimit model in a cardinal λ. Also we deal with related notions of being limit.
The spectrum of characters of ultrafilters on ω
We show the consistency of the statement: "the set of regular cardinals which are the characters of ultrafilters on ω is not convex". We also deal with the set of π-characters of ultrafilters on ω.
Reflection implies the SCH
We prove that, e.g., if μ > cf(μ) = ℵ₀ and and every stationary family of countable subsets of μ⁺ reflects in some subset of μ⁺ of cardinality ℵ₁, then the SCH for μ⁺ holds (moreover, for μ⁺, any scale for μ⁺ has a bad stationary set of cofinality ℵ₁). This answers a question of Foreman and Todorčević who get such a conclusion from the simultaneous reflection of four stationary sets.
Interpreting set theory in the endomorphism semi-group of a free algebra or in a category
Categoricity of theories in , when κ* is a measurable cardinal. Part 2
We continue the work of [2] and prove that for λ successor, a λ-categorical theory T in is μ-categorical for every μ ≤ λ which is above the -beth cardinal.
Zero-one laws for graphs with edge probabilities decaying with distance. Part II
Let Gₙ be the random graph on [n] = 1,...,n with the probability of i,j being an edge decaying as a power of the distance, specifically the probability being , where the constant α ∈ (0,1) is irrational. We analyze this theory using an appropriate weight function on a pair (A,B) of graphs and using an equivalence relation on B∖A. We then investigate the model theory of this theory, including a “finite compactness”. Lastly, as a consequence, we prove that the zero-one law (for first order logic)...
The combinatorics of reasonable ultrafilters
We are interested in generalizing part of the theory of ultrafilters on ω to larger cardinals. Here we set the scene for further investigations introducing properties of ultrafilters in strong sense dual to being normal.
Page 1 Next