Note on omega-nw-nep forcing notions
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
相关论文
Forcing Square_{omega_1} with finite conditions
We give a forcing construction of the square principle on omega_1 using forcing with conditions whose domain is finite.
math.LO
Can a small forcing create Kurepa trees?
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…
math.LO
Forcing countable networks for spaces satisfying R(X^omega)=omega.
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$.
math.LO
Preserving old ([omega]^{aleph_0},supseteq^*) is proper
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.
math.LO
Sigma-Prikry forcing III: Down to Aleph_omega
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.
math.LO
Non-elementary proper forcing
We introduce a simplified framework for ord-transitive models and Shelah's non elementary proper (nep) theory. We also introduce a new construction for the countable support nep iteration.
math.LO
更多相关论文收起更多论文
Understanding preservation theorems: Chapter VI of Proper and Improper Forcing
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.
math.LO
More forcing notions imply diamond
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} .
math.LO
Combinatorial properties of classical forcing notions
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 …
math.LO
Understanding Preservation Theorems, Chapter VI of Proper and Improper Forcing, I
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.)
math.LO
Preserving Non-Null with Suslin+ forcing
We introduce the notion of effective Axiom A and use it to show that some popular tree forcings are Suslin+. We introduce transitive nep and present a simplified version of Shelah's "preserving a little implies preserving much": If I is a Suslin ccc ideal (e.g. Lebesgue-null or meager) and P is a transitive nep forcing (e.g. P is Suslin+) and P doesn't make any I-positive Borel set small, then P doesn't make any I-positive set small.
math.LO
The distributivity numbers of of P(om) /fin and its square
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.
math.LO
Changing cardinal characteristics without changing omega-sequences or cofinalities
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.
math.LO
Forcing tightness in products of fans
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…
math.LO
Towards Martin's Minimum
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).
math.LO
Understanding preservation theorems: omega-omega bounding and Sacks property
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.
math.LO
Combinatorial properties of Hechler forcing
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…
math.LO
Set mapping reflection
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.
math.LO
The relative consistency of g<cf(Sym(omega))
We prove the consistency result from the title. By forcing we construct a model of g=aleph_1, b=cf(Sym(omega))=aleph_2.
math.LO
引入非平凡的平方_omega
Introducing a nontrivial square_omega
本文定义了非平凡的平方原理□_ω，并通过有限条件的forcing证明其一致性，但后续发现该原理可在ZFC中构造。
math.LO
Explicit example of collapsing kappa^+ in iteration of kappa-proper forcings
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)].
math.LO
Amoeba-absoluteness and projective measurability
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).
math.LO
Combinatorics on Ideals and Axiom A
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.…
math.LO
Sweet & Sour and other flavours of ccc forcing notions
The present paper has three themes. First, we continue the investigations started in Judah, Roslanowski and Shelah \math.LO/9310224 and Roslanowski and Shelah math.LO/9807172, math.LO/9703222, and we investigate the method of norms on possibilities in the context of ccc forcing notions, getting a number of constructions of nicely definable ccc forcings. The second theme of the paper is a part of the general program ``how special are random and Cohen forcing notions (or: the respective ideals)''. Shelah math.LO/9303208 shows that the two forcing notions may occupy special positions in the realm…
math.LO
Preserving Preservation
We present preservation theorems for countable support iteration of nep forcing notions satisfying ``old reals are not Lebesgue null'' and ``old reals are not meager''. (Nep is a generalization of Suslin proper.) We also give some results for general Suslin ccc ideals.
math.LO
Forcing a Boolean Algebra with predesigned automorphism group
For suitable groups G we will show that one can add a Boolean algebra B by forcing in such a way that Aut(B) is almost isomorphic to G. In particular, we will give a positive answer to the following question due to J.Roitman: Is aleph_{omega} a possible number of automorphisms of a rich Boolean algebra?
math.LO
Non-elementary proper forcing notions
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…
math.LO
Borel Complexity and Potential Canonical Scott Sentences
We define and investigate HC-forcing invariant formulas of set theory, whose interpretations in the hereditarily countable sets are well behaved under forcing extensions. This leads naturally to a notion of cardinality ||Phi|| for sentences Phi of $L_{ω_1,ω}$, which counts the number of sentences of $L_{\infty,ω}$ that, in some forcing extension, become a canonical Scott sentence of a model of Phi. We show this cardinal bounds the complexity of (Mod(Phi), iso), the class of models of Phi with universe omega, by proving that (Mod(Phi),iso) is not Borel reducible to (Mod(Psi),iso) whenever ||Psi…
math.LO
Prikry On Extenders, Revisited
We present a modification to the Prikry on Extenders forcing notion allowing the blow up of the power set of a large cardinal, change its cofinality to omega without adding bounded subsets, working directly from arbitrary extender (e.g., n-huge extender). Using this forcing, starting from a superstrong cardinal, we construct a model in which the added Prikry sequences are a scale in the normal Prikry sequence.
math.LO
Localizations of infinite subsets of omega
In the present paper we are interested in properties of forcing notions which measure in a sense the distance between the ground model reals and the reals in the extension. We look at the ways the ``new'' reals can be aproximated by ``old'' reals. We consider localizations for infinite subsets of omega. Though each member of [omega]^omega can be identified with its increasing enumeration, the (standard) localizations of the enumeration does not provide satisfactory information on successive points of the set. They give us ``candidates'' for the n-th point of the set but the same candidates can…
math.LO
Consistency Strengths of Modified Maximality Principles
The Maximality Principle MP is a scheme which states that if a sentence of the language of ZFC is true in some forcing extension V^P, and remains true in any further forcing extension of V^P, then it is true in all forcing extensions of V. A modified maximality principle MP_Gamma arises when considering forcing with a particular class Gamma of forcing notions. A parametrized form of such a principle, MP_Gamma(X), considers formulas taking parameters; to avoid inconsistency such parameters must be restricted to a specific set X which depends on the forcing class Gamma being considered. A strong…
math.LO
Existentially closed II_1 factors
We examine the properties of existentially closed (R^omega-embeddable) II_1 factors. In particular, we use the fact that every automorphism of an existentially closed (R^omega-embeddable) II_1 factor is approximately inner to prove that Th(R) is not model-complete. We also show that Th(R) is complete for both finite and infinite forcing and use the latter result to prove that there exist continuum many nonisomorphic existentially closed models of Th(R).
math.LOmath.OA
Alternative Cichoń Diagrams and Forcing Axioms Compatible with CH
This dissertation surveys several topics in the general areas of iterated forcing, infinite combinatorics and set theory of the reals. There are two parts. In the first half I consider alternative versions of the Cichoń diagram. First I show that for a wide variety of reduction concepts there is a Cichoń diagram for effective cardinal characteristics relativized to that reduction. As an application I investigate in detail the Cichoń diagram for degrees of constructibility relative to a fixed inner model of ZFC. Then I study generalizations of cardinal characteristics to the space of functions …
math.LO
