8 search results - page 1 / 2 » A Finitary Model of Peano Arithmetic |
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...
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.
APAL
2008
13 years 11 months ago
2008
The principal result of this paper answers a long-standing question in the model theory of arithmetic [KS, Question 7] by showing that there exists an uncountable arithmetically cl...
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 ...
MLQ
2007
13 years 10 months ago
2007