We show that for a Suslin ccc forcing notion $\mathbb Q$ adding a Hechler real, “$\mathrm {ZF}+\mathrm {DC}_{\omega _1}+$all sets of reals are $I_{\mathbb Q,\aleph _0}$-measurable” implies the existence of an inner model with a measurable cardinal. We also introduce a wide class of Suslin ccc forcing notions which add a Hechler real, so that the above result applies to them.

Using creature technology, we construct families of Suslin ccc non-sweet forcing notions $\mathbb Q$ such that $ZFC$ is equiconsistent with $ZF+$ “Every set of reals equals a Borel set modulo the $(\leq \aleph _1)$-closure of the null ideal associated with $\mathbb Q$” $+$ “There is an $\omega _1$-sequence of distinct reals.” This answers a question of the second author and Kellner. As an application of independent interest, we also show how our forcing adds a new $\Pi ^1_2$ singleton over L without relying on L-combinatorics.

For $\lambda $ inaccessible, we show that “there is a nowhere trivial automorphism of $\mathcal P(\lambda )/[\lambda ]^{<\lambda }$” follows (in ZFC) from $2^\lambda =\lambda ^+$, and is consistent (via forcing) with $2^\lambda>\lambda ^+$.

We investigate the statement “all automorphisms of ${\mathcal {P}}(\lambda )/[\lambda ]^{<\lambda }$ are trivial.” We show that MA implies the statement for regular uncountable $\lambda <2^{\aleph _0}$, that the statement is false for measurable $\lambda $ if $2^\lambda =\lambda ^+$, and that for “densely trivial” it can be forced (together with $2^\lambda =\lambda ^{++}$) for inaccessible $\lambda $.

We construct a Borel maximal cofinitary group.

An infinite graph is said to be highly connected if the induced subgraph on the complement of any set of vertices of smaller size is connected. We continue the study of weaker versions of Ramsey’s theorem on uncountable cardinals asserting that if we color edges of the complete graph, we can find a large highly connected monochromatic subgraph. In particular, several questions of Bergfalk, Hrušák, and Shelah (2021, Acta Mathematica Hungarica 163, 309–322) are answered by showing that assuming the consistency of suitable large cardinals, the following are relatively consistent with ZFC:

• • $\kappa \to _{hc} (\kappa )^2_\omega $ for every regular cardinal $\kappa \geq \aleph _2$,

• • $\neg \mathsf {CH}+ \aleph _2 \to _{hc} (\aleph _1)^2_\omega $.

Building on a work of Lambie-Hanson (2023, Fundamenta Mathematicae. 260(2):181–197), we also show that

• • $\aleph _2 \to _{hc} [\aleph _2]^2_{\omega ,2}$ is consistent with $\neg \mathsf {CH}$.

To prove these results, we use the existence of ideals with strong combinatorial properties after collapsing suitable large cardinals.

We answer a question of Usuba by showing that the combinatorial principle $\mathrm {UB}_\lambda $ can fail at a singular cardinal. Furthermore, $\lambda $ can be taken to be $\aleph _\omega .$

There is a Turing functional $\Phi $ taking $A^\prime $ to a theory $T_A$ whose complexity is exactly that of the jump of A, and which has the property that $A \leq _T B$ if and only if $T_A \trianglelefteq T_B$ in Keisler’s order. In fact, by more elaborate means and related theories, we may keep the complexity at the level of A without using the jump.

The notion of a complete type can be generalized in a natural manner to allow assigning a value in an arbitrary Boolean algebra $\mathcal {B}$ to each formula. We show some basic results regarding the effect of the properties of $\mathcal {B}$ on the behavior of such types, and show they are particularity well behaved in the case of NIP theories. In particular, we generalize the third author’s result about counting types, as well as the notion of a smooth type and extending a type to a smooth one. We then show that Keisler measures are tied to certain Boolean types and show that some of the results can thus be transferred to measures—in particular, giving an alternative proof of the fact that every measure in a dependent theory can be extended to a smooth one. We also study the stable case. We consider this paper as an invitation for more research into the topic of Boolean types.

We show that it is independent whether club $\kappa $-Miller forcing preserves $\kappa ^{++}$. We show that under $\kappa ^{<\kappa }> \kappa $, club $\kappa $-Miller forcing collapses $\kappa ^{<\kappa }$ to $\kappa $. Answering a question by Brendle, Brooke-Taylor, Friedman and Montoya, we show that the iteration of ultrafilter $\kappa $-Miller forcing does not have the Laver property.

