Glivenko Classes of Sequents for Propositional Star-Free Likelihood Logic
Romas Alonderis · Logic Journal of IGPL · 2006
We consider conditions under which sequents are derivable in an intuitionistic sequent calculus of propositional star-free likelihood logic iff they are derivable in a classical counterpart of the calculus. Such conditions are defined for sequents with one formula in the succedent (purely Glivenko σ-classes) and for sequents with empty succedent (Glivenko σ-classes).