The Tarski's undefinability theorem cardTarski's undefinability theorem

Tarski's undefinability theorem

Common

Rarity: Common

The most frequent rarity: most Wikipedia articles become Commons.

Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.

At a glance

Class
Notion
Domain
Science and technology
In collections
Nobody has pulled it yet.

What Wikipedia says

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".

Excerpt from the Wikipedia article “Tarski's undefinability theorem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia

Image: George Bergman, CC BY-SA 4.0, via Wikimedia Commons.

Open free boosters and add Tarski's undefinability theorem to your collection.

Play for free

Related cards