Displaying similar documents to “A binomial representation of the 3x + 1 problem”

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

A dichotomy theorem for mono-unary algebras

Su Gao (2000)

Fundamenta Mathematicae

Similarity:

We study the isomorphism relation of invariant Borel classes of countable mono-unary algebras and prove a strong dichotomy theorem.