Definition:Balanced String

Definition
Let $S$ be a string in the alphabet of some propositional or predicate calculus.

Then $S$ is said to be balanced iff it contains equally many left and right parentheses $($ and $)$.

Also see

 * All WFFs of PropCalc are Balanced