![Computability theory / Mathematical logic / Proof theory / Theory of computation / Logic in computer science / Computable function / Reverse mathematics / PA degree / Peano axioms Computability theory / Mathematical logic / Proof theory / Theory of computation / Logic in computer science / Computable function / Reverse mathematics / PA degree / Peano axioms](https://www.pdfsearch.io/img/a404a4dedb9d96178b06de6016fa15bf.jpg) Date: 2015-10-26 09:24:01Computability 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 setAdd to Reading ListSource URL: ludovicpatey.comDownload Document from Source Website File Size: 334,79 KBShare Document on Facebook
|