This post is an extension of the previous one; I want to address Tarski’s Undefinability Theorem using computability-theoretic methods. Continue reading

# truth

# Arithmetic, Self-Reference and Truth

There is a remarkable theorem in mathematical logic that “Truth is not definable”. This is known as Tarski’s Undefinability Theorem. This result (along with GĂ¶del’sÂ Incompleteness Theorems) has fascinated me ever since I learned about it. This theorem (in a sense) shows us the limits of the ability to study truth within a given formal system. Continue reading