- a formal system is complete if for every one of its statements i.e $P$, either $P$ or $\neg P$ can be proven