Abstract

This paper presents a comprehensive proof-theoretic analysis of Jaśkowski’s discussive (or discursive) logic, working with a set of connectives including classical negation and disjunction, as well as so-called (right-)discussive conjunction and discussive implication. By employing established techniques two labelled frameworks are introduced: sequent and natural deduction systems. The paper explores the ability of the proposed calculi to accurately represent Jaśkowski’s discussive logic, particularly in light of its paraconsistent nature, and establishes cut- admissibility and normalization theorems. Additionally, the introduced sequent calculus – shown to allow terminating proof search – is employed to prove the embedding of discussive logic within modal logic S5. Finally, it is proved that the natural deduction calculus translates into the corresponding sequent system, with soundness and completeness established for both calculi. Concluding remarks highlight the potential for expanding this study and suggest directions for future research.