Essay talk:Gödel's incompleteness theorem simply explained

Hi, I'm trying to grasp this and I have a question: What would the command NP NP do?

It's nested. So "(I cannot print (I cannot print (statement)))". It's a double negative like "I ain't seen nuthin'". ^postate 10:49, 21 May 2013 (UTC)

So, if we imagine a truth table of sorts. The left is the command, the right is what "statement" must be for it to work.

(Statement) -> statement=true

(I cannot print (statement)) -> statement=false

(I cannot print (I cannot print (statement))) -> statement=true

The liar paradox is probably something worth going over, too. ^narchist 10:51, 21 May 2013 (UTC)

Thank you for your reply. So, following the examples given in the essay, it works like this:

(At 12:00 noon) Me: NP NP it is daytime. Printer: NP NP it is daytime.

Now my question is if "NP NP" is like "NDP NDP" and G = " 'I can never say G' is true" and also serves as an example for the point of the essay.