Guessing clubs in the generalized club filter

Bernhard König; Paul Larson; Yasuo Yoshinobu

Fundamenta Mathematicae (2007)

  • Volume: 195, Issue: 2, page 177-191
  • ISSN: 0016-2736

Abstract

top
We present principles for guessing clubs in the generalized club filter on κ λ . These principles are shown to be weaker than classical diamond principles but often serve as sufficient substitutes. One application is a new construction of a λ⁺-Suslin-tree using assumptions different from previous constructions. The other application partly solves open problems regarding the cofinality of reflection points for stationary subsets of [ λ ] .

How to cite

top

Bernhard König, Paul Larson, and Yasuo Yoshinobu. "Guessing clubs in the generalized club filter." Fundamenta Mathematicae 195.2 (2007): 177-191. <http://eudml.org/doc/286332>.

@article{BernhardKönig2007,
abstract = {We present principles for guessing clubs in the generalized club filter on $_\{κ\}λ$. These principles are shown to be weaker than classical diamond principles but often serve as sufficient substitutes. One application is a new construction of a λ⁺-Suslin-tree using assumptions different from previous constructions. The other application partly solves open problems regarding the cofinality of reflection points for stationary subsets of $[λ]^\{ℵ₀\}$.},
author = {Bernhard König, Paul Larson, Yasuo Yoshinobu},
journal = {Fundamenta Mathematicae},
keywords = {club guessing; diamond principles; iterated forcing},
language = {eng},
number = {2},
pages = {177-191},
title = {Guessing clubs in the generalized club filter},
url = {http://eudml.org/doc/286332},
volume = {195},
year = {2007},
}

TY - JOUR
AU - Bernhard König
AU - Paul Larson
AU - Yasuo Yoshinobu
TI - Guessing clubs in the generalized club filter
JO - Fundamenta Mathematicae
PY - 2007
VL - 195
IS - 2
SP - 177
EP - 191
AB - We present principles for guessing clubs in the generalized club filter on $_{κ}λ$. These principles are shown to be weaker than classical diamond principles but often serve as sufficient substitutes. One application is a new construction of a λ⁺-Suslin-tree using assumptions different from previous constructions. The other application partly solves open problems regarding the cofinality of reflection points for stationary subsets of $[λ]^{ℵ₀}$.
LA - eng
KW - club guessing; diamond principles; iterated forcing
UR - http://eudml.org/doc/286332
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.