Proof Writing & Problem Solving · Superchallenge problem

How many different truth tables in $P, Q, R$ can be produced by statements built from the letters $P$, $Q$, $R$ using only "and", "or" and parentheses (each letter may be used any number of times, and no "not")?