Semantic Proof of Tarski's Undefinability of Arithmetic Truth

357 Views Asked by At

A few years ago I took a logic course and I've since lost my notes. I seem to remember a very semantic proof of Tarski's theorem on the undefinability of arithmetic truth, one that didn't use the diagonalization lemma or Godel numbering. If my memory serves it was almost totally model-theoretic. The wikipedia page mentions a semantic proof using Post's theorem but I'm fairly confident that wasn't used in the course. It's very possible that I'm just misremembering but I wonder if this rings a bell for anyone. Thank you.