Annals of Pure and Applied Logic 60 (3):261-274 (1993)

Abstract
We prove that if is a model of size at most [kappa], λ[kappa] = λ, and a game sentence of length 2λ is true in a 2λ-saturated model ≡ , then player has a winning strategy for a related game in some ultrapower ΠD of . The moves in the new game are taken in the cartesian power λA, and the ultrafilter D over λ must be chosen after the game is played. By taking advantage of the expressive power of game sentences, we obtain several applications showing the existence of ultrapowers with certain properties. In each case, it was previously known that such ultrapowers exist under the assumption of the GCH, and we get them without the GCH. Article O
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/0168-0072(93)90078-r
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 62,363
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Some Applications of Infinitely Long Formulas.H. Jerome Keisler - 1965 - Journal of Symbolic Logic 30 (3):339-349.
The Isomorphism Property Versus the Special Model Axiom.Renling Jin - 1992 - Journal of Symbolic Logic 57 (3):975-987.

View all 16 references / Add more references

Citations of this work BETA

The Strength of the Isomorphism Property.Renling Jin & Saharon Shelah - 1994 - Journal of Symbolic Logic 59 (1):292-301.
Type Two Cuts, Bad Cuts and Very Bad Cuts.Renling Jin - 1997 - Journal of Symbolic Logic 62 (4):1241-1252.

Add more citations

Similar books and articles

Δ1 Ultrapowers Are Totally Rigid.T. G. McLaughlin - 2007 - Archive for Mathematical Logic 46 (5-6):379-384.
Ultrapowers Without the Axiom of Choice.Mitchell Spector - 1988 - Journal of Symbolic Logic 53 (4):1208-1219.
Generalized Prikry Forcing and Iteration of Generic Ultrapowers.Hiroshi Sakai - 2005 - Mathematical Logic Quarterly 51 (5):507-523.
Ultrapowers as Sheaves on a Category of Ultrafilters.Jonas Eliasson - 2004 - Archive for Mathematical Logic 43 (7):825-843.
Craig Interpolation for Networks of Sentences.H. Jerome Keisler & Jeffrey M. Keisler - 2012 - Annals of Pure and Applied Logic 163 (9):1322-1344.
Game Theoretical Semantics and Entailment.D. E. Over - 1981 - Studia Logica 40 (1):67 - 74.
Game Sentences, Recursive Saturation and Definability.Victor Harnik - 1980 - Journal of Symbolic Logic 45 (1):35-46.
On the Cofinality of Ultrapowers.Andreas Blass & Heike Mildenberger - 1999 - Journal of Symbolic Logic 64 (2):727-736.
Self-Knowledge and Moore's Paradox.David M. Rosenthal - 1995 - Philosophical Studies 77 (2-3):195 - 209.
Representation of Game Algebras.Yde Venema - 2003 - Studia Logica 75 (2):239 - 256.

Analytics

Added to PP index
2014-01-16

Total views
10 ( #869,694 of 2,445,471 )

Recent downloads (6 months)
1 ( #457,259 of 2,445,471 )

How can I increase my downloads?

Downloads

My notes