Combinatorics and forcing with distributive ideals
From MaRDI portal
Publication:1361244
DOI10.1016/S0168-0072(96)00022-XzbMath0949.03038MaRDI QIDQ1361244
Publication date: 23 July 1997
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
91A44: Games involving topology, set theory, or logic
03E55: Large cardinals
03E05: Other combinatorial set theory
03E40: Other aspects of forcing and Boolean-valued models
Related Items
Q-pointness, P-pointness and feebleness of ideals, Ultrafilters on 𝜔-their ideals and their cardinal characteristics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Happy families and completely Ramsey sets
- Groupwise density and related cardinals
- Selctive ultrafilters and homogeneity
- \(\Delta^ 1_ 2\)-sets of reals
- Set theory. An introduction to independence proofs
- Completely separable families and Ramsey's theorem
- Une méthode topologique pour l'étude de la propriété de Ramsey
- Filters and large cardinals
- Combinatorial properties of classical forcing notions
- On the Ramsey property for sets of reals
- Distributive ideals and partition relations
- On completely Ramsey sets
- Compacts de fonctions mesurables et filtres non mesurables
- Forcing Minimal Degree of Constructibility
- A new proof that analytic sets are Ramsey
- A Combinatorial Property of Measurable Cardinals
- Combinatorics on ideals and forcing
- Happy families
- Ultrafilters on 𝜔-their ideals and their cardinal characteristics
- Borel sets and Ramsey's theorem
- Some remarks on changing cofinalities
- Every analytic set is Ramsey