Finding generic filters by playing games
From MaRDI portal
Publication:2655145
DOI10.1007/s00153-009-0162-2zbMath1192.03022OpenAlexW1999120854MaRDI QIDQ2655145
Publication date: 22 January 2010
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-009-0162-2
Descriptive set theory (03E15) Consistency and independence results (03E35) Other combinatorial set theory (03E05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random trees under CH
- Near coherence of filters. III: A simplified consistency proof
- There may be simple \(P_{\aleph _ 1}\)- and \(P_{\aleph _ 2}\)-points and the Rudin-Keisler ordering may be downward directed
- Set theory. An introduction to independence proofs
- A \({\Delta{}}^ 2_ 2\) well-order of the reals and incompactness of \(L(Q^{MM})\)
- A weak version of \(\lozenge\) which follows from \(2^{\aleph_0}<2^{\aleph_1}\)
- Sticks and clubs
- Another ♦-like principle
- Proper Forcing
- Specializing Aronszajn Trees and Preserving Some Weak Diamonds
- Creatures on ω1 and weak diamonds
- Random Reals and Souslin Trees
- A Perfectly Normal Countably Compact Scattered Space which is not Strongly Zero-Dimensional
- Topologies Determined by -Ideals on ω1
- Similar but not the same: various versions of ♣ do not coincide
- Parametrized $\diamondsuit $ principles
- The fine structure of the constructible hierarchy
This page was built for publication: Finding generic filters by playing games