1. The problem statement, all variables and given/known data I'm trying to figure out how many unique (non-equivalent) logical statements are possible with n statements...I think I could figure that out as soon as I see a pattern so I would like to know how many are possible for 2 statements and for 3 statements 2. Relevant equations 3. The attempt at a solution I know that for 1 statement there are two possibilities, namely, P and ~p. I think for two there are twelve possibilities: P,Q,~P,~Q, PVQ, P^Q, ~(PVQ),~(P^Q),P=>Q,Q=>P,Q<=>P,~(Q<=>P)..are those all the possibilities for 2 statements?