Abstract
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 language | English |
---|---|
Pages (from-to) | 1-22 |
Number of pages | 22 |
Journal | Notre Dame Journal of Formal Logic |
Volume | 42 |
Issue number | 1 |
DOIs | |
Publication status | Published - 2001 |
Externally published | Yes |
Keywords
- Cut-elimination
- Kripke semantics
- Sequent calculus
ASJC Scopus subject areas
- Logic