Displaying similar documents to “On systems of null sets”

Properties of forcing preserved by finite support iterations

Miroslav Repický (1991)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We shall investigate some properties of forcing which are preserved by finite support iterations and which ensure that unbounded families in given partially ordered sets remain unbounded.

A characterization of some additive arithmetical functions, III

Jean-Loup Mauclaire (1999)

Acta Arithmetica

Similarity:

I. Introduction. In 1946, P. Erdős [2] proved that if a real-valued additive arithmetical function f satisfies the condition: f(n+1) - f(n) → 0, n → ∞, then there exists a constant C such that f(n) = C log n for all n in ℕ*. Later, I. Kátai [3,4] was led to conjecture that it was possible to determine additive arithmetical functions f and g satisfying the condition: there exist a real number l, a, c in ℕ*, and integers b, d such that f(an+b) - g(cn+d) → l, n → ∞. This problem...