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 $ν^+$.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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.
3
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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, $κ^+_V = κ^+_W$, and we have both κ-covering and $κ^+$-covering between W and V, then strong κ-covering holds. Next we show that we can drop the assumption of $κ^+$-covering at the expense of assuming some more absoluteness of cardinals and cofinalities between W and V, and that we can drop the assumption that $κ^+_W = κ^+_V$ and weaken the $κ^+$-covering assumption at the expense of assuming some structural facts about W (the existence of certain square sequences).
5
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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.
6
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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.
7
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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, $θ = (2^{cf(μ)})^+$ and $2^μ = μ^+$ then there are Boolean algebras $\mathbb{B}_1,\mathbb{B}_2$ such that $c(\mathbb{B}_1) = μ, c(\mathbb{B}_2) < θ but c(\mathbb{B}_1*\mathbb{B}_2)=μ^+$. Further we improve this result, deal with the method and the necessity of the assumptions. In particular we prove that if $\mathbb{B}$ is a ccc Boolean algebra and $μ^{ℶ_ω} ≤ λ = cf(λ) ≤ 2^μ$ then $\mathbb{B}$ satisfies the λ-Knaster condition (using the "revised GCH theorem").
8
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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 ω.
9
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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 $p_{|i-j|} = 1/|i-j|^{α}$, 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) holds.
11
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We continue the work of [2] and prove that for λ successor, a λ-categorical theory T in $L_{κ*,ω}$ is μ-categorical for every μ ≤ λ which is above the $(2^{LS(T)})⁺$-beth cardinal.
12
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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 $2^{ℵ_0}$-square and even a perfect square, and also for $⊗'_μ$ if $ψ ∈ L_{ω_1, ω}$ has a model of cardinality μ then it has a model of cardinality continuum generated in a "nice", "absolute" way. Assuming $MA + 2^{ℵ_0} > μ$ for transparency, those three conditions ($⊕_μ$, $⊗_μ$ and $⊗'_μ$) are equivalent, and from this we deduce that e.g. $∧_{α < ω_1}[ 2^{ℵ_0}≥ ℵ_α ⇒ ¬ ⊗_{ℵ_α}]$, and also that $min{μ: ⊗_μ}$, if $ < 2^{ℵ_0}$, has cofinality $ℵ_1$. We also deal with Borel rectangles and related model-theoretic problems.
13
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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.
14
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Our main result is that possibly some non-null set of reals cannot be divided into uncountably many non-null sets. We also deal with a non-null set of real, the graph of any function from which is null, and deal with our iterations somewhat more generally.
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.
16
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Let Gₙ be the random graph on [n] = {1,...,n} with the possible edge {i,j} having probability $p_{|i-j|} = 1/|i-j|^α$ for j ≠ i, i+1, i-1 with α ∈ (0,1) irrational. We prove that the zero-one law (for first order logic) holds..
18
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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 are erratic, usually kept to 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, [122], concentrating on model theory, will subsequently appear. I thank Andreas Blass and Andrzej Rosłanowski for many helpful comments.
19
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
We prove that, e.g., if μ > cf(μ) = ℵ₀ and $μ > 2^{ℵ₀}$ 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.
20
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
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.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.