A permutation group G on a set A is ${\kappa }$-homogeneous iff for all $X,Y\in \bigl [ {A} \bigr ]^ {\kappa } $ with $|A\setminus X|=|A\setminus Y|=|A|$ there is a $g\in G$ with $g[X]=Y$. G is ${\kappa }$-transitive iff for any injective function f with $\operatorname {dom}(f)\cup \operatorname {ran}(f)\in \bigl [ {A} \bigr ]^ {\le {\kappa }} $ and $|A\setminus \operatorname {dom}(f)|=|A\setminus \operatorname {ran}(f)|=|A|$ there is a $g\in G$ with $f\subset g$.

Giving a partial answer to a question of P. M. Neumann [6] we show that there is an ${\omega }$-homogeneous but not ${\omega }$-transitive permutation group on a cardinal ${\lambda }$ provided

1. (i) ${\lambda }<{\omega }_{\omega }$, or

2. (ii) $2^{\omega }<{\lambda }$, and ${\mu }^{\omega }={\mu }^+$ and $\Box _{\mu }$ hold for each ${\mu }\le {\lambda }$ with ${\omega }=\operatorname {cf}({\mu })<{{\mu }}$, or

3. (iii) our model was obtained by adding $(2^{\omega })^+$ many Cohen generic reals to some ground model.

For ${\kappa }>{\omega }$ we give a method to construct large ${\kappa }$-homogeneous, but not ${\kappa }$-transitive permutation groups. Using this method we show that there exist ${\kappa }^+$-homogeneous, but not ${\kappa }^+$-transitive permutation groups on ${\kappa }^{+n}$ for each infinite cardinal ${\kappa }$ and natural number $n\ge 1$ provided $V=L$.

A wide Aronszajn tree is a tree of size and height $\omega _{1}$ with no uncountable branches. We prove that under $MA(\omega _{1}\!)$ there is no wide Aronszajn tree which is universal under weak embeddings. This solves an open question of Mekler and Väänänen from 1994.

We also prove that under $MA(\omega _{1}\!)$, every wide Aronszajn tree weakly embeds in an Aronszajn tree, which combined with a result of Todorčević from 2007, gives that under $MA(\omega _{1}\!)$ every wide Aronszajn tree embeds into a Lipschitz tree or a coherent tree. We also prove that under $MA(\omega _{1}\!)$ there is no wide Aronszajn tree which weakly embeds all Aronszajn trees, improving the result in the first paragraph as well as a result of Todorčević from 2007 who proved that under $MA(\omega _{1}\!)$ there are no universal Aronszajn trees.

We present three examples of countable homogeneous structures (also called Fraïssé limits) whose automorphism groups are not universal, namely, fail to contain isomorphic copies of all automorphism groups of their substructures.

Our first example is a particular case of a rather general construction on Fraïssé classes, which we call diversification, leading to automorphism groups containing copies of all finite groups. Our second example is a special case of another general construction on Fraïssé classes, the mixed sums, leading to a Fraïssé class with all finite symmetric groups appearing as automorphism groups and at the same time with a torsion-free automorphism group of its Fraïssé limit. Our last example is a Fraïssé class of finite models with arbitrarily large finite abelian automorphism groups, such that the automorphism group of its Fraïssé limit is again torsion-free.

Our aim is to solve a quite old question on the difference between expandability and compact expandability. Toward this, we further investigate the logic of countable cofinality.

We continue our study of the class ${\cal C}\left( D \right)$, where D is a uniform ultrafilter on a cardinal κ and ${\cal C}\left( D \right)$ is the class of all pairs $\left( {{\theta _1},{\theta _2}} \right)$, where $\left( {{\theta _1},{\theta _2}} \right)$ is the cofinality of a cut in ${J^\kappa }/D$ and J is some ${\left( {{\theta _1} + {\theta _2}} \right)^ + }$-saturated dense linear order. We give a combinatorial characterization of the class ${\cal C}\left( D \right)$. We also show that if $\left( {{\theta _1},{\theta _2}} \right) \in {\cal C}\left( D \right)$ and D is ${\aleph _1}$-complete or ${\theta _1} + {\theta _2} > {2^\kappa }$, then ${\theta _1} = {\theta _2}$.

We show that under Dickson’s conjecture about the distribution of primes in the natural numbers, the theory Th (ℤ , +, 1, 0, Pr) where Pr is a predicate for the prime numbers and their negations is decidable, unstable, and supersimple. This is in contrast with Th (ℤ , +, 0, Pr, <) which is known to be undecidable by the works of Jockusch, Bateman, and Woods.