First-order reasoning and primitive recursive natural number notations (Q708925)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5800411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | First-order reasoning and primitive recursive natural number notations |
scientific article; zbMATH DE number 5800411 |
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
0 references
0.7067663073539734
0 references
0.7005285620689392
0 references
0.698187530040741
0 references
0.697605550289154
0 references
