Displaying similar documents to “Critères de non-automaticité et leurs applications”

Dyadic diaphony

Peter Hellekalek, Hannes Leeb (1997)

Acta Arithmetica

Similarity:

Combinatorics of open covers (III): games, Cp (X)

Marion Scheepers (1997)

Fundamenta Mathematicae

Similarity:

Some of the covering properties of spaces as defined in Parts I and II are here characterized by games. These results, applied to function spaces of countable tightness, give new characterizations of countable fan tightness and countable strong fan tightness. In particular, each of these properties is characterized by a Ramseyan theorem.

Forcing tightness in products of fans

Jörg Brendle, Tim La Berge (1996)

Fundamenta Mathematicae

Similarity:

We prove two theorems that characterize tightness in certain products of fans in terms of families of integer-valued functions. We also define several notions of forcing that allow us to manipulate the structure of the set of functions from some cardinal θ to ω, and hence, the tightness of these products. These results give new constructions of first countable <θ-cwH spaces that are not ≤θ-cwH.