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 Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
Source Tennenbaum's theorem (Wikipedia)
Sources
1. Tennenbaum's theorem (Wikipedia)
In Branch: Logic and Foundations, Lead sentenceQuote, 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
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.