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 formal semantics. Informally, the theorem states that arithmetical truth cannot be defined in arithmetic. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
StatementNo sufficiently strong formal system can define its own arithmetical truth predicate within itself; informally, arithmetical truth cannot be defined in arithmetic, and more generally truth in a sufficiently rich interpreted language's own standard model cannot be defined inside that same language. 1 Connections
Sources
1. Tarski's undefinability theorem (Wikipedia)
Wikimedia FoundationIntroduction, opening sentence, informal-statement clause
Informally, the theorem states that "arithmetical truth cannot be defined in arithmetic".
Introduction, opening sentence, 1933 attribution clause
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.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.