Order:
  1.  14
    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  
  2.  10
    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  
  3.  7
    On the [mathematical formula]-cub game on [mathematical formula] and [mathematical formula].Taneli Huuskonen, Tapani Hyttinen & Mika Rautila - 1999 - Archive for Mathematical Logic 38 (8):549-557.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  29
    The Canary tree revisited.Tapani Hyttinen & Mika Rautila - 2001 - Journal of Symbolic Logic 66 (4):1677-1694.
    We generalize the result of Mekler and Shelah [3] that the existence of a canary tree is independent of ZFC + GCH to uncountable regular cardinals. We also correct an error from the original proof.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  22
    Classification theory and 0#.Sy D. Friedman, Tapani Hyttinen & Mika Rautila - 2003 - Journal of Symbolic Logic 68 (2):580-588.
    We characterize the classifiability of a countable first-order theory T in terms of the solvability of the potential-isomorphism problem for models of T.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  6. The Canary Tree Revisited.Tapani Hyttinen & Mika Rautila - 2001 - Journal of Symbolic Logic 66 (4):1677-1694.
    We generalize the result of Mekler and Shelah [3] that the existence of a canary tree is independent of ZFC + GCH to uncountable regular cardinals. We also correct an error from the original proof.
     
    Export citation  
     
    Bookmark