相关论文: Was Sierpinski right? III Can continuum--c.c. time…

We prove the consistency of ``CH + 2^{aleph_1} is arbitrarily large + 2^{aleph_1} not-> (omega_1 x omega)^2_2''. If fact, we can get 2^{aleph_1} not-> [omega_1 x omega]^2_{aleph_0}. In addition to this theorem, we give generalizations to…

Under the assumption that the continuum c is a regular cardinal, we prove the existence and uniqueness of a Boolean algebra B of size c defined by sharing the main structural properties that P(N)/fin has under CH and in the aleph2-Cohen…

We prove the consistency result from the title. By forcing we construct a model of g=aleph_1, b=cf(Sym(omega))=aleph_2.

We prove that colouring of pairs from aleph_2 with strong properties exists. The easiest to state (and quite a well known problem) it solves: there are two topological spaces with cellularity aleph_1 whose product has cellularity aleph_2 ;…

We prove that Arhangelskii's problem has a consistent positive answer: if V\models CH, then for some aleph_1-complete aleph_2-c.c. forcing notion P of cardinality aleph_2 we have that P forces ``CH and there is a Lindelof regular…

Our main theorem is about iterated forcing for making the continuum larger than aleph_2. We present a generalization of math.LO/0303294 which is dealing with oracles for random, etc., replacing aleph_1, aleph_2 by lambda,lambda^+ (starting…

The noise-type completion C of a noise-type Boolean algebra B is generally not the same as the closure of B. As shown in Part I (Introduction, Theorem 2), C consists of all complemented elements of the closure. It appears that C is the…

We address several questions of Donald Monk related to irredundance and spread of Boolean algebras, gaining both some ZFC knowledge and consistency results. We show in ZFC that irr(B_0 times B_1)= max(irr(B_0),irr(B_1)). We prove…

The common cause completeness (CCC) is a philosophical principle that asserts that if we consider two positively correlated events then it evokes a common cause. The principle is due to H. Reichenbach and has been largely studied in Boolean…

We extend the applications of the techniques used in Arch Math Logic 52:261-278, 2013, to present various examples of consistency results where some cardinal invariants of the continuum take arbitrary regular values with the size of the…

Dealing with the cardinal invariants p and t of the continuum we prove that m=p=aleph_2 -> t = aleph_1. In other words if MA_{aleph_1} (or a weak version of this) then (of course aleph_2 <= p <= t and) p = aleph_2 -> p = t . This is based…

We show that the Proper Forcing Axiom for forcing notions of size $\aleph_1$ is consistent with the continuum being arbitrarily large. In fact, assuming $GCH$ holds and $\kappa\geq\omega_2$ is a regular cardinal, we prove that there is a…

We prove the consistency of the following statement: for some kappa<2^{aleph_0}, there is a kappa-complete ideal on kappa such that the Boolean algebra P(kappa)/I is sigma-centered and there are Q-sets of reals.

We prove that every biorthogonality preserving linear surjection between two dual or compact C$^*$-algebras or between two von Neumann algebras is automatically continuous.

We study $C^*$-algebras arising from $C^*$-correspondences, which was introduced by the author. We prove the gauge-invariant uniqueness theorem, and obtain conditions for our $C^*$-algebras to be nuclear, exact, or satisfy the Universal…

In this note we prove that the constant and equivariant cyclic cohomology of algebras coincide. This shows that constant cyclic cohomology is rich and computable.

We concerns here with the continuity on the geometry of the second Riemannian L^p-Sobolev best constant B_0(p,g) associated to the AB program. Precisely, for 1 <= p <= 2, we prove that B_0(p,g) depends continuously on g in the C^2-topology.…

We consider homogeneity properties of Boolean algebras that have nonprincipal ultrafilters which are countably generated.It is shown that a Boolean algebra B is homogeneous if it is the union of countably generated nonprincipal ultrafilters…

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).

The primary purpose of this article is to show that a certain natural set of axioms yields a completeness result for continuous first-order logic. In particular, we show that in continuous first-order logic a set of formulae is (completely)…