Displaying similar documents to “A dichotomy theorem for mono-unary algebras”

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.

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).

Gaussian automorphisms whose ergodic self-joinings are Gaussian

Mariusz Lemańczyk, F. Parreau, J. Thouvenot (2000)

Fundamenta Mathematicae

Similarity:

 We study ergodic properties of the class of Gaussian automorphisms whose ergodic self-joinings remain Gaussian. For such automorphisms we describe the structure of their factors and of their centralizer. We show that Gaussian automorphisms with simple spectrum belong to this class.  We prove a new sufficient condition for non-disjointness of automorphisms giving rise to a better understanding of Furstenberg's problem relating disjointness to the lack of common factors....

A Nielsen theory for intersection numbers

Christopher McCord (1997)

Fundamenta Mathematicae

Similarity:

Nielsen theory, originally developed as a homotopy-theoretic approach to fixed point theory, has been translated and extended to various other problems, such as the study of periodic points, coincidence points and roots. In this paper, the techniques of Nielsen theory are applied to the study of intersections of maps. A Nielsen-type number, the Nielsen intersection number NI(f,g), is introduced, and shown to have many of the properties analogous to those of the Nielsen fixed point number....