Using induction on the complexity of formulas, let's assume that in every proper non-empty initial segment of a propositional formula, the number of left parentheses is greater than or equal to the number of right parentheses.
Note: A proper initial segment of a propositional formula is an expression that starts and continues with the same symbols as but does not include all symbols of .
Any thoughts?