bounded arithmetic
Recently Published Documents


TOTAL DOCUMENTS

154
(FIVE YEARS 2)

H-INDEX

18
(FIVE YEARS 0)

2021 ◽  
Vol 68 (2) ◽  
pp. 1-80
Author(s):  
Iddo Tzameret ◽  
Stephen A. Cook

Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over GF (2) in Hrubeš-Tzameret [15]. Specifically, we show that the multiplicativity of the determinant function and the Cayley-Hamilton theorem over the integers are provable in the bounded arithmetic theory VNC 2 ; the latter is a first-order theory corresponding to the complexity class NC 2 consisting of problems solvable by uniform families of polynomial-size circuits and O (log 2 n )-depth. This also establishes the existence of uniform polynomial-size propositional proofs operating with NC 2 -circuits of the basic determinant identities over the integers (previous propositional proofs hold only over the two-element field).


2019 ◽  
Vol 59 (3-4) ◽  
pp. 461-501
Author(s):  
Emil Jeřábek
Keyword(s):  

Author(s):  
Robert A. Di Paola ◽  
Franco Montagna
Keyword(s):  

2018 ◽  
Vol 83 (3) ◽  
pp. 1063-1090
Author(s):  
YORIYUKI YAMAGATA

AbstractThis article presents a proof that Buss’s $S_2^2$ can prove the consistency of a fragment of Cook and Urquhart’s PV from which induction has been removed but substitution has been retained. This result improves Beckmann’s result, which proves the consistency of such a system without substitution in bounded arithmetic $S_2^1$.Our proof relies on the notion of “computation” of the terms of PV. In our work, we first prove that, in the system under consideration, if an equation is proved and either its left- or right-hand side is computed, then there is a corresponding computation for its right- or left-hand side, respectively. By carefully computing the bound of the size of the computation, the proof of this theorem inside a bounded arithmetic is obtained, from which the consistency of the system is readily proven.This result apparently implies the separation of bounded arithmetic because Buss and Ignjatović stated that it is not possible to prove the consistency of a fragment of PV without induction but with substitution in Buss’s $S_2^1$. However, their proof actually shows that it is not possible to prove the consistency of the system, which is obtained by the addition of propositional logic and other axioms to a system such as ours. On the other hand, the system that we have considered is strictly equational, which is a property on which our proof relies.


Author(s):  
Petr Hajek ◽  
Pavel Pudlak
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document