Tarski's Undefinability Theorem and first-order arithmetic
Logic
2025-09-19 v7
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.
Keywords
Cite
@article{arxiv.1003.4483,
title = {Tarski's Undefinability Theorem and first-order arithmetic},
author = {Stephen Boyce},
journal= {arXiv preprint arXiv:1003.4483},
year = {2025}
}