Consider propositional wffs that contain only the connectives `, ~, and S (no negation)
Chapter 2, Problem 75(choose chapter or problem)
Consider propositional wffs that contain only the connectives `, ~, and S (no negation) and where wffs must be parenthesized when joined by a logical connective. Count each statement letter, connective, or parenthesis as one symbol. For example, ((A) ` (B)) ~ ((C) ` (D)) is such a wff, with 19 symbols. Prove that any such wff has an odd number of symbols
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer