Matches a string if the string represents a Well-Formed-Formula in a Truth-Functional-Logic with the symbols {⊥, ¬, ∧, ∨, →, ↔} The rules are as follows: https://en.wikipedia.org/wiki/Well-formed_formula#Propositional_calculus (Outside parenthesis are omitted)