Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
nonstandard models of Peano arithmetic
|
| gptkbp:field |
gptkb:logic
model theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Tennenbaum's theorem
|
| gptkbp:implies |
all computable models of Peano arithmetic are isomorphic to the standard model
|
| gptkbp:namedAfter |
gptkb:Stanley_Tennenbaum
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_National_Academy_of_Sciences
|
| gptkbp:relatedTo |
computability theory
model theory of arithmetic |
| gptkbp:sentence |
No countable nonstandard model of Peano arithmetic can have both its addition and multiplication computable.
|
| gptkbp:yearProved |
1959
|
| gptkbp:bfsParent |
gptkb:Stanley_Tennenbaum
|
| gptkbp:bfsLayer |
7
|