Timeline for The Covering Lemma for L[U]
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 24, 2011 at 22:28 | comment | added | Eran | These are the comparison (in L[U]) or condensation (in L) lemmas. The covering lemma for L shows how to cover a set X of ordinals with a proper-sized constructible set Y (by induction on sup(X)). Recursion theory/fine structure is needed in order to show how Y can be "squeezed" to a proper size. I was looking for high-level description on how to modify that proof to L[U] - what are the key differences and when do the indiscernibles pop up. This should probably help in reading Mitchell's handbook proof (ch 3), or maybe the original Dodd and Jensen's paper? | |
| Oct 24, 2011 at 21:04 | history | answered | Andreas Blass | CC BY-SA 3.0 |