Which set existence axioms are needed to prove the cauchy/peano theorem for ordinary differential equations?
Journal of Symbolic Logic 49 (3):783-802 (1984)
| Abstract | We investigate the provability or nonprovability of certain ordinary mathematical theorems within certain weak subsystems of second order arithmetic. Specifically, we consider the Cauchy/Peano existence theorem for solutions of ordinary differential equations, in the context of the formal system RCA 0 whose principal axioms are ▵ 0 1 comprehension and Σ 0 1 induction. Our main result is that, over RCA 0 , the Cauchy/Peano Theorem is provably equivalent to weak Konig's lemma, i.e. the statement that every infinite {0, 1}-tree has a path. We also show that, over RCA 0 , the Ascoli lemma is provably equivalent to arithmetical comprehension, as is Osgood's theorem on the existence of maximum solutions. At the end of the paper we digress to relate our results to degrees of unsolvability and to computable analysis | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesH. Andréka, Á Kurucz & I. Németi (1994). Connections Between Axioms of Set Theory and Basic Theorems of Universal Algebra. Journal of Symbolic Logic 59 (3):912-923.
Peter A. Cholak, Carl G. Jockusch & Theodore A. Slaman (2001). On the Strength of Ramsey's Theorem for Pairs. Journal of Symbolic Logic 66 (1):1-55.
Claudio Bernardi (1976). The Uniqueness of the Fixed-Point in Every Diagonalizable Algebra. Studia Logica 35 (4):335 - 343.
Douglas K. Brown & Stephen G. Simpson (1993). The Baire Category Theorem in Weak Subsystems of Second-Order Arithmetic. Journal of Symbolic Logic 58 (2):557-578.
Erik Palmgren (1998). Developments in Constructive Nonstandard Analysis. Bulletin of Symbolic Logic 4 (3):233-272.
A. James Humphreys & Stephen G. Simpson (1999). Separation and Weak König's Lemma. Journal of Symbolic Logic 64 (1):268-278.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads3 ( #202,056 of 549,198 )Recent downloads (6 months)1 ( #63,397 of 549,198 )How can I increase my downloads? |
My notes
Discussion
