Abstract
The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of -many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number , Ramsey's Theorem for pairs and recursive assignments of colors is equivalent to the Limited Lesser Principle of Omniscience for formulas over Heyting Arithmetic. Alternatively, the same theorem over intuitionistic arithmetic is equivalent to: for every recursively enumerable infinite -ary tree there is some and some branch with infinitely many children of index .
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.