Sciweavers

JSYML
2000

Stationary Sets and Infinitary Logic

14 years 10 days ago
Stationary Sets and Infinitary Logic
Let K0 be the class of structures , <, A , where A is disjoint from a club, and let K1 be the class of structures , <, A , where A contains a club. We prove that if = < is regular, then no sentence of L+ separates K0 and K1 . On the other hand, we prove that if =
Saharon Shelah, Jouko A. Väänänen
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where JSYML
Authors Saharon Shelah, Jouko A. Väänänen
Comments (0)