Journal
JOURNAL OF SYMBOLIC LOGIC
Volume 66, Issue 1, Pages 1-55Publisher
ASSN SYMBOLIC LOGIC INC
DOI: 10.2307/2694910
Keywords
Ramsey's Theorem; conservation; reverse mathematics; recursion theory; computability theory
Categories
Ask authors/readers for more resources
We study the proof-theoretic strength and effective content of the infinite form of Ramsey's theorem for pairs. Let RTkn denote Ramsey's theorem for k-colorings of n-element sets, and let RT
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
© Peeref 2019-2024. All rights reserved.