Let L the language of classical (two-valued) propositional logic consisting of a denumerable set of sentential variables as well as the usual operations of negation, disjunction, conjunction, implication, and equivalence.
Are all formulas of L sentences?