OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set

First Page		Document Content
Date: 2015-10-26 09:24:01 Computability theory Mathematical logic Proof theory Theory of computation Logic in computer science Computable function Reverse mathematics PA degree Peano axioms		OPEN QUESTIONS ABOUT RAMSEY-TYPE STATEMENTS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Ramsey’s theorem states that for any coloring of the n-element subsets of N with finitely many colors, there is an infinite set Add to Reading List Source URL: ludovicpatey.com Download Document from Source Website File Size: 334,79 KB Share Document on Facebook