First-order reasoning and primitive recursive natural number notations (Q708925)
From MaRDI portal
 | This is a page for a Wikibase entity. It is used by other Wikibase pages, but it is generally not meant to be viewed directly. See First-order reasoning and primitive recursive natural number notations for the user view. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | First-order reasoning and primitive recursive natural number notations |
scientific article |
Statements
First-order reasoning and primitive recursive natural number notations (English)
0 references
15 October 2010
0 references
The paper is devoted to the reliability of first-order derivations in axiomatic elementary number theory in the case when the collection of its models is enlarged by including ``primitive recursive notations''. Two of such derivations are criticized, in particular derivations which claim, respectively, to establish the totality of exponentiation and to prove Euclid's theorem about the infinity of primes.
0 references
proof theory
0 references
finitism
0 references
nonstandard natural numbers
0 references
