 # A Curious Dialogical Logic and its Composition Problem

Uckelman, Sara L; Alama, Jesse; Knoks, Aleks (2014). A Curious Dialogical Logic and its Composition Problem. Journal of Philosophical Logic, 43(6):1065-1100.

## Abstract

Dialogue semantics for logic are two-player logic games between a Proponent who puts forward a logical formula φ as valid or true and an Opponent who disputes this. An advantage of the dialogical approach is that it is a uniform framework from which different logics can be obtained through only small variations of the basic rules. We introduce the composition problem for dialogue games as the problem of resolving, for a set S of rules for dialogue games, whether the set of S-dialogically valid formulas is closed under modus ponens. Solving the composition problem is fundamental for the dialogical approach to logic; despite its simplicity, it often requires an indirect solution with the help of significant logical machinery such as cut-elimination. Direct solutions to the composition problem can, however, sometimes be had. As an example, we give a set N of dialogue rules which is well-justified from the dialogical point of view, but whose set N of dialogically valid formulas is both non-trivial and non-standard. We prove that the composition problem for N can be solved directly, and introduce a tableaux system for N.

## Abstract

Dialogue semantics for logic are two-player logic games between a Proponent who puts forward a logical formula φ as valid or true and an Opponent who disputes this. An advantage of the dialogical approach is that it is a uniform framework from which different logics can be obtained through only small variations of the basic rules. We introduce the composition problem for dialogue games as the problem of resolving, for a set S of rules for dialogue games, whether the set of S-dialogically valid formulas is closed under modus ponens. Solving the composition problem is fundamental for the dialogical approach to logic; despite its simplicity, it often requires an indirect solution with the help of significant logical machinery such as cut-elimination. Direct solutions to the composition problem can, however, sometimes be had. As an example, we give a set N of dialogue rules which is well-justified from the dialogical point of view, but whose set N of dialogically valid formulas is both non-trivial and non-standard. We prove that the composition problem for N can be solved directly, and introduce a tableaux system for N.

## Statistics

### Citations

Dimensions.ai Metrics
3 citations in Web of Science®
2 citations in Scopus®

### Altmetrics

Detailed statistics

##   