DeepAI AI Chat
Log In Sign Up

Iterated multiplication in VTC^0

11/05/2020
by   Emil Jeřábek, et al.
0

We show that VTC^0, the basic theory of bounded arithmetic corresponding to the complexity class TC^0, proves the IMUL axiom expressing the totality of iterated multiplication satisfying its recursive definition, by formalizing a suitable version of the TC^0 iterated multiplication algorithm by Hesse, Allender, and Barrington. As a consequence, VTC^0 can also prove the integer division axiom, and (by results of Jeřábek) the RSUV-translation of induction and minimization for sharply bounded formulas. Similar consequences hold for the related theories Δ^b_1-CR and C^0_2. As a side result, we also prove that there is a well-behaved Δ_0 definition of modular powering in IΔ_0+WPHP(Δ_0).

READ FULL TEXT

page 1

page 2

page 3

page 4

03/09/2022

On proving consistency of equational theories in Bounded Arithmetic

We consider pure equational theories that allow substitution but disallo...
01/23/2018

Why and How to Avoid the Flipped Quaternion Multiplication

Over the last decades quaternions have become a crucial and very success...
11/08/2022

When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic

This paper presents a theory of non-linear integer/real arithmetic and a...
01/15/2018

A Multi-layer Recursive Residue Number System

We present a method to increase the dynamical range of a Residue Number ...
09/15/2017

On the Decidability of the Ordered Structures of Numbers

The ordered structures of natural, integer, rational and real numbers ar...
04/14/2019

Separation of bounded arithmetic using a consistency statement

This paper proves Buss's hierarchy of bounded arithmetics S^1_2 ⊆ S^2_2 ...
10/05/2019

Secure Montgomery Multiplication and Repeated Squares for Modular Exponentiation

The BMR16 circuit garbling scheme introduces gadgets that allow for ciph...