A note on monotonically metacompact spaces

We show that any metacompact Moore space is monotonically metacompact and use that result to characterize monotone metacompactness in certain generalized ordered (GO) spaces. We show, for example, that a generalized ordered space with a σ-closed-discrete dense subset is metrizable if and only if it is monotonically (countably) metacompact, that a monotonically (countably) metacompact GO-space is hereditarily paracompact, and that a locally countably compact GO-space is metrizable if and only if it is monotonically (countably) metacompact. We give an example of a non-metrizable LOTS that is monotonically metacompact, thereby answering a question posed by S.G. Popvassilev. We also give consistent examples showing that if there is a Souslin line, then there is one Souslin line that is monotonically countable metacompact, and another Souslin line that is not monotonically countably metacompact.     

Chain homogeneous Souslin algebras

Assuming Jensen's principle ?⁺ we construct Souslin algebras all of whose maximal chains are pairwise isomorphic as total orders, thereby answering questions of Koppelberg and Todor?evi?.     

Constructing aD, non-D-spaces

We introduce a general method to construct 0-dimensional, scattered T₂ spaces which are not linearly D. The construction is used to show that there are aD, non-D-spaces, answering a question of Arhangel?skii. The latter example is achieved using Shelah?s club guessing principles.     

Small embedding characterizations for large cardinals

We show that many large cardinal notions can be characterized in terms of the existence of certain elementary embeddings between transitive set-sized structures, that map their critical point to the large cardinal in question. As an application, we use such embeddings to provide new proofs of results of Christoph Weiß on the consistency strength of certain generalized tree properties. These new proofs eliminate problems contained in the original proofs provided by Weiß.     

Fusion and large cardinal preservation

In this paper we introduce some fusion properties of forcing notions which guarantee that an iteration with supports of size ?κ   not only does not collapse κ⁺${\kappa }^{+}$ but also preserves the strength of κ (after a suitable preparatory forcing). This provides a general theory covering the known cases of tree iterations which preserve large cardinals (cf. Dobrinen and Friedman (2010) [3], Friedman and Halilovi? (2011) [5], Friedman and Honzik (2008) [6], Friedman and Magidor (2009) [8], Friedman and Zdomskyy (2010) [10], Honzik (2010) [12]).     

Examples from trees, related to discrete subsets, pseudo-radiality and ω-boundedness

We construct some examples using trees. Some of them are consistent counterexamples for the discrete reflection of certain topological properties. All the properties dealt with here were already known to be non-discretely reflexive if we assume CH and we show that the same is true assuming the existence of a Suslin tree. In some cases we actually get some ZFC results. We construct also, using a Suslin tree, a compact space that is pseudo-radial but it is not discretely generated. With a similar construction, but using an Aronszajn tree, we present a ZFC space that is first countable, ω-bounded but is not strongly ω-bounded, answering a question of Peter Nyikos.     

Souslin trees at successors of regular cardinals

We present a weak sufficient condition for the existence of Souslin trees at successor of regular cardinals. The result is optimal and simultaneously improves an old theorem of Gregory and a more recent theorem of the author.     

Gap structure after forcing with a coherent Souslin tree

We investigate the effect after forcing with a coherent Souslin tree on the gap structure of the class of coherent Aronszajn trees ordered by embeddability. We shall show, assuming the relativized version PFA(S) of the proper forcing axiom, that the Souslin tree S forces that the class of Aronszajn trees ordered by the embeddability relation is universal for linear orders of cardinality at most ${\aleph_1}$ .     

A Characterization of Generalized Příkrý Sequences

A generalization of Příkry's forcing is analyzed which adjoins to a model of ZFC a set of order type at most ω below each member of a discrete set of measurable cardinals. A characterization of generalized Příkry generic sequences reminiscent of Mathias' criterion for Příkry genericity is provided, together with a maximality theorem which states that a generalized Příkry sequence almost contains every other one lying in the same extension. This forcing can be used to falsify the covering lemma for a higher core model if there is an inner model with infinitely many measurable cardinals – changing neither cardinalities nor cofinalities. Another application is an alternative proof of a theorem of Mitchell stating that if the core model contains a regular limit θ of measurable cardinals, then there is a model in which every set of measurable cardinals of K bounded in θ has an indiscernible sequence but there is no such sequence for the entire set of measurables of K below θ. During the research for this paper the author was supported by DFG-Project Je209/1-2.     

