Tarski's Undefinability Theorem and first-order arithmetic
Stephen Boyce
Published: 2010/3/23
Abstract
This paper examines the application of Tarski's Undefinability Theorem to first-order arithmetic. The generally accepted view is that for this case the Theorem establishes that arithmetic truth is not arithmetic. A careful examination of these proofs shows however that they fail on the grounds that the result that is to be established is assumed as a premise.