Dialogue Games for Minimal Logic
In this paper, we define a class of dialogue games for Johansson’s minimal logic and prove that it corresponds to the minimal logic validity. Many authors have stated similar results for intuitionistic and classical logic either with or without actually proving the correspondence. Rahman, Clerbout and Keiff have already specified dialogues for minimal logic, however, they transformed it into Fitch-style natural deduction only. We propose a different specification for minimal logic with the proof of correspondence between the existence of winning strategies for the Proponent in this class of games and sequent calculus for minimal logic.