m

F Nous contacter


0

Documents  03E55 | enregistrements trouvés : 5

O
     

-A +A

P Q

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

Generalized descriptive set theory has mostly been developed for uncountable cardinals satisfying the condition $\kappa ^{< \kappa }=\kappa$ (thus in particular for $\kappa$ regular). More recently the case of uncountable cardinals of countable cofinality has attracted some attention, partially because of its connections with very large cardinal axioms like I0. In this talk I will survey these recent developments and propose a unified approach which potentially could encompass all possible scenarios (including singular cardinals of arbitrary cofinality).
Generalized descriptive set theory has mostly been developed for uncountable cardinals satisfying the condition $\kappa ^{< \kappa }=\kappa$ (thus in particular for $\kappa$ regular). More recently the case of uncountable cardinals of countable cofinality has attracted some attention, partially because of its connections with very large cardinal axioms like I0. In this talk I will survey these recent developments and propose a unified approach w...

03E15 ; 03E55 ; 54A05

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

By the Cantor-Bendixson theorem, subtrees of the binary tree on $\omega$ satisfy a dichotomy - either the tree has countably many branches or there is a perfect subtree (and in particular, the tree has continuum manybranches, regardless of the size of the continuum). We generalize this to arbitrary regular cardinals $\kappa$ and ask whether every $\kappa$-tree with more than $\kappa$ branches has a perfect subset. From large cardinals, this statement isconsistent at a weakly compact cardinal $\kappa$. We show using stacking mice that the existence of a non-domestic mouse (which yields a model with a proper class of Woodin cardinals and strong cardinals) is a lower bound. Moreover, we study variants of this statement involving sealed trees, i.e. trees with the property that their set of branches cannot be changed by certain forcings, and obtain lower bounds for these as well. This is joint work with Yair Hayut.
By the Cantor-Bendixson theorem, subtrees of the binary tree on $\omega$ satisfy a dichotomy - either the tree has countably many branches or there is a perfect subtree (and in particular, the tree has continuum manybranches, regardless of the size of the continuum). We generalize this to arbitrary regular cardinals $\kappa$ and ask whether every $\kappa$-tree with more than $\kappa$ branches has a perfect subset. From large cardinals, this ...

03E45 ; 03E35 ; 03E55 ; 03E05

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

We will analyze consequences of various types of Prikry forcing on combinatorial properties at singular cardinals and their successors, focusing on weak square and simultaneous stationary reflection. The motivation is how much compactness type properties can be obtained at successors of singulars, and especially the combinatorics at $\aleph_{\omega+1}$.

03E04 ; 03E35 ; 03E55

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

The combinatorics of successors of singular cardinals presents a number of interesting open problems. We discuss the interactions at successors of singular cardinals of two strong combinatorial properties, the stationary set reflection and the tree property. Assuming the consistency of infinitely many supercompact cardinals, we force a model in which both the stationary set reflection and the tree property hold at $\aleph_{\omega^2+1}$. Moreover, we prove that the two principles are independent at this cardinal, indeed assuming the consistency of infinitely many supercompact cardinals it is possible to force a model in which the stationary set reflection holds, but the tree property fails at $\aleph_{\omega^2+1}$. This is a joint work with Menachem Magidor.
Keywords : forcing - large cardinals - successors of singular cardinals - stationary reflection - tree property
The combinatorics of successors of singular cardinals presents a number of interesting open problems. We discuss the interactions at successors of singular cardinals of two strong combinatorial properties, the stationary set reflection and the tree property. Assuming the consistency of infinitely many supercompact cardinals, we force a model in which both the stationary set reflection and the tree property hold at $\aleph_{\omega^2+1}$. ...

03E05 ; 03E35 ; 03E55

Déposez votre fichier ici pour le déplacer vers cet enregistrement.

In 1971 Baumgartner showed it is consistent that any two $\aleph_1$-dense subsets of the real line are order isomorphic. This was important both for the methods of the proof and for consequences of the result. We introduce methods that lead to an analogous result for $\aleph_2$-dense sets.

Keywords : forcing - large cardinals - Baumgartner isomorphism - infinitary Ramsey principles - reflection principles

03E35 ; 03E05 ; 03E50 ; 03E55 ; 03E57

Z