The Tree Property
β Scribed by James Cummings; Matthew Foreman
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 489 KB
- Volume
- 133
- Category
- Article
- ISSN
- 0001-8708
No coin nor oath required. For personal study only.
β¦ Synopsis
We construct a model in which there are no + n -Aronszajn trees for any finite n 2, starting from a model with infinitely many supercompact cardinals. We also construct a model in which there is no } ++ -Aronszajn tree for } a strong limit cardinal of cofinality |, starting from a model with a supercompact cardinal and a weakly compact cardinal above it.
π SIMILAR VOLUMES
We show that a tree language recognized by a deterministic parity automaton is either hard for the co-B uchi level and therefore cannot be recognized by a weak alternating automaton, or is on a very low level in the hierarchy of weak alternating automata. A topological counterpart of this property i