Categorical characterizations of the natural numbers require primitive recursion
From MaRDI portal
Publication:476119
DOI10.1016/J.APAL.2014.10.003zbMath1369.03100arXiv1410.3649OpenAlexW2064000007MaRDI QIDQ476119
Keita Yokoyama, Leszek Aleksander Kołodziejczyk
Publication date: 28 November 2014
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.3649
Foundations of classical theories (including reverse mathematics) (03B30) Nonstandard models of arithmetic (03H15) Second- and higher-order arithmetic and fragments (03F35)
Related Items (7)
Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ Primitive recursive reverse mathematics ⋮ HOW STRONG IS RAMSEY’S THEOREM IF INFINITY CAN BE WEAK? ⋮ Weaker cousins of Ramsey's theorem over a weak base theory ⋮ Interpreting Weak König’s Lemma using the Arithmetized Completeness Theorem ⋮ THE BOREL COMPLEXITY OF ISOMORPHISM FOR O-MINIMAL THEORIES ⋮ REVERSE MATHEMATICS, YOUNG DIAGRAMS, AND THE ASCENDING CHAIN CONDITION
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method
- Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction
- Reverse mathematics and Peano categoricity
- Cuts, consistency statements and interpretations
- Second Order Logic or Set Theory?
This page was built for publication: Categorical characterizations of the natural numbers require primitive recursion