We give a sufficient condition for a set of block subspaces in an infinite-dimensional Banach space to be weakly Ramsey. Using this condition we prove that in the Levy-collapse of a Mahlo cardinal, every projective set is weakly Ramsey. This, together with a construction of W. H. Woodin, is used to show that the Axiom of Projective Determinacy implies that every projective set is weakly Ramsey. In the case of co we prove similar results for a stronger Ramsey property. And for hereditarily indecomposable spaces we show that the Axiom of Determinacy plus the Axiom of Dependent Choices imply that every set is weakly Ramsey. These results are the generalizations to the class of projective sets of some theorems from W. T. Gowers, and our paper "...
This thesis divides naturally into two parts, each concerned with the extent to which the theory of ...
Let ω = {0, 1, 2, ... } be the set of natural numbers and R = ω^ω the set of all infinite sequences ...
AbstractWe study combinatorial principles weaker than Ramsey’s theorem for pairs over the RCA0 (recu...
AbstractIn [10], we have shown that the statement that all ∑11 partitions are Ramsey is deducible ov...
In [1] W. T. Gowers has formulated and proved a Ramsey-type result which lies at the heart of his fa...
An ultrafilter E on (omega) (= set of natural numbers) is called n Ramsey if n is minimal (for E) wi...
In the 90's, Gowers proves a Ramsey-type theorem for block-sequences in Banach spaces, in order to s...
It is shown that, within L(R), the smallest inner model of set theory containing the reals, the axio...
We study the strength of determinacy hypotheses in levels of two hierarchies of subsets of Baire spa...
We prove, using only weak choice principles, that if every set of reals has the Ramsey Property, the...
It is shown that if every real has a sharp and every subset of ω1 is con-structible from a real, the...
2In this course we discuss several results on Infinite Combinatorics, and their ap-plications to Ban...
Dans les années 90, Gowers démontre un théorème de type Ramsey pour les bloc-suites dans les espaces...
International audienceWe use the framework of reverse mathematics to address the question of, given ...
We show that the Gurarij space G and its noncommutative analog NG both have extremely amenable autom...
This thesis divides naturally into two parts, each concerned with the extent to which the theory of ...
Let ω = {0, 1, 2, ... } be the set of natural numbers and R = ω^ω the set of all infinite sequences ...
AbstractWe study combinatorial principles weaker than Ramsey’s theorem for pairs over the RCA0 (recu...
AbstractIn [10], we have shown that the statement that all ∑11 partitions are Ramsey is deducible ov...
In [1] W. T. Gowers has formulated and proved a Ramsey-type result which lies at the heart of his fa...
An ultrafilter E on (omega) (= set of natural numbers) is called n Ramsey if n is minimal (for E) wi...
In the 90's, Gowers proves a Ramsey-type theorem for block-sequences in Banach spaces, in order to s...
It is shown that, within L(R), the smallest inner model of set theory containing the reals, the axio...
We study the strength of determinacy hypotheses in levels of two hierarchies of subsets of Baire spa...
We prove, using only weak choice principles, that if every set of reals has the Ramsey Property, the...
It is shown that if every real has a sharp and every subset of ω1 is con-structible from a real, the...
2In this course we discuss several results on Infinite Combinatorics, and their ap-plications to Ban...
Dans les années 90, Gowers démontre un théorème de type Ramsey pour les bloc-suites dans les espaces...
International audienceWe use the framework of reverse mathematics to address the question of, given ...
We show that the Gurarij space G and its noncommutative analog NG both have extremely amenable autom...
This thesis divides naturally into two parts, each concerned with the extent to which the theory of ...
Let ω = {0, 1, 2, ... } be the set of natural numbers and R = ω^ω the set of all infinite sequences ...
AbstractWe study combinatorial principles weaker than Ramsey’s theorem for pairs over the RCA0 (recu...