Here is a hard one, for me...

Hi again all,

On my Logic problem set, I have been given the following and I'm not
really sure if what I have is right. Could anyone show me the best way
to prove the following:

"The binary connections of SL are &, v, horseshoe, triple lines (ie.
all the connectives except ~). Prove by induction that all sentences of
SL have the same number of open brackets as binary connections."

I am working on the problem now, but it takes me a long time. I've only
been in this class for one week. An answer and any pointers on what to
look out for etc, would be VERY helpful.

Thanks!

.

Quantcast