Switch to: References

Add citations

You must login to add citations.
  1. $$I_0$$ I 0 and combinatorics at $$\lambda ^+$$ λ +.Nam Trang & Xianghui Shi - 2017 - Archive for Mathematical Logic 56 (1-2):131-154.
    We investigate the compatibility of I0\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$I_0$$\end{document} with various combinatorial principles at λ+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda ^+$$\end{document}, which include the existence of λ+\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda ^+$$\end{document}-Aronszajn trees, square principles at λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, the existence of good scales at λ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\lambda $$\end{document}, stationary reflections (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Logics From Ultrafilters.Daniele Mundici - forthcoming - Review of Symbolic Logic:1-18.
    Ultrafilters play a significant role in model theory to characterize logics having various compactness and interpolation properties. They also provide a general method to construct extensions of first-order logic having these properties. A main result of this paper is that every class $\Omega $ of uniform ultrafilters generates a $\Delta $ -closed logic ${\mathcal {L}}_\Omega $. ${\mathcal {L}}_\Omega $ is $\omega $ -relatively compact iff some $D\in \Omega $ fails to be $\omega _1$ -complete iff ${\mathcal {L}}_\Omega $ does not (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Compactness, interpolation and Friedman's third problem.Daniele Mundici - 1982 - Annals of Mathematical Logic 22 (2):197.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • More on regular and decomposable ultrafilters in ZFC.Paolo Lipparini - 2010 - Mathematical Logic Quarterly 56 (4):340-374.
    We prove, in ZFC alone, some new results on regularity and decomposability of ultrafilters; among them: If m ≥ 1 and the ultrafilter D is , equation imagem)-regular, then D is κ -decomposable for some κ with λ ≤ κ ≤ 2λ ). If λ is a strong limit cardinal and D is , equation imagem)-regular, then either D is -regular or there are arbitrarily large κ < λ for which D is κ -decomposable ). Suppose that λ is singular, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Decomposable Ultrafilters and Possible Cofinalities.Paolo Lipparini - 2008 - Notre Dame Journal of Formal Logic 49 (3):307-312.
    We use Shelah's theory of possible cofinalities in order to solve some problems about ultrafilters. Theorem: Suppose that $\lambda$ is a singular cardinal, $\lambda ' \lessthan \lambda$, and the ultrafilter $D$ is $\kappa$ -decomposable for all regular cardinals $\kappa$ with $\lambda '\lessthan \kappa \lessthan \lambda$. Then $D$ is either $\lambda$-decomposable or $\lambda ^+$-decomposable. Corollary: If $\lambda$ is a singular cardinal, then an ultrafilter is ($\lambda$,$\lambda$)-regular if and only if it is either $\operator{cf} \lambda$-decomposable or $\lambda^+$-decomposable. We also give applications to (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Strong compactness and the ultrapower axiom I: the least strongly compact cardinal.Gabriel Goldberg - 2022 - Journal of Mathematical Logic 22 (2).
    Journal of Mathematical Logic, Volume 22, Issue 02, August 2022. The Ultrapower Axiom is a combinatorial principle concerning the structure of large cardinals that is true in all known canonical inner models of set theory. A longstanding test question for inner model theory is the equiconsistency of strongly compact and supercompact cardinals. In this paper, it is shown that under the Ultrapower Axiom, the least strongly compact cardinal is supercompact. A number of stronger results are established, setting the stage for (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
    		•
  • Club-guessing, stationary reflection, and coloring theorems.Todd Eisworth - 2010 - Annals of Pure and Applied Logic 161 (10):1216-1243.
    We obtain very strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. In particular, the simplest of our results establishes that if μ is singular and , then there is a regular cardinal θ<μ such that any fewer than cf stationary subsets of must reflect simultaneously.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • On descendingly complete ultrafilters.Karel Prikry - 1973 - In A. R. D. Mathias & H. Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York: Springer Verlag. pp. 459--488.
    Direct download  
     
    Export citation  
     
    Bookmark   6 citations