\begin{definition}[Definition:Consistent (Logic)/Proof System]
Let $\LL$ be a logical language.
Let $\mathscr P$ be a proof system for $\LL$.
Then $\mathscr P$ is '''consistent''' {{iff}}:
:There exists a logical formula $\phi$ such that $\not \vdash_{\mathscr P} \phi$
That is, some logical formula $\phi$ is '''not''' a theorem of $\mathscr P$.
\end{definition}