On the strength of Ramsey's theorem
type: Item
instance of: scholarly article
title: On the strength of Ramsey's theorem
zbMATH Open document ID: 0843.03034
author: David Seetapun
author: Theodore A. Slaman
published in: Notre Dame Journal of Formal Logic
publication date: 1996-05-22T00:00:00Z
Mathematics Subject Classification ID: 03F30
zbMATH DE Number: 881258
zbMATH Keywords: Ramsey's theorem for pairs
zbMATH Keywords: comprehension scheme
zbMATH Keywords: first order arithmetic
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1305/ndjfl/1040136917
OpenAlex ID: W2016125425
cites work: The Baire category theorem in weak subsystems of second-order arithmetic
cites work: A criterion for completeness of degrees of unsolvability
cites work: Q4111536
cites work: The theory of \(\kappa\)-like models of arithmetic
cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability
cites work: Q4863246
cites work: Q5596777
DOI: 10.1305/NDJFL/1040136917
description: scientific article; zbMATH DE number 881258