We generalize the notion of a fat subset of a regular cardinal κ to a fat subset of $P_{\kappa }\left(X\right)$, where κ ⊆ X. Suppose μ < κ, ${\mu }^{<\mu }=\mu$, and κ is supercompact. Then there is a generic extension in which κ = μ⁺⁺, and for all regular λ ≥ μ⁺⁺, there are stationarily many N in ${\left[H\left(\lambda \right)\right]}^{\mu ⁺}$ which are internally club but not internally approachable.

A 1984 problem of S. Z. Ditor asks whether there exists a lattice of cardinality ℵ₂, with zero, in which every principal ideal is finite and every element has at most three lower covers. We prove that the existence of such a lattice follows from either one of two axioms that are known to be independent of ZFC, namely (1) Martin’s Axiom restricted to collections of ℵ₁ dense subsets in posets of precaliber ℵ₁, (2) the existence of a gap-1 morass. In particular, the existence of such a lattice is consistent...

Assuming the continuum hypothesis there is an inseparable sequence of length ω₁ that contains no Lusin subsequence, while if Martin's Axiom and ¬ CH are assumed then every inseparable sequence (of length ω₁) is a union of countably many Lusin subsequences.

Under $M{A}_{{\omega }_1}$ every uncountable almost disjoint family is either anti-Luzin or has an uncountable Luzin subfamily. This fails under CH. Related properties are also investigated.

The Katětov ordering of two maximal almost disjoint (MAD) families $𝒜$ and $ℬ$ is defined as follows: We say that $𝒜{\le }_Kℬ$ if there is a function $f:\omega \to \omega$ such that $f^{-1}\left(A\right)\in ℐ\left(ℬ\right)$ for every $A\in ℐ\left(𝒜\right)$. In [Garcia-Ferreira S., Hrušák M., Ordering MAD families a la Katětov, J. Symbolic Logic 68 (2003), 1337–1353] a MAD family is called $K$-uniform if for every $X\in ℐ{\left(𝒜\right)}^{+}$, we have that ${𝒜|}_X{\le }_K𝒜$. We prove that CH implies that for every $K$-uniform MAD family $𝒜$ there is a $P$-point $p$ of ${\omega }^{*}$ such that the set of all Rudin-Keisler predecessors of $p$ is dense in the...

Rational numbers are used to classify maximal almost disjoint (MAD) families of subsets of the integers. Combinatorial characterization of indestructibility of MAD families by the likes of Cohen, Miller and Sacks forcings are presented. Using these it is shown that Sacks indestructible MAD family exists in ZFC and that $𝔟=𝔠$ implies that there is a Cohen indestructible MAD family. It follows that a Cohen indestructible MAD family is in fact indestructible by Sacks and Miller forcings. A connection with...

In his paper in Fund. Math. 178 (2003), Miller presented two conjectures regarding MAD families. The first is that CH implies the existence of a MAD family that is also a σ-set. The second is that under CH, there is a MAD family concentrated on a countable subset. These are proved in the present paper.

We study maximal almost disjoint (MAD) families of functions in ${\omega }^{\omega }$ that satisfy certain strong combinatorial properties. In particular, we study the notions of strongly and very MAD families of functions. We introduce and study a hierarchy of combinatorial properties lying between strong MADness and very MADness. Proving a conjecture of Brendle, we show that if $cov\left(ℳ\right){<}_{}$, then there no very MAD families. We answer a question of Kastermans by constructing a strongly MAD family from = . Next, we study the...

In this paper we consider the point character of metric spaces. This parameter which is a uniform version of dimension, was introduced in the context of uniform spaces in the late seventies by Jan Pelant, Cardinal reflections and point-character of uniformities, Seminar Uniform Spaces (Prague, 1973–1974), Math. Inst. Czech. Acad. Sci., Prague, 1975, pp. 149–158. Here we prove for each cardinal $\kappa$, the existence of a metric space of cardinality and point character $\kappa$. Since the point character can...

We consider a combinatorial problem related to guessing the values of a function at various points based on its values at certain other points, often presented by way of a hat-problem metaphor: there are a number of players who will have colored hats placed on their heads, and they wish to guess the colors of their own hats. A visibility relation specifies who can see which hats. This paper focuses on the existence of minimal predictors: strategies guaranteeing at least one player guesses correctly,...

We will characterize-under appropriate axiomatic assumptions-when a linear order is minimal with respect to not being a countable union of scattered suborders. We show that, assuming PFA⁺, the only linear orders which are minimal with respect to not being σ-scattered are either Countryman types or real types. We also outline a plausible approach to demonstrating the relative consistency of: There are no minimal non-σ-scattered linear orders. In the process of establishing these results, we will...