A curious dialogical logic and its composition problem (Q484198)

This paper develops a set of rules for a Lorenzen-style dialogue game (in which the question is whether there is a winning strategy for the player who proposes a formula \({\phi}\)), and proposes and solves the \textit{composition problem} for that set of rules. This problem is the important one of whether the set of dialogically valid formulae is closed under \textit{modus ponens}. The logic lacks intrinsic interest -- the authors themselves admit it is ``a rather silly one'', p. 1098 and [\textit{L. Keiff}, ``Dialogical logic'', in: Stanford Encyclopedia of Philosophy. Stanford: Stanford University (2009); \url{http://plato.stanford.edu/archives/sum2009/entries/logic-dialogical/}]; but the property investigated is important if we regard dialogue games as an alternative to such methods as tableaux for investigating the properties of a logic. There is no reference to the quite different tradition of formal dialogue study in which the solution of the composition problem for a logic would be regarded as a defect of that logic see [\textit{C. L. Hamblin}, Fallacies. London: Methuen (1970), pp. 263--264].