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

In this paper, we answer a question asked in Koepke et al. regarding a Mathias criteria for Tree-Prikry forcing. Also we will investigate Prikry forcing using various filters. For completeness and self inclusion reasons, we will give proofs of many known theorems.

We address the question of consistency strength of certain filters and ultrafilters which fail to satisfy the Galvin property. We answer questions [Benhamou and Gitik, Ann. Pure Appl. Logic 173 (2022) 103107; Questions 7.8, 7.9], [Benhamou et al., J. Lond. Math. Soc. 108(1) (2023) 190–237; Question 5] and improve theorem [Benhamou et al., J. Lond. Math. Soc. 108(1) (2023) 190–237; Theorem 2.3].

(1) We show that it is possible to add $\kappa ^+$ -Cohen subsets to $\kappa $ with a Prikry forcing over $\kappa $. This answers a question from [9]. (2) A strengthening of non-Galvin property is introduced. It is shown to be consistent using a single measurable cardinal which improves a previous result by S. Garti, S. Shelah, and the first author [5]. (3) A situation with Extender-based Prikry forcings is examined. This relates to a question of H. Woodin.

We study which [Formula: see text]-distributive forcing notions of size [Formula: see text] can be embedded into tree Prikry forcing notions with [Formula: see text]-complete ultrafilters under various large cardinal assumptions. An alternative formulation — can the filter of dense open subsets of a [Formula: see text]-distributive forcing notion of size [Formula: see text] be extended to a [Formula: see text]-complete ultrafilter.