Stationary sets and infinitary logic

Journal of Symbolic Logic 65 (3):1311-1320 (2000)
  Copy   BIBTEX

Abstract

Let K 0 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ is disjoint from a club, and let K 1 λ be the class of structures $\langle\lambda, , where $A \subseteq \lambda$ contains a club. We prove that if $\lambda = \lambda^{ is regular, then no sentence of L λ+κ separates K 0 λ and K 1 λ . On the other hand, we prove that if $\lambda = \mu^+,\mu = \mu^{ , and a forcing axiom holds (and ℵ L 1 = ℵ 1 if μ = ℵ 0 ), then there is a sentence of L λλ which separates K 0 λ and K 1 λ

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,745

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Stationary Sets and Infinitary Logic.Saharon Shelah & Jouko Vaananen - 2000 - Journal of Symbolic Logic 65 (3):1311-1320.
The Magidor function and diamond.Pierre Matet - 2011 - Journal of Symbolic Logic 76 (2):405 - 417.
On regular reduced products.Juliette Kennedy & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1169-1177.
Hierarchies of Forcing Axioms II.Itay Neeman - 2008 - Journal of Symbolic Logic 73 (2):522 - 542.
The self-iterability of L[E].Ralf Schindler & John Steel - 2009 - Journal of Symbolic Logic 74 (3):751-779.
Slim models of zermelo set theory.A. R. D. Mathias - 2001 - Journal of Symbolic Logic 66 (2):487-496.
A Gitik iteration with nearly Easton factoring.William J. Mitchell - 2003 - Journal of Symbolic Logic 68 (2):481-502.

Analytics

Added to PP
2009-01-28

Downloads
65 (#86,957)

6 months
17 (#859,272)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jouko A Vaananen
University of Helsinki

References found in this work

Internal cohen extensions.D. A. Martin & R. M. Solovay - 1970 - Annals of Mathematical Logic 2 (2):143-178.
Trees and Ehrenfeucht–Fraı̈ssé games.Stevo Todorčević & Jouko Väänänen - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.
Trees and Ehrenfeucht–Fraı̈ssé games.Jouko Väänänen & Stevo Todorcevic - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.

Add more references