id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
7p88cf97j2w	Stephen Flood	Paths, trees, and the computational strength of some Ramsey-type theorems.	2012		.txt	text/plain	244	11	53	We begin by studying the computational strength of a version of Ramsey's Theorem that combines features of finite and infinite Ramsey theory. In reverse mathematics, we show that that this Packed Ramsey's Theorem is equivalent to Ramsey's Theorem for exponents n other than 2. When n=2, we show that it implies Ramsey's Theorem, and that it does not imply ACA.	cache/7p88cf97j2w.txt	txt/7p88cf97j2w.txt