### WFFs for Propositional Logic (External Paranthesises Excluded)

Matches strings that are Well-formed-formulas in Propositional with the following symbols
{⊤,⊥,∧,∨,¬,→,↔}
This matches with formulas that are looser then defined by formal syntax (See https://en.wikipedia.org/wiki/Well-formed_formula#Propositional_calculus). Namely, it's able to match with
\> No Ext...

Submitted by Gabriel Weredyk - 2 months ago (Last modified a month ago)