A curious dialogical logic and its composition problem

DOI10.1007/S10992-013-9307-1MaRDI QIDQ484198zbMATH OpenOpenAlexFDO

Authors Sara L. Uckelman, Jesse Alama, Aleks Knoks

Publication date 18 December 2014

Published in Journal of Philosophical Logic (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1008.0080, http://dro.dur.ac.uk/15998/1/15998.pdf

zbMATH Keywords

dialogue games deductive closure dialogue semantics modus ponens closure

Mathematics Subject Classification ID

Other nonclassical logic (03B60) 2-person games (91A05)

Abstract: Dialogue games are two-player logic games between a Proponent who puts forward a logical formula A 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. We give a set N of dialogue rules that is quite close to a set of rules known to characterize classical propositional logic, and which is evidently well-justified from the dialogical point of view, but whose set of dialogically valid formulas is quite peculiar (and non-trivial). Its peculiarity notwithstanding, the composition problem for N can be solved directly.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: A curious dialogical logic and its composition problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484198)