Rainbow Ramsey Theorem for triples is strictly weaker than the Arithmetical Comprehension Axiom

Journal of Symbolic Logic 78 (3):824-836 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,317

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2016-06-30

Downloads
22 (#960,280)

6 months
5 (#1,015,253)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Cohesive sets and rainbows.Wei Wang - 2014 - Annals of Pure and Applied Logic 165 (2):389-408.

Add more citations

References found in this work

On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.

Add more references