Sequent calculi for visser’s propositional logics

Katsumasa Ishii, Ryo Kashima, Kentaro Kikuchi

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)1-22
Number of pages22
JournalNotre Dame Journal of Formal Logic
Issue number1
Publication statusPublished - 2001


  • Cut-elimination
  • Kripke semantics
  • Sequent calculus


Dive into the research topics of 'Sequent calculi for visser’s propositional logics'. Together they form a unique fingerprint.

Cite this