Glivenko theorems revisited (Q1035660): Difference between revisions

Glivenko's theorem for a propositional substructural logic \(L\) is the statement: Formula \(A\) is a tautology iff \(L\vdash \neg\neg A\). The author and \textit{N. Galatos} [J. Symb. Log. 71, No. 4, 1353--1384 (2006; Zbl 1109.03016)] gave exact conditions for Glivenko's theorem in algebraic terms. Here a proof-theoretic treatment is given.