We introduce the idea of a coherent adequate set of models, which can be used as side conditions in forcing. As an application we define a forcing poset which adds a square sequence on ω₂ using finite conditions.

We introduce Oberwolfach randomness, a notion within Demuth’s framework of statistical tests with moving components; here the components’ movement has to be coherent across levels. We show that a ML-random set computes all $K$-trivial sets if and only if it is not Oberwolfach random, and indeed that there is a $K$-trivial set which is not computable from any Oberwolfach random set. We show that Oberwolfach random sets satisfy effective versions of almost-everywhere theorems of analysis, such as the...

Among cocomplete categories, the locally presentable ones can be defined as those with a strong generator consisting of presentable objects. Assuming Vopěnka’s Principle, we prove that a cocomplete category is locally presentable if and only if it has a colimit dense subcategory and a generator consisting of presentable objects. We further show that a $3$-element set is colimit-dense in ${\mathrm{𝐒𝐞𝐭}}^{\mathrm{op}}$, and spaces of countable dimension are colimit-dense in ${\mathrm{𝐕𝐞𝐜}}^{\mathrm{op}}$.

A structure $={(A;E_i)}_{i\in n}$ where each $E_i$ is an equivalence relation on A is called an n-grid if any two equivalence classes coming from distinct $E_i$’s intersect in a finite set. A function χ: A → n is an acceptable coloring if for all i ∈ n, the ${\chi }^{-1}\left(i\right)$ intersects each $E_i$-equivalence class in a finite set. If B is a set, then the n-cube Bⁿ may be seen as an n-grid, where the equivalence classes of $E_i$ are the lines parallel to the ith coordinate axis. We use elementary submodels of the universe to characterize those n-grids...

We study combinatorial principles we call the Homogeneity Principle HP(κ) and the Injectivity Principle IP(κ,λ) for regular κ > ℵ₁ and λ ≤ κ which are formulated in terms of coloring the ordinals < κ by reals. These principles are strengthenings of $C^s\left(\kappa \right)$ and $F^s\left(\kappa \right)$ of I. Juhász, L. Soukup and Z. Szentmiklóssy. Generalizing their results, we show e.g. that IP(ℵ₂,ℵ₁) (hence also IP(ℵ₂,ℵ₂) as well as HP(ℵ₂)) holds in a generic extension of a model of CH by Cohen forcing, and IP(ℵ₂,ℵ₂) (hence also HP(ℵ₂))...

It is consistent that ZF + DC holds, the hypergraph of rectangles on a given Euclidean space has countable chromatic number, while the hypergraph of equilateral triangles on ${ℝ}^2$ does not.

Let $\left(\genfrac{}{}{0pt}{}{I}{m}\right)$ be the set of subsets of $I$ of cardinality $m$. Let $f$ be a coloring of $\left(\genfrac{}{}{0pt}{}{I}{m}\right)$ and $g$ a coloring of $\left(\genfrac{}{}{0pt}{}{I}{m}\right)$. We write $f\to g$ if every $f$-homogeneous $H\subseteq I$ is also $g$-homogeneous. The least $m$ such that $f\to g$ for some $f:\left(\genfrac{}{}{0pt}{}{I}{m}\right)\to k$ is called the $k$-width of $g$ and denoted by $w_k\left(g\right)$. In the first part of the paper we prove the existence of colorings with high $k$-width. In particular, we show that for each $k>0$ and $m>0$ there is a coloring $g$ with $w_k\left(g\right)=m$. In the second part of the paper we give applications of wide colorings in the theory of generalized quantifiers....

We study combinatorial properties of the partial order (Dense(ℚ),⊆). To do that we introduce cardinal invariants ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$ describing properties of Dense(ℚ). These invariants satisfy ${}_{\mathbb{Q}}$ ≤ ℚ ≤ ℚ ≤ ℚ ≤ ℚ ≤ ℚ$.WecomparethemwiththeiranaloguesinthewellstudiedBooleanalgebra\left(\omega \right)/fin.Weshowthat$ℚ = p$,$ℚ = t$and$ℚ = i$,whereas$ℚ > h$and$ℚ > r$arebothshowntoberelativelyconsistentwithZFC.Wealsoinvestigatecombinatoricsoftheidealnwdofnowheredensesubsetsof,\mathbb{Q}.Inparticular,weshowthat$non(M)=min||: ⊆ Dense(R) ∧ (∀I ∈ nwd(R))(∃D ∈ )(I ∩ D = ∅) and cof(M) = min||: ⊆ Dense(ℚ) ∧ (∀I ∈ nwd)(∃D ∈ )(I ∩ = ∅). We use these facts to show that cof(M) ≤ i, which improves a result of S. Shelah.

This note is devoted to combinatorial properties of ideals on the set of natural numbers. By a result of Mathias, two such properties, selectivity and density, in the case of definable ideals, exclude each other. The purpose of this note is to measure the ``distance'' between them with the help of ultrafilter topologies of Louveau.

Some of the covering properties of spaces as defined in Parts I and II are here characterized by games. These results, applied to function spaces $C_p\left(X\right)$ of countable tightness, give new characterizations of countable fan tightness and countable strong fan tightness. In particular, each of these properties is characterized by a Ramseyan theorem.

We use Ramseyan partition relations to characterize: ∙ the classical covering property of Hurewicz; ∙ the covering property of Gerlits and Nagy; ∙ the combinatorial cardinal numbers and add(ℳ ). Let X be a $T_{31/2}$-space. In [9] we showed that $C_p\left(X\right)$ has countable strong fan tightness as well as the Reznichenko property if, and only if, all finite powers of X have the Gerlits-Nagy covering property. Now we show that the following are equivalent: 1. $C_p\left(X\right)$ has countable fan tightness and the Reznichenko property. 2....