Categorical characterizations of the natural numbers require primitive recursion

preprint2014arXivOpen access

Abstract

Simpson and the second author asked whether there exists a characterization of the natural numbers by a second-order sentence which is provably categorical in the theory RCA0∗^*_0. We answer in the negative, showing that for any characterization of the natural numbers which is provably true in WKL0∗^*_0, the categoricity theorem implies Σ10Σ^0_1 induction. On the other hand, we show that RCA0∗^*_0 does make it possible to characterize the natural numbers categorically by means of a set of second-order sentences. We also show that a certain Π21Π^1_2-conservative extension of RCA0∗^*_0 admits a provably categorical single-sentence characterization of the naturals, but each such characterization has to be inconsistent with WKL0∗^*_0+superexp.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.