Switch to: References

Add citations

You must login to add citations.
  1. Strongly unbounded and strongly dominating sets of reals generalized.Michal Dečo - 2015 - Archive for Mathematical Logic 54 (7-8):825-838.
    We generalize the notions of strongly dominating and strongly unbounded subset of the Baire space. We compare the corresponding ideals and tree ideals, in particular we present a condition which implies that some of those ideals are distinct. We also introduce DUI\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathrm{DU}_\mathcal{I}}$$\end{document}-property, where I\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal{I}}$$\end{document} is an ideal on cardinal κ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\kappa}$$\end{document}, to capture these two (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Strongly dominating sets of reals.Michal Dečo & Miroslav Repický - 2013 - Archive for Mathematical Logic 52 (7-8):827-846.
    We analyze the structure of strongly dominating sets of reals introduced in Goldstern et al. (Proc Am Math Soc 123(5):1573–1581, 1995). We prove that for every κ (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Indestructibility of ideals and MAD families.David Chodounský & Osvaldo Guzmán - 2021 - Annals of Pure and Applied Logic 172 (5):102905.
    In this survey paper we collect several known results on destroying tall ideals on countable sets and maximal almost disjoint families with forcing. In most cases we provide streamlined proofs of the presented results. The paper contains results of many authors as well as a preview of results of a forthcoming paper of Brendle, Guzmán, Hrušák, and Raghavan.
    Download  
     
    Export citation  
     
    Bookmark  
  • Forcing indestructibility of MAD families.Jörg Brendle & Shunsuke Yatabe - 2005 - Annals of Pure and Applied Logic 132 (2):271-312.
    Let A[ω]ω be a maximal almost disjoint family and assume P is a forcing notion. Say A is P-indestructible if A is still maximal in any P-generic extension. We investigate P-indestructibility for several classical forcing notions P. In particular, we provide a combinatorial characterization of P-indestructibility and, assuming a fragment of MA, we construct maximal almost disjoint families which are P-indestructible yet Q-destructible for several pairs of forcing notions . We close with a detailed investigation of iterated Sacks indestructibility.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Analytic countably splitting families.Otmar Spinas - 2004 - Journal of Symbolic Logic 69 (1):101-117.
    A family A ⊆ ℘(ω) is called countably splitting if for every countable $F \subseteq [\omega]^{\omega}$ , some element of A splits every member of F. We define a notion of a splitting tree, by means of which we prove that every analytic countably splitting family contains a closed countably splitting family. An application of this notion solves a problem of Blass. On the other hand we show that there exists an $F_{\sigma}$ splitting family that does not contain a closed (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • 1996–1997 Winter Meeting of the Association for Symbolic Logic.Alexander S. Kechris - 1997 - Bulletin of Symbolic Logic 3 (3):367-377.
    Download  
     
    Export citation  
     
    Bookmark  
  • Four and more.Ilijas Farah & Jindřich Zapletal - 2006 - Annals of Pure and Applied Logic 140 (1):3-39.
    We isolate several large classes of definable proper forcings and show how they include many partial orderings used in practice.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Solovay-Type Characterizations for Forcing-Algebras.Jörg Brendle & Benedikt Löwe - 1999 - Journal of Symbolic Logic 64 (3):1307-1323.
    We give characterizations for the sentences "Every $\Sigma^1_2$-set is measurable" and "Every $\Delta^1_2$-set is measurable" for various notions of measurability derived from well-known forcing partial orderings.
    Download  
     
    Export citation  
     
    Bookmark   17 citations