PP-2004-22: Bold, Stefan and Löwe, Benedikt (2004) A simple inductive argument to compute more Kleinberg sequences under the Axiom of Determinacy. [Report]
Preview |
Text (Full Text)
PP-2004-22.text.pdf Download (119kB) | Preview |
![[thumbnail of Abstract]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Abstract)
PP-2004-22.abstract.txt Download (746B) |
Abstract
A characteristic feature of infinitary combinatorics under the Axiom
of Determinacy is the existence of sequences of partition cardinals,
called Kleinberg sequences. It is well known that there are lots of
Kleinberg sequences below aleph-(epsilon-0), but the exact values of
their elements is still unknown. In this note, we give a simple
inductive argument that allows to compute the Kleinberg sequences
corresponding to the (omega-1)-cofinal measures on the odd projective
ordinals without doing any detailed ultrapower analyses.
| Item Type: | Report |
|---|---|
| Report Nr: | PP-2004-22 |
| Series Name: | Prepublication (PP) Series |
| Year: | 2004 |
| Uncontrolled Keywords: | infinitary combinatorics; strong partition cardinal; infinite games |
| Depositing User: | Benedikt |
| Date Deposited: | 12 Oct 2016 14:36 |
| Last Modified: | 12 Oct 2016 14:36 |
| URI: | https://eprints.illc.uva.nl/id/eprint/133 |
Actions (login required)
 |
View Item |
