Tarski's undefinability theorem
Theorem that arithmetical truth cannot be defined in arithmetic / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Tarski's undefinability theorem?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
Tarski's undefinability theorem, stated and proved by Alfred Tarski in 1933, is an important limitative result in mathematical logic, the foundations of mathematics, and in formal semantics. Informally, the theorem states that "arithmetical truth cannot be defined in arithmetic".[1]
This article includes a list of general references, but it lacks sufficient corresponding inline citations. (August 2023) |
The theorem applies more generally to any sufficiently strong formal system, showing that truth in the standard model of the system cannot be defined within the system.