Results for ' $${F_\sigma}$$ ideals'

6 found
Order:
  1.  7
    On extendability to $$F_\sigma $$ ideals.Adam Kwela - 2022 - Archive for Mathematical Logic 61 (7):881-890.
    Answering in negative a question of M. Hrušák, we construct a Borel ideal not extendable to any \(F_\sigma \) ideal and such that it is not Katětov above the ideal \(\mathrm {conv}\).
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  8
    On extendability to Fσ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_\sigma $$\end{document} ideals[REVIEW]Adam Kwela - 2022 - Archive for Mathematical Logic 61 (7-8):881-890.
    Answering in negative a question of M. Hrušák, we construct a Borel ideal not extendable to any Fσ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$F_\sigma $$\end{document} ideal and such that it is not Katětov above the ideal conv\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {conv}$$\end{document}.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  22
    Yet Another Ideal Version of the Bounding Number.Rafał Filipów & Adam Kwela - 2022 - Journal of Symbolic Logic 87 (3):1065-1092.
    Let $\mathcal {I}$ be an ideal on $\omega $. For $f,\,g\in \omega ^{\omega }$ we write $f \leq _{\mathcal {I}} g$ if $f(n) \leq g(n)$ for all $n\in \omega \setminus A$ with some $A\in \mathcal {I}$. Moreover, we denote $\mathcal {D}_{\mathcal {I}}=\{f\in \omega ^{\omega }: f^{-1}[\{n\}]\in \mathcal {I} \text { for every } n\in \omega \}$ (in particular, $\mathcal {D}_{\mathrm {Fin}}$ denotes the family of all finite-to-one functions).We examine cardinal numbers $\mathfrak {b}(\geq _{\mathcal {I}}\cap (\mathcal {D}_{\mathcal {I}} \times \mathcal {D}_{\mathcal (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  39
    A variant of Mathias forcing that preserves \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{ACA}_0}$$\end{document}. [REVIEW]François G. Dorais - 2012 - Archive for Mathematical Logic 51 (7-8):751-780.
    We present and analyze \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${F_\sigma}$$\end{document}-Mathias forcing, which is similar but tamer than Mathias forcing. In particular, we show that this forcing preserves certain weak subsystems of second-order arithmetic such as \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{ACA}_0}$$\end{document} and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WKL}_0 + \mathsf{I}\Sigma^0_2}$$\end{document}, whereas Mathias forcing does not. We also show that the needed reals for \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  21
    Canjar Filters.Osvaldo Guzmán, Michael Hrušák & Arturo Martínez-Celis - 2017 - Notre Dame Journal of Formal Logic 58 (1):79-95.
    If $\mathcal{F}$ is a filter on $\omega$, we say that $\mathcal{F}$ is Canjar if the corresponding Mathias forcing does not add a dominating real. We prove that any Borel Canjar filter is $F_{\sigma}$, solving a problem of Hrušák and Minami. We give several examples of Canjar and non-Canjar filters; in particular, we construct a $\mathsf{MAD}$ family such that the corresponding Mathias forcing adds a dominating real. This answers a question of Brendle. Then we prove that in all the “classical” models (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  6.  9
    Bases and borel selectors for tall families.Jan Grebík & Carlos Uzcátegui - 2019 - Journal of Symbolic Logic 84 (1):359-375.
    Given a family${\cal C}$of infinite subsets of${\Bbb N}$, we study when there is a Borel function$S:2^{\Bbb N} \to 2^{\Bbb N} $such that for every infinite$x \in 2^{\Bbb N} $,$S\left \in {\Cal C}$and$S\left \subseteq x$. We show that the family of homogeneous sets as given by the Nash-Williams’ theorem admits such a Borel selector. However, we also show that the analogous result for Galvin’s lemma is not true by proving that there is an$F_\sigma $tall ideal on${\Bbb N}$without a Borel selector. The (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark