3 ms·

Yes, this is the way to correctly prove "incompleteness", i.e that there are preferentially undecidable propositions in powerful theories of computer science.

• ProfHewitt 6y ago
  Of course, I meant to say "inferentially undecidable" instead of "preferentially undecidable". Being inferentially undecidable means that it is not the case that for every proposition, there is either a proof of the proposition or its negation. Inferential undecidablity implies "incompleteness" in the sense that it is not the case that every true proposition can be proved.