Switch to: Citations

Add references

You must login to add references.
  1. Combinatorial characterization of $\Pi^11$ -indescribability in $P{\kappa}\lambda$.Yoshihiro Abe - 1998 - Archive for Mathematical Logic 37 (4):261-272.
    It is proved that $\Pi^1_1$ -indescribability in $P_{\kappa}\lambda$ can be characterized by combinatorial properties without taking care of cofinality of $\lambda$ . We extend Carr's theorem proving that the hypothesis $\kappa$ is $2^{\lambda^{<\kappa}}$ -Shelah is rather stronger than $\kappa$ is $\lambda$ -supercompact.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)A hierarchy of filters smaller than \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $CF_\kappa\lambda-->$\end{document}. [REVIEW]Yoshihiro Abe - 1997 - Archive for Mathematical Logic 36 (6):385-397.
    This research was partially supported by Grant-in-Aid for Scientific Research (No. 06640178 and No. 06640336), Ministry of Education, Science and Culture of Japan Mathematics Subject Classification: 03E05 --> Abstract. Following Carr's study on diagonal operations and normal filters on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} ${\cal P}_{\kappa}\lambda$\end{document} in [2], several weakenings of normality have been investigated. One of them is to consider normal filters without \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}-completeness, for (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Weakly compact cardinals: A combinatorial proof.S. Shelah - 1979 - Journal of Symbolic Logic 44 (4):559-562.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Partition Relations for Strongly Normal Ideals on Pκ(λ).Pierre Matet - 2000 - Mathematical Logic Quarterly 46 (1):87-103.
    Building upon earlier work of Donna Carr, Don Pelletier, Chris Johnson, Shu-Guo Zhang and others, we show that a normal ideal J on Pκ is strongly normal if and only if J+→< 2 for every μ < κ, and we describe the least normal ideal J on Pκ such that J+ →< 2.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Some combinatorial problems concerning uncountable cardinals.Thomas J. Jech - 1973 - Annals of Mathematical Logic 5 (3):165.
    Download  
     
    Export citation  
     
    Bookmark   75 citations