Comparing the Strength of Diagonally Nonrecursive Functions in the Absence of Induction

Journal of Symbolic Logic 80 (4):1211-1235 (2015)
  Copy   BIBTEX

Abstract

We prove that the statement “there is aksuch that for everyfthere is ak-bounded diagonally nonrecursive function relative tof” does not imply weak König’s lemma over${\rm{RC}}{{\rm{A}}_0} + {\rm{B\Sigma }}_2^0$. This answers a question posed by Simpson. A recursion-theoretic consequence is that the classic fact that everyk-bounded diagonally nonrecursive function computes a 2-bounded diagonally nonrecursive function may fail in the absence of${\rm{I\Sigma }}_2^0$.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,990

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 (#699,905)

6 months
7 (#592,073)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Reverse mathematics and colorings of hypergraphs.Caleb Davis, Jeffry Hirst, Jake Pardo & Tim Ransom - 2019 - Archive for Mathematical Logic 58 (5-6):575-585.
Forcing with bushy trees.Mushfeq Khan & Joseph S. Miller - 2017 - Bulletin of Symbolic Logic 23 (2):160-180.

Add more citations