I've always been bothered by the use of informal English commonplace in the metalanguage of logic or mathematics texts, which although efficient, is possibly ambiguous.
For some (make up your own if you want) informal and restricted (e.g. Stating P∧Q only as "P and Q" or or "The conjunction of P and Q" if preceded by another connective) language, can there be a unique parsing/readability theorem of it?