Name
Abstract | ||
|---|---|---|
We prove that a nonstandard extension of arithmetic is effectively conservative over Peano arithmetic by using an internal version of a definable ultrapower. By the same method we show that a certain extension of the nonstandard theory with a saturation principle has the same proof-theoretic strength as second order arithmetic, where comprehension is restricted to arithmetical formulas. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1002/(SICI)1521-3870(200001)46:1<17::AID-MALQ17>3.0.CO;2-8 | MATHEMATICAL LOGIC QUARTERLY |
Keywords | Field | DocType |
nonstandard arithmetic,proof-theoretic strength,bounded ultrapowers | Discrete mathematics,Non-standard model of arithmetic,Algebra,True arithmetic,Arithmetic,Robinson arithmetic,Mathematics,Second-order arithmetic | Journal |
Volume | Issue | ISSN |
46 | 1 | 0942-5616 |
Citations | PageRank | References |
3 | 0.60 | 0 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erik Palmgren | 1 | 233 | 43.17 |