Mathias forcing and ultrafilters
DOI10.1007/S00153-016-0499-2zbMATH Open1403.03100DBLPjournals/aml/PawlikowskiS16OpenAlexW2513337872WikidataQ59473409 ScholiaQ59473409MaRDI QIDQ334983FDOQ334983
Authors: Janusz Pawlikowski, Wojciech Stadnicki 
Publication date: 1 November 2016
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-016-0499-2
Recommendations
- Mathias Forcing which does not Add Dominating Reals
- Mathias-Prikry and Laver-Prikry type forcing
- A notion of selective ultrafilter corresponding to topological Ramsey spaces
- Mathias-Prikry and Laver type forcing; summable ideals, coideals, and \(+\)-selective filters
- Mathias forcing and combinatorial covering properties of filters
Other combinatorial set theory (03E05) Consistency and independence results (03E35) Other aspects of forcing and Boolean-valued models (03E40)
Cites Work
Cited In (10)
- Ultrafilters Throughout Mathematics
- On measures induced by forcing names for ultrafilters
- Mathias-Prikry and Laver type forcing; summable ideals, coideals, and \(+\)-selective filters
- ON IDEMPOTENT ULTRAFILTERS IN HIGHER-ORDER REVERSE MATHEMATICS
- Hindman's theorem, ultrafilters, and reverse mathematics
- Forcing and stable ordered–union ultrafilters
- P-filters and Cohen, random, and Laver forcing
- Playing with Mathias
- Genericity for Mathias forcing over general Turing ideals
- Mathias Forcing which does not Add Dominating Reals
This page was built for publication: Mathias forcing and ultrafilters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334983)
