Monotone Boolean functions capture their primes
  It is shown that monotone Boolean functions on the Boolean cube capture the expected number of primes, under he usual identification by binary expansion. This answers a question posed by G.Kalai. 
Jean Bourgain
math.NT