Switch to: Citations

Add references

You must login to add references.
  1. On Potential Isomorphism and Non-Structure.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 2004 - Archive for Mathematical Logic 43 (1):85-120.
    We show in the paper that for any non-classifiable countable theory T there are non-isomorphic models and that can be forced to be isomorphic without adding subsets of small cardinality. By making suitable cardinal arithmetic assumptions we can often preserve stationary sets as well. We also study non-structure theorems relative to the Ehrenfeucht-Fraïssé game.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Stationary Logic and its Friends. II.Alan H. Mekler & Saharon Shelah - 1986 - Notre Dame Journal of Formal Logic 27 (1):39-50.
  • Countable Approximations and Löwenheim-Skolem Theorems.David W. Kueker - 1977 - Annals of Mathematical Logic 11 (1):57.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   24 citations  
  • Large Cardinals and Definable Counterexamples to the Continuum Hypothesis.Matthew Foreman & Menachem Magidor - 1995 - Annals of Pure and Applied Logic 76 (1):47-97.
    In this paper we consider whether L(R) has “enough information” to contain a counterexample to the continuum hypothesis. We believe this question provides deep insight into the difficulties surrounding the continuum hypothesis. We show sufficient conditions for L(R) not to contain such a counterexample. Along the way we establish many results about nonstationary towers, non-reflecting stationary sets, generalizations of proper and semiproper forcing and Chang's conjecture.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   35 citations  
  • More Game-Theoretic Properties of Boolean Algebras.Thomas J. Jech - 1984 - Annals of Pure and Applied Logic 26 (1):11-29.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  • On the $\kappa$ -Cub Game on $\lambda $ and $I[\lambda ]$.Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 1999 - Archive for Mathematical Logic 38 (8):549-557.
    We discuss the relationships between the notions of $\kappa $ -cub game on $\lambda $ , $\kappa $ -cub subset of $\lambda $ , the ideal of good subsets of $\lambda $ and the problem of adding a $\kappa $ -cub into a given $\kappa $ -stationary subset of $\lambda $ . We also give a short introduction to the ideal of good subsets of $\lambda $.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • More on the Cut and Choose Game.Jindřich Zapletal - 1995 - Annals of Pure and Applied Logic 76 (3):291-301.
    The cut and choose game is one of the infinitary games on a complete Boolean algebra B introduced by Jech. We prove that existence of a winning strategy for II in implies semiproperness of B. If the existence of a supercompact cardinal is consistent then so is “for every 1-distributive algebra B II has a winning strategy in ”.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the Weak Distributivity Game.Anastasis Kamburelis - 1994 - Annals of Pure and Applied Logic 66 (1):19-26.
    We study the gameGfin related to weak distributivity of a given Boolean algebraB. Consider the following implication: ifBis weakly -distributive then player I does not have a winning strategy in the gameGfin. We show that this implication is true for properBbut it is not true in general.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Perfect-Set Forcing for Uncountable Cardinals.Akihiro Kanamori - 1980 - Annals of Mathematical Logic 19 (1-2):97-114.