This paper introduces sequent systems for Visser's two propositional logics: Basic Propositional Logic (BPL) and Formal Propositional Logic (FPL). It is shown through semantical completeness that the cut rule is admissible in each system. The relationships with Hilbert-style axiomatizations and with other sequent formulations are discussed. The cut-elimination theorems are also demonstrated by syntactical methods.
"Sequent Calculi for Visser's Propositional Logics." Notre Dame J. Formal Logic 42 (1) 1 - 22, 2001. https://doi.org/10.1305/ndjfl/1054301352