Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/specialising-aronszajn-trees-by-countable-approximations-YD0n9IAiUt
References (7)
-
A. Blass, S. Shelah (1987)
There may be simple Paleph1 and Paleph2-points and the Rudin-Keisler ordering may be downward directedAnn. Pure Appl. Log., 33
-
(1983)
Iterated forcing Surveys in Set Theory, volume 8 of London Math. Soc. Lecture Notes Ser -
A. Roslanowski, S. Shelah (1997)
Norms on Possibilities II: More CCC Ideals on 2 ω, 3
-
S. Shelah (1998)
Proper and Improper Forcing -
79104 Freiburg im Breisgau -
A-1090 Wien, Austria Saharon Shelah -
A. Roslanowski, S. Shelah (1998)
Norms on Possibilities I: Forcing With Trees and Creatures
- Publisher
- Springer Journals
- Copyright
- Copyright © 2003 by Springer-Verlag Berlin Heidelberg
- Subject
- Mathematics
- ISSN
- 0933-5846
- eISSN
- 1432-0665
- DOI
- 10.1007/s00153-002-0168-5
- Publisher site
- See Article on Publisher Site
Abstract
We show that there are proper forcings based upon countable trees of creatures that specialise a given Aronszajn tree.
Journal
Archive for Mathematical Logic – Springer Journals
Published: Jun 13, 2003