A threshold property for intersections in a finite set

Let F be any family of subsets of a finite set E and let n be an integer, n<|F|. Under what condition does the knowledge of cardinals of m-intersections in F, for all m≤n, univocally determine the cardinal of any intersection in F, and what is the minimal condition? We give a complete answer to that. For any n, this determination property is satisfied by n if and only if |E|<2ⁿ, without further condition on F.