Internally club and approachable

We prove that PFA implies for all regular λ?ω₂, there are stationarily many N⊆H(λ) with size ℵ₁ which are internally club but not internally approachable.     

Dense non-reflection for stationary collections of countable sets

We present several forcing posets for adding a non-reflecting stationary subset of P_ω1(λ), where λ≥ω₂. We prove that PFA is consistent with dense non-reflection in P_ω1(λ), which means that every stationary subset of P_ω1(λ) contains a stationary subset which does not reflect to any set of size ₁. If λ is singular with countable cofinality, then dense non-reflection in P_ω1(λ) follows from the existence of squares.     

Specialising Aronszajn trees by countable approximations

We show that there are proper forcings based upon countable trees of creatures that specialise a given Aronszajn tree.The first author was partially supported by a Minerva fellowship. The second author's research was partially supported by the ``Israel Science Foundation', founded by the Israel Academy of Science and Humanities. This is the second author's work number 778. Mathematics Subject Classification (2000): 03E15, 03E17, 03E35, 03D65     

A new condensation principle

We generalize (A), which was introduced in [Sch], to larger cardinals. For a regular cardinal >₀ we denote by (A) the statement that and for all regular >,is stationary in It was shown in [Sch] that can hold in a set-generic extension of L. We here prove that can hold in a set-generic extension of L as well. In both cases we in fact get equiconsistency theorems. This strengthens results of [Rä00] and [Rä01]. is equivalent with the existence of 0^#.Mathematics Subject Classification (1991): Primary 03E55, 03E15, Secondary 03E35, 03E60     

CH with no Ostaszewski spaces

There are models of CH without Ostaszeswki spaces. If is locally compact and sub-Ostaszewski, there is a forcing which does not add reals and which forces `` is not sub-Ostaszewski'.

     

The almost-disjointness number may have countable cofinality

We show that it is consistent for the almost-disjointness number to have countable cofinality. For example, it may be equal to .

     

First countable, countably compact spaces and the continuum hypothesis

We build a model of ZFC+CH in which every first countable, countably compact space is either compact or contains a homeomorphic copy of with the order topology. The majority of the paper consists of developing forcing technology that allows us to conclude that our iteration adds no reals. Our results generalize Saharon Shelah's iteration theorems appearing in Chapters V and VIII of Proper and improper forcing (1998), as well as Eisworth and Roitman's (1999) iteration theorem. We close the paper with a ZFC example (constructed using Shelah's club-guessing sequences) that shows similar results do not hold for closed pre-images of .

     

A FORMALISM FOR SOME CLASS OF FORCING NOTIONS

We introduce a class of forcing notions, called forcing notions of type S, which contains among other Sacks forcing, Prikry-Silver forcing and their iterations and products with countable supports. We construct and investigate some formalism suitable for this forcing notions, which allows all standard tricks for iterations or products with countable supports of Sacks forcing. On the other hand it does not involve internal combinatorial structure of conditions of iterations or products. We prove that the class of forcing notions of type S is closed under products and certain iterations with countable supports.     

n重分数布朗运动的Strassen泛函重对数律

本文给出了由两个不同的分数布朗运动组成的重分数布朗运动的Strassen型泛函重对数律和局部Strassen型泛函重对数律.我们的结果也适用于由两个布朗运动组成的重布朗运动及由一个分数布朗运动和一个布朗运动组成的重过程.最后将上述结果推广到n重分数布朗运动中.推广了已有文献的相应结果.     

Many countable support iterations of proper forcings preserve Souslin trees

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 iterations in the so-called Case A that does not need a division into forcings that add reals and those who do not.     

Sets in Prikry and Magidor generic extensions

We continue [4] and study sets in generic extensions by the Magidor forcing and by the Prikry forcing with non-normal ultrafilters.     

Strongly meager sets of real numbers and tree forcing notions

We show that every strongly meager set has the - and the - property.

     

几类微分方程解的迭代增长级数与零点迭代收敛指数

本文研究了几类微分方程解的迭代增长级及零点迭代收敛指数．     

ON THE ITERATED ORDER OF MEROMORPHIC SOLUTIONS OF HIGHER ORDER LINEAR DIFFERENTIAL EQUATIONS

In this paper, we investigate complex homogeneous and non-homogeneous higher order linear differential equations with meromorphic coefficients. We obtain several results concerning the iterated order of meromorphic solutions, and the iterated convergence exponent of the zeros of meromorphic solutions.