Theorem

Tennenbaum's Theorem

Logic and Foundations

Tennenbaum's theorem, named for Stanley Tennenbaum who presented it in 1959, is a result in mathematical logic stating that no countable nonstandard model of first-order Peano arithmetic can be recursive. 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

Classification

Statement Form

Impossibility Theorem 1

Proof Year

1959 1

Connections

Has Statement Form

Impossibility Theorem

In Branch

Logic and Foundations

Source Tennenbaum's theorem (Wikipedia)

Principal Result Of

Stanley Tennenbaum

Source Stanley Tennenbaum (Wikipedia)

Sources

1. Tennenbaum's theorem (Wikipedia)

Lead section
Tennenbaum's theorem, named for Stanley Tennenbaum who presented the theorem in 1959, is a result in mathematical logic that states that no countable nonstandard model of first-order Peano arithmetic (PA) can be recursive.
In Branch: Logic and Foundations, Lead sentence
who presented the theorem in 1959, is a result in mathematical logic that states that no countable nonstandard model of first-orde

View the Source

Stanley Tennenbaum (Wikipedia)

Principal Result Of: Stanley Tennenbaum, Lead, best remembered

Quote, Principal Result Of: Stanley Tennenbaum, Lead, best remembered

Though best remembered for Tennenbaum's theorem, despite having never published a proof of it

Tennenbaum's Theorem

Has Statement Form

In Branch

Principal Result Of

Switch Atlas

The Inner World

The Civil World

The Natural World