# why it is safe

**Why Gödel has nothing to grab there**

Gödel’s theorem has a condition: the system must be strong enough to talk about itself. To build the self-pointing sentence, a system has to turn statements and proofs into numbers and say things like “this number encodes a valid proof of that number”. Checking a proof mixes addition and multiplication together. With only one of them the system cannot express that, so it cannot build the sentence.

It is like the robot that explodes when told “this sentence is false”. A robot with no way to understand self-reference cannot be tricked that way. The price is that the system is safe because it is weak.

Connects to:
- [Skolem, only ×](https://mapideas.org/i/s_skolem)
- [the threshold](https://mapideas.org/i/s_thr)

Source: https://mapideas.org/i/s_safe · open on the map: https://mapideas.org/#s_safe