We introduce a property of forcing notions, called the anti-, which comes from Aronszajn trees. This property canonically defines a new chain condition stronger than the countable chain condition, which is called the property . In this paper, we investigate the property . For example, we show that a forcing notion with the property does not add random reals. We prove that it is consistent that every forcing notion with the property has precaliber 1 and for forcing notions with the (...) property fails. This negatively answers a part of one of the classical problems about implications between fragments of. (shrink)

We give an overview of a research line concentrated on finding to which extent compactness fails at the level of first uncountable cardinal and to which extent it could be recovered on some other perhaps not so large cardinal. While this is of great interest to set theorists, one of the main motivations behind this line of research is in its applicability to other areas of mathematics. We give some details about this and we expose some possible directions for further (...) research. (shrink)

It is shown to be consistent that the reals are covered by ℵ1 meagre sets yet there is a Baire class 1 function which cannot be covered by fewer than ℵ2 continuous functions. A new cardinal invariant is introduced which corresponds to the least number of continuous functions required to cover a given function. This is characterized combinatorially. A forcing notion similar to, but not equivalent to, superperfect forcing is introduced.

Various questions posed by P. Nyikos concerning ultrafilters on ω and chains in the partial order (ω, <*) are answered. The main tool is the oracle chain condition and variations of it.

The history of productivity of the κ-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every regular cardinal κ > א1, the principle □ is equivalent to the existence of a certain strong coloring c : [κ]2 → κ for which the family of fibers T is a nonspecial κ-Aronszajn tree. The theorem follows from an analysis of (...) a new characteristic function for walks on ordinals, and implies in particular that if the κ-chain condition is productive for a given regular cardinal κ > א1, then κ is weakly compact in some inner model of ZFC. This provides a partial converse to the fact that if κ is a weakly compact cardinal, then the κ-chain condition is productive. (shrink)

It is consistent that for every function there is an uncountable set and two continuous functions such that f {f0, f1} for every A2,α≠β.

In the first half of this paper, we study the way that sets of real numbers closed under Turing equivalence sit inside the real line from the perspective of algebra, measure and orders. Afterwards, we combine the results from our study of these sets as orders with a classical construction from Avraham to obtain a restriction about how non trivial automorphism of the Turing degrees (if they exist) interact with 1-generic degrees.

The purpose of this article is to prove the relative consistency of certain statements about open colorings with 2ℵ0 < 2ℵ1. In particular both OCA and the statement that every 1–1 function of size ℵ1 is σ-monotonic are consistent with 2ℵ0 < 2ℵ1. As a corollary we have that 2ℵ0 < 2ℵ1 does not admit a ℙ max variation.

In this paper I will communicate some new consequences of the Proper Forcing Axiom. First, the Bounded Proper Forcing Axiom implies that there is a well ordering of R which is Σ 1 -definable in (H(ω 2 ), ∈). Second, the Proper Forcing Axiom implies that the class of uncountable linear orders has a five element basis. The elements are X, ω 1 , ω 1 * , C, C * where X is any suborder of the reals of size (...) ω 1 and C is any Countryman line. Third, the Proper Forcing Axiom implies the Singular Cardinals Hypothesis at κ unless stationary subsets of S κ + ω reflect. The techniques are expected to be applicable to other open problems concerning the theory of H(ω 2 ). (shrink)

In this paper we will analyze Baumgartner’s problem asking whether it is consistent that \ and every pair of \-dense subsets of \ are isomorphic as linear orders. The main result is the isolation of a combinatorial principle \\) which is immune to c.c.c. forcing and which in the presence of \ implies that two \-dense sets of reals can be forced to be isomorphic via a c.c.c. poset. Also, it will be shown that it is relatively consistent with ZFC (...) that there exists an \ dense suborder X of \ which cannot be embedded into \ in any outer model with the same \. (shrink)

We prove rigidity results for large classes of corona algebras, assuming the Proper Forcing Axiom. In particular, we prove that a conjecture of Coskey and Farah holds for all separable [Formula: see text]-algebras with the metric approximation property and an increasing approximate identity of projections.

We prove rigidity results for large classes of corona algebras, assuming the Proper Forcing Axiom. In particular, we prove that a conjecture of Coskey and Farah holds for all separable [Formula: see text]-algebras with the metric approximation property and an increasing approximate identity of projections.

James Earl Baumgartner (March 23, 1943–December 28, 2011) came of age mathematically during the emergence of forcing as a fundamental technique of set theory, and his seminal research changed the way set theory is done. He made fundamental contributions to the development of forcing, to our understanding of uncountable orders, to the partition calculus, and to large cardinals and their ideals. He promulgated the use of logic such as absoluteness and elementary submodels to solve problems in set theory, he applied (...) his knowledge of set theory to a variety of areas in collaboration with other mathematicians, and he encouraged a community of mathematicians with engaging survey talks, enthusiastic discussions of open problems, and friendly mathematical conversations. (shrink)

Keywords: Elementary Submodel; Real Line; Order-Isomorphic.

In this paper we study the question assuming MA+⌝CH does Sacks forcing or Laver forcing collapse cardinals? We show that this question is equivalent to the question of what is the additivity of Marczewski's ideals 0. We give a proof that it is consistent that Sacks forcing collapses cardinals. On the other hand we show that Laver forcing does not collapse cardinals.

Assuming Martin's Axiom, we compute the value of the cofinality of the symmetric group on the natural numbers. We also show that Martin's Axiom does not decide the value of the covering number of a related Mycielski ideal.

