A constructive proof of Tarski's undefinability theorem and Gödel's incompleteness theorems | Synapse