Switch to: References

Citations of:

Games and trees in infinitary logic: A survey

In M. Krynicki, M. Mostowski & L. Szczerba (eds.), Quantifiers: Logics, Models and Computation. Kluwer Academic Publishers. pp. 105--138 (1995)

Add citations

You must login to add citations.
  1. Almost free groups and long Ehrenfeucht–Fraı̈ssé games.Pauli Väisänen - 2003 - Annals of Pure and Applied Logic 123 (1-3):101-134.
    An Abelian group G is strongly λ -free iff G is L ∞, λ -equivalent to a free Abelian group iff the isomorphism player has a winning strategy in an Ehrenfeucht–Fraı̈ssé game of length ω between G and a free Abelian group. We study possible longer Ehrenfeucht–Fraı̈ssé games between a nonfree group and a free Abelian group. A group G is called ε -game-free if the isomorphism player has a winning strategy in an Ehrenfeucht–Fraı̈ssé game of length ε between G (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Large cardinals and definable well-orders, without the GCH.Sy-David Friedman & Philipp Lücke - 2015 - Annals of Pure and Applied Logic 166 (3):306-324.
    Download  
     
    Export citation  
     
    Bookmark   2 citations