Symmetries between two Ramsey properties

  title={Symmetries between two Ramsey properties},
  author={Lorenz Halbeisen},
  journal={Archive for Mathematical Logic},
  • L. Halbeisen
  • Published 1 June 1998
  • Mathematics
  • Archive for Mathematical Logic
Abstract. In this article we compare the well-known Ramsey property with a dual form of it, the so called dual-Ramsey property (which was suggested first by Carlson and Simpson). Even if the two properties are different, it can be shown that all classical results known for the Ramsey property also hold for the dual-Ramsey property. We will also show that the dual-Ramsey property is closed under a generalized Suslin operation (the similar result for the Ramsey property was proved by Matet… 

Techniques for approaching the dual Ramsey property in the projective hierarchy

We define the dualizations of objects and concepts which are essential for investigating the Ramsey property in the first levels of the projective hierarchy, prove a forcing equivalence theorem for

Ramseyan ultrafilters

We investigate families of partitions of ω which are related to special coideals, so-called happy families, and give a dual form of Ramsey ultrafilters in terms of partitions. The combinatorial


The Ramsey theory of the space of equivalence relations with infinite quotients defined on the set N of natural numbers is an interesting field of research. We view this space as a topological Ramsey

Combinatorial Properties of Sets of Partitions

In this chapter we shall investigate combinatorial properties of sets of partitions of ω, where we try to combine as many topics or voices (to use a musical term) as possible. As explained in Chapter

On the structure of perfect sets in various topologies associated with tree forcings

We prove that the Ellentuck, Hechler and dual Ellentuck topologies are perfect isomorphic to one another. This shows that the structure of perfect sets in all these spaces is the same. We prove this

The Shattering Number Revisited

In this chapter we shall have a closer look at the shattering number \(\mathfrak {h}\). In the preceding chapter, \(\mathfrak {h}\) was introduced as the minimum height of a shattering matrix.

On asymptotic models in Banach Spaces

AbstractA well known application of Ramsey’s Theorem to Banach Space Theory is the notion of a spreading model $$(\tilde e_i )$$ of a normalized basic sequence (xi) in a Banach spaceX. We show how

Ramseyan ultra(cid:12)lters

. We investigate families of partitions of ! which are related to special coideals, so-called happy families, and give a dual form of Ramsey ultra(cid:12)lters in terms of partitions. The

A generalization of the Dual Ellentuck Theorem

Abstract. We prove versions of the Dual Ramsey Theorem and the Dual Ellentuck Theorem for families of partitions which are defined in terms of games.



On the Ramsey property for sets of reals

A certain two-person game is presented such that if either player has a winning strategy then a homogeneous set for the partition can be constructed, and alternative proofs of some of the known results are given.

Partitions and filters

  • P. Matet
  • Mathematics
    Journal of Symbolic Logic
  • 1986
The author undertook to study the notion dual to that of a Ramsey ultrafilter, and establishes some basic properties of the lattice of all partitions of a cardinal κ, and introduces co-Ramsey filters, which can be associated with Ramsey ultrafilters.

Happy families and completely Ramsey sets

Games of Kastanas are used to obtain a new characterization of the classCℱ of all sets that are completely Ramsey with respect to a given happy family ℱ and ideas of Plewik are combined to give a uniform proof of various results of Ellentuck, Louveau, Mathias and Milliken concerning the extent of Cℽ.

A Dual Form of Ramsey's Theorem

On Shattering, Splitting and Reaping Partitions

Using some properties of the ideal 𝔍 of nowhere dual-Ramsey sets, which is an ideal over the set of partitions of ω, it is shown that add(𝔊) = cov(𝓂) = ℌ and it is can be shown thatℌ > ω1 is consistent with ZFC and as a corollary the authors get the relative consistency of ℍ > t, where t is the tower number.


A preservation theorem is a theorem of the form: "If hP�,Q� : � < �i is an iteration of forcing notions, and every Qsatisfies ' in V P� , then Psatisfies '." We give a simplified version of a general

Combinatorics and Forcing with Distributive Ideals

  • P. Matet
  • Mathematics
    Ann. Pure Appl. Log.
  • 1997

A new proof that analytic sets are Ramsey

Abstract We give a direct mathematical proof of the Mathias-Silver theorem that every analytic set is Ramsey.

Δ 1 2 -sets of reals

Etablissement d'une chaine d'implications uniques entre quatre notions pour les ensembles de reels

Set Theory: On the Structure of the Real Line

This research level monograph reflects the current state of the field and provides a reference for graduate students entering the field as well as for established researchers.