Foundational theories of Computer Science would be rendered

inconsistent if they allowed the construction of the

proposition I'mFalse or the [Gödel 1931] proposition

I'mUnprovable using fixed points.

    Fortunately, orders on propositions prohibit the 
    construction of the proposition *I'mFalse* and also 
    prohibit the construction of the [Gödel 1931] 
    proposition *I'mUnprovable*.