The Berry-like Sentence in the First-order Peano Arithmetic System with the Operation of Factorial
| dc.creator | Mei, T. | |
| dc.date | 2006-07-19 | |
| dc.date.accessioned | 2026-07-07T07:20:41Z | |
| dc.date.available | 2026-07-07T07:20:41Z | |
| dc.description | A first-order Peano Arithmetical system with the operation of factorial (PAF) is introduced. For any formula A(x) with a free variable x in PAF, we define a corresponding B-formula which means that there exists unique number that is smallest in all natural numbers satisfying the formula A(x) that satisfies the B-formula if A(x) is satisfiable. And then, we construct a formula which means that "there exists x, for any B-formula whose Godel code is smaller than a constant a, x does not satisfy this B-formula, and x is the smallest in those numbers that have such character." However, the constructed formula itself is a B-formula and its Godel code is smaller than a. Thus, it is a version in PAF of the Berry sentence "The smallest positive integer not nameable in under eleven words" that itself is in only ten words. | |
| dc.description | 7 pages, 0 figures | |
| dc.identifier | https://arxiv.org/abs/math/0607459 | |
| dc.identifier | http://arxiv.org/abs/math/0607459 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/115037 | |
| dc.subject | Logic | |
| dc.title | The Berry-like Sentence in the First-order Peano Arithmetic System with the Operation of Factorial | |
| dc.type | text |