Open Access
Translator Disclaimer
2015 The Thin Set Theorem for Pairs Implies DNR
Brian Rice
Notre Dame J. Formal Logic 56(4): 595-601 (2015). DOI: 10.1215/00294527-3153606

Abstract

Answering a question in the reverse mathematics of combinatorial principles, we prove that the thin set theorem for pairs (TS(2)) implies the diagonally noncomputable set principle (DNR) over the base axiom system RCA0.

Citation

Download Citation

Brian Rice. "The Thin Set Theorem for Pairs Implies DNR." Notre Dame J. Formal Logic 56 (4) 595 - 601, 2015. https://doi.org/10.1215/00294527-3153606

Information

Received: 3 June 2013; Accepted: 24 June 2013; Published: 2015
First available in Project Euclid: 30 September 2015

zbMATH: 1372.03028
MathSciNet: MR3403094
Digital Object Identifier: 10.1215/00294527-3153606

Subjects:
Primary: 03B30
Secondary: 03F35

Keywords: Ramsey’s theorem , reverse mathematics , thin set

Rights: Copyright © 2015 University of Notre Dame

JOURNAL ARTICLE
7 PAGES


SHARE
Vol.56 • No. 4 • 2015
Back to Top