On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories

Modifying the methods of Z. Adamowicz's paper Herbrand consistency and hounded arithmetic [3] we show that there exists a number n such that boolean OR(m) S-m (the union of the bounded arithmetic theories S-m) does not prove the Herbrand consistency of the finitely axiomatizable theory S-3(n).