Strongly baire trees and a Cofinal Branch Principle

We study strongly Baire trees. The Confinal Branch Principle is the statement that every strongly Baire tree of heightω ₁ has a cofinal branch. We show that this principle implies that the strong reflection principle holds, there are no Souslin trees andM A ⁺ (σ-closed) holds. Also it follows from the Semiproper Forcing Axiom, and the Strong Reflection Principle does not imply the cofinal branch principle. Supported by a grant from Academia Finica and a grant from The Chinese National Science Foundation (19871803).     

Club degrees of rigidity and almost Kurepa trees

A highly rigid Souslin tree T is constructed such that forcing with T turns T into a Kurepa tree. Club versions of previously known degrees of rigidity are introduced, as follows: for a rigidity property P, a tree T is said to have property P on clubs if for every club set C (containing 0), the restriction of T to levels in C has property P. The relationships between these rigidity properties for Souslin trees are investigated, and some open questions are stated.     

Weak saturation of ideals on Pκ(λ)

We show that if κ is an infinite successor cardinal, and λ > κ a cardinal of cofinality less than κ satisfying certain conditions, then no (proper, fine, κ‐complete) ideal on P_κ(λ) is weakly λ⁺‐saturated. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

The differences between Kurepa trees and Jech-Kunen trees

Summary By an ₁ we mean a tree of power ₁ and height ₁. An ₁-tree is called a Kurepa tree if all its levels are countable and it has more than ₁ branches. An ₁-tree is called a Jech-Kunen tree if it has branches for some strictly between ₁ and . In Sect. 1, we construct a model ofCH plus , in which there exists a Kurepa tree with not Jech-Kunen subtrees and there exists a Jech-Kunen tree with no Kurepa subtrees. This improves two results in [Ji1] by not only eliminating the large cardinal assumption for [Ji1, Theorem 2] but also handling two consistency proofs of [Ji1, Theorem 2 and Theorem 3] simultaneously. In Sect. 2, we first prove a lemma saying that anAxiom A focing of size ₁ over Silver's model will not produce a Kurepa tree in the extension, and then we apply this lemma to prove that, in the model constructed for Theorem 2 in [Ji1], there exists a Jech-Kunen tree and there are no Kurepa trees.     

Projective mad families

Using almost disjoint coding we prove the consistency of the existence of a definable ω-mad family of infinite subsets of ω (resp. functions from ω to ω) together with b=2^ω=ω₂.     

Global square sequences in extender models

We present a construction of a global square sequence in extender models with λ-indexing.     

Bounded stationary reflection II

Bounded stationary reflection at a cardinal λ is the assertion that every stationary subset of λ reflects but there is a stationary subset of λ that does not reflect at arbitrarily high cofinalities. We produce a variety of models in which bounded stationary reflection holds. These include models in which bounded stationary reflection holds at the successor of every singular cardinal $\mu >{\mathrm{?}}_{\omega }$ and models in which bounded stationary reflection holds at ${\mu }^{+}$ but the approachability property fails at μ.     

Fonctions généralisées et analyse non standard

We study some connections between Non-Standard Analysis and algebraical theories of generalized functions. More precisely, we point out the fact that the construction of these algebras can be interpreted in terms of Non Standard asymptotic properties. For example, we show that the construction of the J. F. Colombeau'Algebra is equivalent (in a certain sense) to a monadic property. Conversely, we show that a certain galactic property (being exponentially small with respect to a parameter) leads to a new algebra.

     

Weak covering and the tree property

Suppose that there is no transitive model of ZFC + there is a strong cardinal, and let K denote the core model. It is shown that if has the tree property then and is weakly compact in K. Received: 11 June 1997