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)
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 (categorize this paper)
DOI 10.2307/2274131
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,188
Through your library
References found in this work BETA

Add more references

Citations of this work BETA
Ordered Groups: A Case Study in Reverse Mathematics.Reed Solomon - 1999 - Bulletin of Symbolic Logic 5 (1):45-58.

View all 18 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

16 ( #292,835 of 2,153,857 )

Recent downloads (6 months)

1 ( #398,274 of 2,153,857 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums