Abstract
In any nonstandard model of Peano arithmetic, the standard part is not first-order definable. But we show that in some model the standard part is definable as the unique solution of a formula φ(P), where P is a unary predicate variable.
Original language | English |
---|---|
Pages (from-to) | 65-73 |
Number of pages | 9 |
Journal | Notre Dame Journal of Formal Logic |
Volume | 43 |
Issue number | 2 |
DOIs | |
State | Published - 2002 |
Keywords
- Absoluteness
- Definability
- Peano arithmetic