Ramsey's Theorem for Pairs and kk Colors as a Sub-Classical Principle of Arithmetic

preprint2016arXivOpen access

Abstract

The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of kk-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number k≥2k \geq 2, Ramsey's Theorem for pairs and recursive assignments of kk colors is equivalent to the Limited Lesser Principle of Omniscience for Σ30Σ^0_3 formulas over Heyting Arithmetic. Alternatively, the same theorem over intuitionistic arithmetic is equivalent to: for every recursively enumerable infinite kk-ary tree there is some i<ki < k and some branch with infinitely many children of index ii.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.