Title
The non-compactness of square
Abstract
This note gives proves two theorems. The first is that it is consistent to have !n for every n, but not have @!. This is done by carefully collapsing a supercompact cardinal and adding square sequences to each !n. The crux of the proof is that in the resulting model every stationary subset of @!+1\cof(!) reflects to an ordinal of cofinality !1, that is to say it has stationary intersection with such an ordinal. This result contrasts with compactness properties of square shown in (3). In that paper it is shown that if one has square at every !n, then there is a square type sequence on the points of cofinality !k, k > 1 in @!+1. In particular at points of cofinality greater than !1 there is a strongly non-reflecting stationary set of points of countable cofinality. The second result answers a question of Dzamonja, by showing that there can be no squarelike sequence above a supercompact cardinal, where "squarelike" means that one replaces the requirement that the cofinal sets be closed and unbounded by the requirement that they be stationary at all points of uncountable cofinality. 2. Some Lemmas
Year
DOI
Venue
2003
10.2178/jsl/1052669068
JOURNAL OF SYMBOLIC LOGIC
DocType
Volume
Issue
Journal
68
2
ISSN
Citations 
PageRank 
0022-4812
2
0.58
References 
Authors
2
3
Name
Order
Citations
PageRank
James Cummings17913.41
Matthew Foreman29218.02
Menachem Magidor31369140.76