Displaying similar documents to “Two dichotomy theorems on colourability of non-analytic graphs”

On regular interstices and selective types in countable arithmetically saturated models of Peano Arithmetic

Teresa Bigorajska, Henryk Kotlarski, James Schmerl (1998)

Fundamenta Mathematicae

Similarity:

We continue the earlier research of [1]. In particular, we work out a class of regular interstices and show that selective types are realized in regular interstices. We also show that, contrary to the situation above definable elements, the stabilizer of an element inside M(0) whose type is selective need not be maximal.

Embedding partially ordered sets into ω ω

Ilijas Farah (1996)

Fundamenta Mathematicae

Similarity:

We investigate some natural questions about the class of posets which can be embedded into ⟨ω,≤*⟩. Our main tool is a simple ccc forcing notion H E which generically embeds a given poset E into ⟨ω,≤*⟩ and does this in a “minimal” way (see Theorems 9.1, 10.1, 6.1 and 9.2).

Chains and antichains in Boolean algebras

M. Losada, Stevo Todorčević (2000)

Fundamenta Mathematicae

Similarity:

We give an affirmative answer to problem DJ from Fremlin’s list [8] which asks whether M A ω 1 implies that every uncountable Boolean algebra has an uncountable set of pairwise incomparable elements.