We show that all finite powers of a Hausdorff space X do not contain uncountable weakly separated subspaces iff there is a c.c.c poset P such that 1_P forces that ``X is a countable union of 0-dimensional subspaces of countable weight.''
We also show that this theorem is sharp in two different senses:
(i) we can't get rid of using generic extensions,
(ii) we have to consider all finite powers of $X$.
We prove that if Q is a nw-nep forcing then it cannot add a dominating real. We also prove that Amoeba forcing cannot be P(X)/I if I is an aleph_1-complete ideal.
We show that many countable support iterations of proper forcings preserve Souslin trees. We establish sufficient conditions in terms of games and we draw connections to other preservation properties. We present a proof of preservation properties in countable support interations in the so-called Case A that does not need a division into forcings that add reals and those who do not.
The preservation theorems for semi-properness, hemi-properness, and pseudo-completeness hold for countable support iterations as well as revised countable support iterations, notwithstanding the fact that the "factor lemma" fails for the countable support versions. Example: The countable support iteration of Namba forcing over a ground model of CH does not add reals. Example: A countable support iteration built from Namba forcing and Cohen forcing, over a ground model of CH, does not collapse omega_1
In the paper we probe the possibilities of creating a Kurepa tree in a generic extension of a model of CH plus no Kurepa trees by an omega_1-preserving forcing notion of size at most omega_1. In the first section we show that in the Levy model obtained by collapsing all cardinals between omega_1 and a strongly inaccessible cardinal by forcing with a countable support Levy collapsing order many omega_1-preserving forcing notions of size at most omega_1 including all omega-proper forcing notions and some proper but not omega-proper forcing notions of size at most omega_1 do not create Kurepa tre…
We analyze the forcing notion $\mathcal P$ of finite matrices whose rows consists of isomorphic countable elementary submodels of a given structure of the form $H_θ$. We show that forcing with this poset adds a Kurepa tree $T$. Moreover, if $\mathcal P_c$ is a suborder of $\mathcal P$ containing only continuous matrices, then the Kurepa tree $T$ is almost Souslin, i.e. the level set of any antichain in $T$ is not stationary in $ω_1$.
We give some sufficient and necessary conditions on a forcing notion Q for preserving the forcing notion ([omega]^{aleph_0},supseteq^*) is proper. They cover many reasonable forcing notions.
We prove the consistency of the failure of the singular cardinals hypothesis at $\aleph_ω$ together with the reflection of all stationary subsets of $\aleph_{ω+1}$. This shows that two classic results of Magidor (from 1977 and 1982) can hold simultaneously.
In his PhD Thesis Konstantinos Beros proved a number of results about compactly generated subgroups of Polish groups. Such a group is K-sigma - the countable union of compact sets. He notes that the group of rationals under addition with the discrete topology is an example of a Polish group which is K-sigma (since it is countable) but not compactly generated. Beros showed that for any Polish group G, every K-sigma subgroup of G is compactly generated iff every countable subgroup of G is compactly generated. Beros showed that any K-sigma subgroup of Z^omega (infinite product of the integers) is…
A topological monoid is isomorphic to an endomorphism monoid of a countable structure if and only if it is separable and has a compatible complete ultrametric such that composition from the left is non-expansive. We also give a topological characterisation of those topological monoids that are isomorphic to endomorphism monoids of countable omega-categorical structures. Finally we present analogous characterisations for polymorphism clones of countable structures and for polymorphism clones of countable omega-categorical structures.
Let αbe a countable ordinal and ¶(α) the collection of its subsets isomorphic to α. We show that the separative quotient of the set ¶(α) ordered by the inclusion is isomorphic to a forcing product of iterated reduced products of Boolean algebras of the form P(ω^γ)/I(ω^γ), where γis a limit ordinal or 1 and I(ω^γ) the corresponding ordinal ideal. Moreover, the poset ¶(α) is forcing equivalent to a two-step iteration P(ω)/Fin * π, where πis an ω_1-closed separative pre-order in each extension by P(ω)/Fin and, if the distributivity number is equal toω_1, to P(ω)/Fin. Also we analyze the quotients…
This expository paper covers the first two sections of chapter VI of Shelah's book "Proper and Improper Forcing," including the preservationn (using CS iterations of proper forcings) of omega-omega bounding, Sacks property, Lavewr property, P-point property, and others.
Suppose that $P$ is a forcing notion, $L$ is a language (in $V$), $\dotτ$ a $P$-name such that $P\Vdash$ "$\dotτ$ is a countable $L$-structure". In the product $P\times P$, there are names $\dot{τ_{1}},\dot{τ_{2}}$ such that for any generic filter $G=G_{1}\times G_{2}$ over $P\times P$, $\dotτ_{1}[G]=\dotτ[G_{1}]$ and $\dotτ_{2}[G]=\dotτ[G_{2}]$. Zapletal asked whether or not $P \times P \Vdash \dotτ_{1}\cong\dotτ_{2}$ implies that there is some $M\in V$ such that $P \Vdash \dotτ\cong\check{M}$. We answer this negatively and discuss related issues.
We prove that the Sacks forcing collapses the continuum onto the dominating number d, answering the question of Carlson and Laver. Next we prove that if a proper forcing of the size at most continuum collapses omega_2 then it forces diamond_{omega_1} .
We discuss the effect of adding a single real (for various forcing notions adding reals) on cardinal invariants associated with the continuum (like the unbounding or the dominating number or the cardinals related to measure and category on the real line). For random and Cohen forcing, this question was investigated by Cicho'n and Pawlikowski; for Hechler forcing, by Judah, Shelah and myself. We show here: (1) adding an eventually different or a localization real adjoins a Luzin set of size continuum and a mad family of size omega_1; (2) Laver and Mathias forcing collapse the dominating number …
This is an exposition of the first two sections of Chapter VI of Shelah's book Proper and Improper Forcing. It covers various preservation theorems for CS iteration of proper forcing (omega-omega bounding, Sacks property, P-point property, etc.)
Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add reals.
We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply the nonexistence of Borel complete sections with certain features.
We show that in a model obtained by forcing with a countable support iteration of length omega_2 of Mathias forcing h(2), the distributivity number of r.o.(P(omega)/fin)^2, is omega_1 but h, the one of P(omega)/fin, is omega_2.
We show: There are pairs of universes V_1 subseteq V_2 and there is a notion of forcing P in V_1 such that the change mentioned in the title occurs when going from V_1[G] to V_2[G] for a P-generic filter G over V_2. We use forcing iterations with partial memories. Moreover, we implement highly transitive automorphism groups into the forcing orders.
The theta--fan F_theta is the quotient space obtained by identifying the non--isolated points of the product theta \times (omega+1) with a single point \infty. (Here, theta has the discrete topology and omega+1 has the order topology.) We define several notions of forcing that allow us to manipulate the tightness t of products of fans. Some consequences include: t (F_theta \times F_omega) = theta does not imply the existence of a (theta,omega)--gap, new examples of first countable <theta--collectionwise Hausdorff (cwH) spaces that are not \leq theta--cwH for singular cardinals theta, and for c…
We describe a proof-theoretic bound on $Sigma_{2}$-definable countable ordinals in Kripke-Platek set theory with $Pi_{1}$-Collection and the existence of $omega_{1}$.
We show that it is not provable in ZFC that any two countable elementarily equivalent structures have isomorphic ultrapowers relative to some ultrafilter on omega .
We show that it is consistent with MA + the negation of CH, that the Forcing Axiom fails for all forcing notions in the class of omega^omega-bounding forcing notions with norms of "Norms on possibilities I: forcing with trees and creatures"(by Roslanowski and Shelah - math.LO/9807172).
We present a general framework for forcing on $ω_2$ with finite conditions using countable models as side conditions. This framework is based on a method of comparing countable models as being membership related up to a large initial segment. We give several examples of this type of forcing, including adding a function on $ω_2$, adding a nonreflecting stationary subset of $ω_2 \cap \textrm{cof}(ω)$, and adding an $ω_1$-Kurepa tree.
This is an expository paper for Chapter 6 of Proper and Improper Forcing. Now includes an exposition of Shelah's proof of preservation of Sacks property as well as omega-omega bounding.
A space X is called an alpha-Toronto space if X is scattered of Cantor-Bendixson rank alpha and is homeomorphic to each of its subspaces of same rank. We answer a question of Steprans by constructing a countable alpha-Toronto space for each alpha<=omega. We also construct consistent examples of countable alpha-Toronto spaces for each alpha<omega_1.
Whenever P is a proper definable forcing for adding a real, the countable support iteration of P has all the preservation properties it can possibly have, within a wide syntactically identified class of properties.
In this work we use a notion of rank first introduced by James Baumgartner and Peter Dordal and later developed independently by the third author to show that adding a Hechler real has strong combinatorial consequences. We prove: 1) assuming omega_1^V = omega_1^L, there is no real in V[d] which is eventually different from the reals in L[d], where d is Hechler over V; 2) adding one Hechler real makes the invariants on the left-hand side of Cicho'n's diagram equal omega_1 and those on the right-hand side equal 2^omega and produces a maximal almost disjoint family of subsets of omega of size ome…
In this note we will discuss a new reflection principle which follows from the Proper Forcing Axiom. The immediate purpose will be to prove that the bounded form of the Proper Forcing Axiom implies both that 2^omega = omega_2 and that L(P(omega_1)) satisfies the Axiom of Choice. It will also be demonstrated that this reflection principle implies that combinatorial principle Square(kappa) fails for all regular kappa > omega_1.
Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize indestructibility of the Lindelof property under countably closed forcing. We consider the behavior of countable tightness in generic extensions obtained by adding Cohen reals. We show that certain classes of well-studied topological spaces are indestructibly countably tight. Stronger versions of countable tightness, including selective versions of separability, are…
We show that square(theta) implies that there is a first countable <theta-collectionwise Hausdorff space that is not weakly theta-collectionwise Hausdorff. We also show that in the model obtained by Levy collapsing a weakly compact (supercompact) cardinal to omega_2, first countable aleph_1-collectionwise Hausdorff spaces are weakly aleph_2-collectionwise Hausdorff (weakly collectionwise Hausdorff). In the last section we show that assuming E^omega_theta, a certain theta-family of integer valued functions exists and that in the model obtained by Levy collapsing a supercompact cardinal to omega…
In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the complexity of uncountable structures; we establish basic properties of this reducibility, and study it in the context of {\em generic presentability}, the existence of a copy of the structure in every extension by a given forcing. We show that every forcing notion making $ω_2$ countable generically presents some countable structure with no copy in the ground …
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is classifiable if it is superstable and does not have either the dimensional order property or the omitting types order property. Shelah [Sh:c] showed that if a theory T is classifiable then each model of cardinality lambda is described by a sentence of L_{infty, lambda}. In fact this sentence can be chosen in the L^*_{lambda}. (L^*_{lambda} is the result of …
In this work we study the uncountable Borel chromatic numbers, defined by Geschke (2011) as cardinal characteristics of the continuum, of low complexity graphs. We show that a strong form of locally countable graphs with compact totally disconnected set of vertices have Borel chromatic number bounded by the continuum of the ground model in the model obtained by adding $\aleph_2$ Laver reals. From this, we answer a question from Geschke and the second author (2022), and another question from Fisher, Friedman and Khomskii (2014) concerning regularity properties of subsets of the real line.
Forcing over choiceless models and generic absoluteness
Institute of logic and cognition, department of philosophy, Sun Yat-sen University（中山大学哲学系逻辑与认知研究所）；Dipartimento di ingegneria dell’informazione e scienze matematiche, Università di Siena（锡耶纳大学信息与数学工程系）
We show that the ordering of the Hanf number of L_{omega, omega}(wo) (well ordering), L^c_{omega, omega} (quantification on countable sets), L_{omega, omega}(aa) (stationary logic) and second order logic, have no more restraints provable in ZFC than previously known (those independence proofs assume CON(ZFC) only). We also get results on corresponding logics for L_{lambda, mu} .
We give an example of iteration of length omega of (<kappa)-complete kappa^+-cc forcing notions with the limit collapsing kappa^+. The construction is decoded from the proof of Shelah [Proper and Improper Forcing, Appendix, Theorem 3.6(1)].
We present reasons for developing a theory of forcing notions which satisfy the properness demand for countable models which are not necessarily elementary submodels of some (H(chi), in). This leads to forcing notions which are ``reasonably'' definable. We present two specific properties materializing this intuition: nep (non-elementary properness) and snep (Souslin non-elementary properness). For this we consider candidates (countable models to which the definition applies), and the older Souslin proper. A major theme here is ``preservation by iteration'', but we also show a dichotomy: if suc…
We study the relationship between Amoeba forcing (the partial order which generically adds a measure one set of random reals) and projective measurability. Given a universe V of set theory and a forcing notion P in V we say that V is Sigma^1_n - P - absolute iff for every Sigma^1_n-sentence phi with parameters in V we have V models phi iff V^P models phi. We show that Sigma^1_4-Amoeba-absoluteness implies that forall a in omega^omega (omega_1^{L[a]} < omega_1^V), and hence Sigma^1_3-measurability. This answers a question of Haim Judah (private communication).
I prove several theorems concerning upward closure and amalgamation in the generic multiverse of a countable transitive model of set theory. Every such model $W$ has forcing extensions $W[c]$ and $W[d]$ by adding a Cohen real, which cannot be amalgamated in any further extension, but some nontrivial forcing notions have all their extensions amalgamable. An increasing chain $W[G_0]\subseteq W[G_1]\subseteq\cdots$ has an upper bound $W[H]$ if and only if the forcing had uniformly bounded essential size in $W$. Every chain $W\subseteq W[c_0]\subseteq W[c_1]\subseteq\cdots$ of extensions adding Co…
Forcing in bounded arithmetic and set theory: analogies and differences
Charles University, Faculty of Arts（查理大学文学院）；University of Warwick, Department of Computer Science（华威大学计算机科学系）；Charles University, Faculty of Mathematics and Physics（查理大学数学物理学院）
Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend to be of little use, for various reasons, and in this short note we study a number of conditions which in ZFC are equivalent to the countable chain condition.
We deal with an iteration theorem of forcing notion with a kind of countable support of nice enough forcing notion which is proper aleph_2-c.c. forcing notions. We then look at some special cases (Q_D 's preceded by random forcing).
A topological space is called P_2 ( P_3, P_{<omega} ) if and only if it does not contain two (three, finitely many) uncountable open sets with empty intersection. We show that (i) there are 0-dimensional P_{<omega} spaces of size 2^omega, (ii) there are compact P_{<omega} spaces of size omega_1, (iii) the existence of a Psi-like examples for a compact P_{<omega} space of size omega_1 is independent of ZFC, (iv) it is consistent that 2^omega is as large as you wish but every first countable (and so every compact) P_2 space has cardinality<=omega_1.
We introduce a class of notions of forcing which we call $Σ$-Prikry, and show that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are $Σ$-Prikry. We show that given a $Σ$-Prikry poset $\mathbb P$ and a name for a non-reflecting stationary set $T$, there exists a corresponding $Σ$-Prikry poset that projects to $\mathbb P$ and kills the stationarity of $T$. Then, in a sequel to this paper, we develop an iteration scheme for $Σ$-Prikry posets. Putting the two works together, we obtain a proof of the following. Theorem. If $κ$ is the…
Throughout this abstract let U be a fixed p-point ultrafilter and let I be the dual ideal. Grigorieff forcing is P(U)={p:omega to 2|dom(p) is an element of I} ordered by reverse inclusion. It is well known that Grigorieff forcing is proper. The main result of this paper is the following: THEOREM: Gregorieff forcing does not satisfy Axiom A. To prove this we use the following game, denoted G(U), for two players playing alternatively: Player I plays a partition of omega, {J_n| n<omega}, such that for all n<omega, J_n is an element of I; At the nth turn Player II plays a finite subset F_n of J_n.…
We formulate several conditions (two of them are necessary and sufficient) which imply that a space of small character has large weight. In section 3 we construct a ZFC example of a first countable 0-dimensional space X of size 2^omega with w(X)=2^omega and nw(X)=omega, we show that CH implies the existence of a 0-dimensional space Y of size omega_1 with w(Y)=nw(Y)=omega_1 and chi(Y)=R(Y)=omega, and we prove that it is consistent that 2^omega is as large as you wish and there is a 0-dimensional space Z of size 2^omega such that w(Z)=nw(Z)=2^omega but chi(Z)=R(Z^omega)=omega.
Let s(A) denote the number of automorphisms of a model A of power omega_1. We derive a necessary and sufficient condition in terms of trees for the existence of an A with omega_1 < s(A) < 2^{omega_1}. We study the sufficiency of some conditions for s(A)=2^{omega_1}. These conditions are analogous to conditions studied by D.Kueker in connection with countable models.
We make use of a finite support product of Jensen forcing to define a model in which there is a countable non-empty lightface $Π^1_2$ set of reals containing no ordinal-definable real.
