Dialogue Games in Classical Logic
Jesse Alama, Aleks Knoks, Sara L. Uckelman
Abstract
Open-access reader
Jesse Alama, Aleks Knoks, Sara L. Uckelman
Abstract
Open-access reader
We define a class of dialogue games and prove that existence of winning strategies for the Proponent in this class of games corresponds to validity in classical propositional logic. Many authors have stated similar results without actually proving the correspondence. We modify the games used for intuitionistic logic given by Fermüller [3]. We employ standard dialogue games and a standard sequent calculus for classical logic. The result is a simple correspondence between dialogue games and classical logic.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We define a class of dialogue games and prove that existence of winning strategies for the Proponent in this class of games corresponds to validity in classical propositional logic. Many authors have stated similar results without actually proving the correspondence. We modify the games used for intuitionistic logic given by Fermüller [3]. We employ standard dialogue games and a standard sequent calculus for classical logic. The result is a simple correspondence between dialogue games and classical logic.
Key concepts: Sequent, Propositional calculus, Classical logic, Zeroth-order logic, Class (philosophy), Mathematics, Simple (philosophy), Calculus (dental)