Back to Results
First PageMeta Content
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

Document Date: 2015-10-26 09:24:01


Open Document

File Size: 334,79 KB

Share Result on Facebook