Relative results concerning the Banach space l ∞ / c 0 are presented. We show that some basic properties of the Banach space l ∞ / c 0 implied by CH and OCA are different.

We show that the Abraham–Rubin–Shelah Open Coloring Axiom is consistent with a large continuum, in particular, consistent with [Formula: see text]. This answers one of the main open questions from [U. Abraham, M. Rubin and S. Shelah, On the consistency of some partition theorems for continuous colorings, and the structure of [Formula: see text]-dense real order types, Ann. Pure Appl. Logic 325(29) (1985) 123–206]. As in [U. Abraham, M. Rubin and S. Shelah, On the consistency of some partition theorems for (...) continuous colorings, and the structure of [Formula: see text]-dense real order types, Ann. Pure Appl. Logic 325(29) (1985) 123–206], we need to construct names for the so-called preassignments of colors in order to add the necessary homogeneous sets. However, the known constructions of preassignments (ours in particular) only work assuming the [Formula: see text]. In order to address this difficulty, we show how to construct such names with very strong symmetry conditions. This symmetry allows us to combine them in many different ways, using a new type of poset called a partition product. Partition products may be thought of as a restricted memory iteration with stringent isomorphism and coherent-overlap conditions on the memories. We finally construct, in [Formula: see text], the partition product which gives us a model of [Formula: see text] in which [Formula: see text]. (shrink)

We say that a coloring ${c: [\kappa]^n\to 2}$ is continuous if it is continuous with respect to some second countable topology on κ. A coloring c is potentially continuous if it is continuous in some ${\aleph_1}$ -preserving extension of the set-theoretic universe. Given an arbitrary coloring ${c:[\kappa]^n\to 2}$ , we define a forcing notion ${\mathbb P_c}$ that forces c to be continuous. However, this forcing might collapse cardinals. It turns out that ${\mathbb P_c}$ is c.c.c. if and only if c (...) is potentially continuous. This gives a combinatorial characterization of potential continuity. On the other hand, we show that adding ${\aleph_1}$ Cohen reals to any model of set theory introduces a coloring ${c:[\aleph_1]^2 \to 2}$ which is potentially continuous but not continuous. ${\aleph_1}$ has no uncountable c-homogeneous subset in the Cohen extension, but such a set can be introduced by forcing. The potential continuity of c can be destroyed by some c.c.c. forcing. (shrink)

We investigate the Ramsey theory of continuous graph-structures on complete, separable metric spaces and apply the results to the problem of covering a plane by functions. Let the homogeneity number[Formula: see text] of a pair-coloring c:[X]2→2 be the number of c-homogeneous subsets of X needed to cover X. We isolate two continuous pair-colorings on the Cantor space 2ω, c min and c max, which satisfy [Formula: see text] and prove: Theorem. For every Polish space X and every continuous pair-coloringc:[X]2→2with[Formula: see (...) text], [Formula: see text] There is a model of set theory in which[Formula: see text]and[Formula: see text]. The consistency of [Formula: see text] and of [Formula: see text] follows from [20]. We prove that [Formula: see text] is equal to the covering number of 2 by graphs of Lipschitz functions and their reflections on the diagonal. An iteration of an optimal forcing notion associated to c min gives: Theorem. There is a model of set theory in which ℝ2 is coverable byℵ1graphs and reflections of graphs of continuous real functions; ℝ2 is not coverable byℵ1graphs and reflections of graphs of Lipschitz real functions. Figure 1.1 in the introduction summarizes the ZFC results in Part I of the paper. The independence results in Part II show that any two rows in Fig. 1.1 can be separated if one excludes [Formula: see text] from row. (shrink)

We discuss a dual of the Open Coloring Axiom introduced by Abraham et al. [U. Abraham, M. Rubin, S. Shelah, On the consistency of some partition theorems for continuous colorings, and the structure of 1-dense real order types, Ann. Pure Appl. Logic 29 123–206] and show that it follows from a statement about continuous colorings on Polish spaces that is known to be consistent. We mention some consequences of the new axiom and show that implies that all cardinal invariants in (...) Cichoń’s diagram are at least 2. (shrink)

Partitioner algebras are defined by Baumgartner and Weese 619) as a natural tool for studying the properties of maximal almost disjoint families of subsets of ω. We prove from PFA+ and that there exists a partitioner algebra which contains a subalgebra which is not representable as a partitioner algebra.

We consider various versions of the ♣ principle. This principle is a known consequence of $\lozenge$ . It is well known that $\lozenge$ is not sensitive to minor changes in its definition, e.g., changing the guessing requirement form "guessing exactly" to "guessing modulo a finite set". We show however, that this is not true for ♣. We consider some other variants of ♣ as well.

By B2 we denote the σ-ideal of all subsets A of the Cantor set {0,1}ω such that for every infinite subset T of ω the restriction A∣{0,1}T is a proper subset of {0,1}T. In this paper we investigate set theoretical properties of this and similar ideals.

We strengthen a result of Harrington and Shelah by showing that, unless ω1 is an inaccessible cardinal in L, a relatively weak fragment of Martin's axiom implies that there exists a δ13 set of reals without the property of Baire.

We show that bounded forcing axioms are consistent with the existence of -gaps and thus do not imply the Open Coloring Axiom. They are also consistent with Jensen's combinatorial principles for L at the level ω2, and therefore with the existence of an ω2-Suslin tree. We also show that the axiom we call BMM3 implies 21=2, as well as a stationary reflection principle which has many of the consequences of Martin's Maximum for objects of size 2. Finally, we give an (...) example of a so-called boldface bounded forcing axiom implying 20=2. (shrink)