Key words Bounded BCK-algebra, involutive BCK-algebra, bounded pocrim, algebraic semantics, natural expansion of a quasivariety, natural expansion of a logic, regular element, Glivenko's theorem, bounded BCKlogic.
MSC (2000) 03B47, 03G25, 06F35, 08C15The classical Glivenko theorem asserts that a propositional formula admits a classical proof if and only if its double negation admits an intuitionistic proof. By a natural expansion of the BCK-logic with negation we understand an algebraizable logic whose language is an expansion of the language of BCK-logic with negation by a family of connectives implicitly defined by equations and compatible with BCK-congruences. Many of the logics in the current literature are natural expansions of BCK-logic with negation. The validity of the analogous of Glivenko theorem in these logics is equivalent to the validity of a simple one-variable formula in the language of BCK-logic with negation.