38 search results - page 1 / 8 » Nonstandard models that are definable in models of Peano Ari... |
MLQ
2007
13 years 10 months ago
2007
NDJFL
2002
13 years 10 months ago
2002
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 ...
FCS
2008
14 years 13 days ago
2008
We define a finitary model of first-order Peano Arithmetic in which satisfaction and quantification are interpreted constructively in terms of Turing-computability.
FCS
2008
2008
Why Brouwer Was Justified in his Objection to Hilbert's Unqualified Interpretation of Quantification
14 years 13 days ago
Abstract We define a finitary model of firstorder Peano Arithmetic in which quantification is interpreted constructively in terms of Turingcomputability, and show that it is incons...
APAL
2005
13 years 11 months ago
2005
We study the minimal enumeration degree (e-degree) problem in models of fragments of Peano arithmetic (PA) and prove the following results: In any model M of 2 induction, there is ...