Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Provably $Δ^0_2$ and weakly descending chains (1005.1989v1)

Published 12 May 2010 in math.LO

Abstract: In this note we show that a set is provably $\Delta0_2$ in the fragment $I\Sigma_n$ of arithmetic iff it is $I\Sigma_n$-provably in the class $D_\alpha$ of $\alpha$-r.e. sets in the Ershov hierarchy for an $\alpha <{\epsilon_0} \omega{1+n}$, where $<_{\epsilon_0}$ denotes a standard $\epsilon_0$-ordering. In the Appendix it is shown that a limit existence rule $(LimR)$ due to Beklemishev and Visser becomes stronger when the number of nested applications of the inference rule grows.

Summary

We haven't generated a summary for this paper yet.