Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 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

Open induction in a bounded arithmetic for TC^0 (1404.7435v2)

Published 29 Apr 2014 in cs.LO and math.LO

Abstract: The elementary arithmetic operations $+,\cdot,\le$ on integers are well-known to be computable in the weak complexity class $\mathrm{TC}0$, and it is a basic question what properties of these operations can be proved using only $\mathrm{TC}0$-computable objects, i.e., in a theory of bounded arithmetic corresponding to $\mathrm{TC}0$. We will show that the theory $\mathit{VTC}0$ extended with an axiom postulating the totality of iterated multiplication (which is computable in $\mathrm{TC}0$) proves induction for quantifier-free formulas in the language $\langle +,\cdot,\le \rangle$ (IOpen), and more generally, minimization for $\Sigmab_0$ formulas in the language of Buss's $S_2$.

Summary

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