Aronszajn lines and the club filter

Journal of Symbolic Logic 73 (3):1029-1035 (2008)
  Copy   BIBTEX

Abstract

The purpose of this note is to demonstrate that a weak form of club guessing on ω1 implies the existence of an Aronszajn line with no Countryman suborders. An immediate consequence is that the existence of a five element basis for the uncountable linear orders does not follow from the forcing axiom for ω-proper forcings

Categories

Keywords

Reprint years

DOI

10.2178/jsl/1230396763

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,607

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A forcing axiom for a non-special Aronszajn tree.John Krueger - 2020 - Annals of Pure and Applied Logic 171 (8):102820.
Proper forcing, cardinal arithmetic, and uncountable linear orders.Justin Tatch Moore - 2005 - Bulletin of Symbolic Logic 11 (1):51-60.
Some results about (+) proved by iterated forcing.Tetsuya Ishiu & Paul B. Larson - 2012 - Journal of Symbolic Logic 77 (2):515-531.
A Tail Club Guessing Ideal Can Be Saturated without Being a Restriction of the Nonstationary Ideal.Tetsuya Ishiu - 2005 - Notre Dame Journal of Formal Logic 46 (3):327-333.
Creatures on ω 1 and weak diamonds.Heike Mildenberger - 2009 - Journal of Symbolic Logic 74 (1):1-16.
Specializing Aronszajn Trees with Strong Axiom A and Halving.Heike Mildenberger & Saharon Shelah - 2019 - Notre Dame Journal of Formal Logic 60 (4):587-616.
Gap structure after forcing with a coherent Souslin tree.Carlos Martinez-Ranero - 2013 - Archive for Mathematical Logic 52 (3-4):435-447.
ℙmax variations for separating club guessing principles.Tetsuya Ishiu & Paul B. Larson - 2012 - Journal of Symbolic Logic 77 (2):532-544.
Can a small forcing create Kurepa trees.Renling Jin & Saharon Shelah - 1997 - Annals of Pure and Applied Logic 85 (1):47-68.
Specialising Aronszajn trees by countable approximations.Heike Mildenberger & Saharon Shelah - 2003 - Archive for Mathematical Logic 42 (7):627-647.

Analytics

Added to PP
2010-09-12

Downloads
36 (#618,922)

6 months
13 (#242,872)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Set mapping reflection.Justin Tatch Moore - 2005 - Journal of Mathematical Logic 5 (1):87-97.

Add more references