Mathias-Prikry and Laver-Prikry type forcing (Q386153)

The authors study the forcing notions of Mathias-Prikry and Laver-Prikry. Recall that, given a filter \(\mathcal{F}\) on \(\omega,\) Mathias-Prikry forcing \(\mathbb{M}_{\mathcal{F}}\) consists of pairs \((s, A)\) such that \(s\in [\omega]^{<\omega}, A\in \mathcal{F}\) and \(\max(s) < \min(A).\) The order is defined by \((s, A)\leq (t, B)\) iff \(s\) end-extends \(t, A \subseteq B\) and \(s\setminus t \subseteq B.\) Also, the Laver-Prikry forcing notion \(\mathbb{L}_{\mathcal{F}}\) is defined as the set of all trees \(T \subseteq \omega^{<\omega}\) with stem \(t\) which is \(\mathcal{F}\)-large, i.e., for all \(t \subseteq s\in T\), \(\mathrm{suc}_T(s)\in \mathcal{F}.\) The order is given by inclusion. The Martin number \(m(\mathbb P)\) of a forcing notion \(\mathbb{P}\) is the minimal size of a family of dense open subsets of \(\mathbb{P}\) such that no filter on \(\mathbb{P}\) intersects them all. In this paper, the authors give a combinatorial characterization of the Martin number of the forcing notions \(\mathbb{M}_{\mathcal{I}^*}\) and \(\mathbb{L}_{\mathcal{I}^*},\) where \(\mathcal{I}\) is an ideal on \(\omega\) and \(\mathcal{I}^*\) its dual filter (Theorems 2 and 3). Their results extend some earlier results of \textit{J. Brendle} and \textit{S. Shelah} [Trans. Am. Math. Soc. 351, No. 7, 2643--2674 (1999; Zbl 0927.03073)] who proved similar results for an ultrafilter \(\mathcal{U}\) on \(\omega.\) They also prove some combinatorial characterizations of those ideals \(\mathcal{I}\) on \(\omega\) such that forcing with \(\mathbb{M}_{\mathcal{I}^*}\) adds a dominating real (Theorem 5), which extends an earlier work of \textit{R. M. Canjar} [Proc. Am. Math. Soc. 104, No. 4, 1239--1248 (1988; Zbl 0691.03030)].