Hi

I have a problem which i couldn't solve

could somebody help me

1. Give a recursive definition ofthe lengthof a well formed formula, that is of the number of symbols occuring in it . for example the length of (p ^ (¬q)) is 8.

2. show that there is no well formed formula of length 2,3 and 6 , but any other positive length is possible

Please respond as soon as possible