Counting false entries in truth tables of bracketed formulae connected   by implication
  In this paper we count the number of rows f_n with the value "false" in the truth tables of all bracketed formulae with n distinct variables connected by the binary connective of implication. We find a recurrence and an asymptotic formulae for f_n. We also show that the ratio of f_n to the total number of rows converges to \frac{3-\sqrt{3}}{6}. 
Peter J. Cameron (1) and Volkan Yildiz (2) ((1) Queen Mary University   of London, (2) King's College London)
math.CO math.LO