This is only approximately true. What really is a straightforward formalized version of the liar paradox is Tarski's undefinability theorem, which is what's dem

This is only approximately true. What really is a straightforward formalized version of the liar paradox is Tarski's undefinability theorem, which is what's demonstrated in the blogpost. Goedel's incompleteness sentence is more like inspired by the liar sentence rather than being its formalization; and the proof of Goedel's incompleteness is much more challenging than the simple true->false->true bounce of the liar paradox.