Return to Revisions

Gödels incompleteness theorem in the language of modal logic (where $\Box\varphi$ means that $\varphi$ is provable - say in Peano Arithmetic - and $\bot=\lnot \top$ is any false statement): $$\Box \lnot \Box \bot \Rightarrow \Box \bot.$$