Dialogical logic

Dialogic logic (also known as the logic of dialogues) was conceived as a pragmatic approach to the semantics of logic that resorts to concepts of game theory such as "winning a play" and that of "winning strategy".

Since dialogical logic was the first approach to the semantics of logic using notions stemming from game theory, Game Theoretical Semantics (GTS) and dialogical logic are often conflated under the term Game Semantics. However, as discussed below, though GTS and dialogical logic are both rooted in a game-theoretical perspective, in fact they have quite different philosophical and logical background.

Nowadays it has been extended to a general framework for the study of meaning, knowledge and inference constituted during interaction. The new developments include cooperative dialogues and dialogues deploying a fully interpreted language (dialogues with content).

Origins and Further Developments

The philosopher and mathematician Paul Lorenzen (Erlangen-Nürnberg-Universität) Paul Lorenzen was the first to introduce a semantics of games for logic in the late 1950s. Lorenzen called this semantics 'dialogische Logik', dialogic logic. Later, it was developed extensively by his pupil Kuno Lorenz (Erlangen-Nürnberg Universität, then Saarland). Jaakko Hintikka (Helsinki, Boston) developed a little later to Lorenzen a model-theoretical approach known as GTS.

Since then, a significant number of different game semantics have been studied in logic. Since 1993, Shahid Rahman and his collaborators have developed the dialogic within a general framework aimed at the study of the logical and philosophical issues related to logical pluralism. More precisely, by 1995 a kind of revival of dialogic was generated that opened new and unexpected possibilities for logical and philosophical research. Currently, the philosophical development of dialogic experiences a thriving interest especially in the field of argumentation theory, legal reasoning, computer science, applied linguistics, and artificial intelligence.

The new results in dialogic began on one side, with the works of Jean-Yves Girard in linear logic and interaction; on the other, with the study of the interface of logic, mathematical game theory and argumentation, argumentation frameworks and defeasible reasoning (argumentation framework, defeasible reasoning, pragma-dialectic), by researchers such as Samson Abramsky, Johan van Benthem, Andreas Blass, Nicolas Clerbout, Frans H. van Eemeren, Mathieu Fontaine, Dov Gabbay, Rob Grootendorst, Giorgi Japaridze, Laurent Keiff, Erik Krabbe, Alain Leconte, Rodrigo Lopez-Orellana, Sébasten Magnier, Mathieu Marion, Zoe McConaughey, Henry Prakken, Juan Redmond, Helge Rückert, Gabriel Sandu, Giovanni Sartor, Douglas Walton, and John Woods among others, who have contributed to place dialogical interaction and games at the center of a new perspective of logic, where logic is defined as an instrument of dynamic inference.

Today we can distinguish four research programs that address the interface meaning, knowledge and logic in the context of dialogues, games or more generally interaction. Namely

1. The constructivist approach of Paul Lorenzen and Kuno Lorenz, who sought to overcome the limitations of Operative Logic by providing dialogical foundations to it. The method of semantic tableaux for classical and intuitionistic logic as introduced by [[Evert W. Beth]] (1955) could thus be identified as a method for the notation of winning strategies of particular dialogue games (cf. Lorenzen/Lorenz (1978), Lorenz (1981), Felscher (1986)). This, as mentioned above has been extended by Shahid Rahman and collaborators to a general framework for the study of classical and non-classical logics. More recently Rahman and his team of Lille, in order to develop dialogues with content they enriched the dialogical framework with fully interpreted languages (as implemented within Per Martin-Löf's Constructive Type Theory).
2. The game-theoretical approach of Jaakko Hintikka, called GTS. This approach, shares the game-theoretical tenets of dialogical logic for logical constants; but turns to standard model theory when the analysis process reaches the level of elementary statements. At this level standard truth-functional formal semantics comes into play. Whereas in the formal plays of dialogical logic P will loose both plays on an elementary proposition, namely the play where the thesis states this proposition and the play where he states its negation; in GTS one of both will be won by the defender. The most recent developments have been launched by Johan van Benthem and his group of Amsterdam. The Logic in Games programme of van Benthem, which combines the game-theoretical approaches with the one of epistemic logic is one of the most dynamic research groups in the field.
3. The argumentation theory approach of Else Barth and Erik Krabbe (1982), who sought to link dialogical logic with the informal logic or Critical Reasoning originated by the seminal work of Chaim Perelman (cf. Perelman/Olbrechts-Tyteca (1958)), Stephen Toulmin (1958), Arne Naess (1966) and Charles Hamblin (1970) and developed further by Ralph Johnson (1999), Douglas Walton (1984), John Woods (1988) and associates. Recent further developments include [[argumentation framework]] by P.D. Dung, [[defeasible reasoning]] by H. Prakken and G. Sartori and [[pragma-dialectics]] by F. H. van Eemeren and R. Grootendorst.
4. The Ludics-approach incepted by Jean Yves Girard. Which provides an overall theory of proof-theoretical meaning based on interactive computation.

According to the dialogical perspective, knowledge, meaning and truth are conceived as a result of social interaction, where normativity is not understood as a type of pragmatic operator acting on a propositional nucleus destined to express knowledge and meaning, but on the contrary: the type of normativity that emerges from the social interaction associated with knowledge and meaning is constitutive of these notions. In other words, according to the conception of the dialogical framework, the intertwining of the right to ask for reasons, on the one hand, and the obligation to give them, on the other, provides the roots of knowledge, meaning and truth.

Local and Global Meaning

As hinted by its name, this framework studies dialogues; but it also takes the form of dialogues. In a dialogue, two parties (players) argue on a thesis (a certain statement that is the subject of the whole argument) and follow certain fixed rules in their argument. The player who states the thesis is the Proponent, called P, and his rival, the player who challenges the thesis, is the Opponent, called O. In challenging the Proponent's thesis, the Opponent is requiring of the Proponent that he defends his statement.

The interaction between the two players P and O is spelled out by challenges and defences, implementing Robert Brandom’s take on meaning as a game of giving and asking for reasons. Actions in a dialogue are called moves; they are often understood as speech-acts involving declarative utterances (assertions) and interrogative utterances (requests). The rules for dialogues thus never deal with expressions isolated from the act of uttering them.

The rules in the dialogical framework are divided into two kinds of rules: particle rules and structural rules. Whereas the first determine local meaning, the second determine global meaning.

Local meaning explains the meaning of a expression, independently of the rules setting the development of a dialogue. Global meaning sets the meaning of an expression in the context of some specific form of developing a dialogue.

More precisely:

Particle rules (Partikelregeln), or rules for logical constants, determine the legal moves in a play and regulate interaction by establishing the relevant moves constituting challenges: moves that are an appropriate attack to a previous move (a statement) and thus require that the challenged player play the appropriate defence to the attack. If the challenged player defends his statement, he has answered the challenge.

Structural rules (Rahmenregeln) on the other hand determine the general course of a dialogue game, such as how a game is initiated, how to play it, how it ends, and so on. The point of these rules is not so much to spell out the meaning of the logical constants by specifying how to act in an appropriate way—this is the role of the particle rules—; it is rather to specify according to what structure interactions will take place. It is one thing to determine the meaning of the logical constants as a set of appropriate challenges and defences, it is another to define whose turn it is to play and when a player is allowed to play a move

In the most basic case, the particle rules set the local meaning  of the logical constants of first-order classical and intuitionistic logic. More precisel the local meaning is set by the following distribution of choices:

• If the defender X states ''A or B'', the challenger Y has the right to ask him to choose between A and B.
• If the defender X states ''A and B'', the challenger Y has the right to choose beteween asking the defender to state A or to state B.
• If the defender X states that ''if A then B'', the challenger Y has the right to ask for B by granting herself (the challenger) A.
• If the defender X states ''no-A'', then the challenger Y has the right to state A (and then she has the obligation to defend this assertion).
• If the defender X states for ''all the x's it is the case that A[x]'', the challenger Y has the right to choose a singular term t and ask the defender to substitute this term for the free variables in A[x].
• If the defender X states ''there is at least one x, for which it is the case that A[x]'' , the challenger Y has the right to ask him to choose a singular term and substitute this term for the free variables in A[x].

The next section furnishes a brief overview of the rules for intuitionist logic and classical logic. For a complete formal formulation see Clerbout (2014), Rahman, McConaughey, Klev and Clerbout (2018), Rahman and Keiff (2006).

The rules of the dialogical framework

The local meaning of the logical constants

• X A ∨ B  (A or B)

Challenge: Y ?

Defense: X A/X B

(Defender has the choice to defend A or to defend B)

• X A ∧ B  (A and B)

Challenge: Y ?L (for left)

Defense X A

Ataque: Y ?R (for right)

Defense X B

(Challenger has the choice to ask for A or to ask for B)

• X A⊃B  (If A then B)

Challenge: Y A

Defense: X B

(Challenger has the right to ask for A by conceding herself A)

• X ~A  (No A)

Challenge: Y A

Defense: (No defense is possible)

• X ∀xA[x]  (All x are A)

Challenge: Y ?t

Defense: X A[x/t]

(The challenger chooses)

• X ∃xA[x]  (At least one x is A)

Challenge: Y ?

Defense: X A[x/t]

(The defender chooses)

Structural rules: global meaning

RS 1 (Launching a dialogue or play)

Any play (dialogue) starts with the Proponent P stating a thesis (labelled move 0) and the Opponent O bringing forward some initial statement (if any). The first move of O, labelled with 1, is an attack to the thesis of the dialogue.

Each subsequent move consists of one of the two interlocutors, bringing forward in turn either an attack against a previous statement of the opponent, or a defense of a previous attack of the antagonist.

RS 2i (Intuitionist Rule)

X can attack any statement brought forward by Y, so far as the particle rules and the remaining structural rules allow it, or respond only to the last non-answered challenge of the other player.

Note: This last clause is known as the Last Duty Firstcondition, and makes dialogical games suitable for intuitionistic logic (hence this rule's name).

RS 2c (Classical Rule)

X can attack any statement brought forward by Y, so far as the particle rules and the remaining structural rules allow it, or defend himself against any attack of Y (so far as the particle rules and the remaining structural rules allow it,)

RS 3 (Finiteness of plays)

Intuitionist rule

O can attack the same statement at most once.

P can attack the same statement some finite number of times.

Classic rule

O can attack the same statement or defend himself against an attack at most once.

P can an attack the same statement some finite number of times. The same restriction also holds for P’s defences.

RS 4 (Formal rule)

P can state an elementary proposition only if O has stated it before.

O always has the right to state elementary propositions (so far the rules of logical constants and other structural rules allow it).

Elementary propositions (in a formal dialogue) cannot be attacked.

RS5 (Winning and end of a play)

The play ends when it is a player's turn to make a move but that player has no available move left. That player loses, the other player wins.

Validity and Valid Inferences

Notice that the notion of a winning a play is not enough to render the notion of inference or of logical validity.  

Let us look at the following example, the thesis of which is of course not valid. However, P wins because O made the wrong choice. In fact, O loses the play since the structural rules do not allow her to challenge twice the same move.

	O	P
		A ∧ (A⊃A)	0.
1.	?D [0]	A⊃A	2.
3.	A [2]	A	4.

In move 0 P states the thesis. In move 2, O challenges the thesis by asking P to state the right component of the conjunction -  the notation "[n]" indicates the number of the challenged move. In move 3 O challenges the 'implication by granting the antecedent. P responds to this challenge by stating the consequentn the just granted proposition A, and, since there are no other possible moves for O, P  wins.

There is obviously another play, where O wins, namely, asking for the left side of the conjunction.

Dually a valid thesis can be lost because P this time, makes the wrong choice. In the following example P loses the play (played according to the intuitionistic rules) by chosing the left side of the disjunction A ∨(A⊃A), since the intuitionistic rule SR 2i prevents him to come back and revise his choice:

	O	P
		(A ∧ B) ∨ (A⊃A)	0.
1.	?∨ [0]	A ∧ B	2.
3.	?G [2]	...

Hence, winning a play does not ensure validity. In order to cast the notion of validity within the dialogical framework we need to define what a winning strategy is. In fact, there are several ways to do it. For the sake of a simple presentation we will yield a variation of Felscher (1985), however; different to his approach, we will not transform dialogues into tableaux but keep the distinction between play (a dialogue) and the tree of plays constituting a winning strategy.

Winning Strategy

• A player X has a winning strategy if for every move made by the other player Y, player X can make another move, such that each resulting play is eventually won by X.

In dialogical logic validity is defined in relation to winning strategies for the proponent P.

• A proposition is valid if P has a winning strategy for a thesis stating this proposition
• A winning strategy for P for a thesis A is a tree S the branches of which are plays won by P, where the nodes are those moves, such that

1. S has the move P A as root node (with depth 0),
2. if the node is an O-move (i.e. if the depth of a node is odd), then it has exactly one successor node (which is a P-move),
3. if the node is a P-move (i.e. if the depth of a node is even), then it has as many successor nodes as there are possible moves for O at this position.

Branches are introduced by O’s choices such as when she challenges a conjunction or when she defends a disjunction.

Finite Winning Strategies

Winning strategies for quantifier-free formulas are always finite trees, whereas winning strategies for first-order formulas can in general be trees of countably infinitely many finite branches (each branch is a play).

For example, if one player states some universal quantifier, then each choice of the adversary triggers a different play. In the following example the thesis is an existential that triggers infinite branches, each of them constituted by a choice of P:

0.		P∃x(A(x)⊃∀y A(y))
1.		O ?∃
2.	PA(t1)⊃∀y A(y)	P A(t2)⊃∀y A(y)	PA(t3)⊃∀y A(y)	PA(t4)⊃∀y A(y)	...

Infinite winning strategies for P can be avoided by introducing some restriction grounded on the following rationale

• Because of the formal rule,O’s optimal move is to always choose a new term when she has the chance to choose, that is, when she challenges a universal or when she defends an existential.
• On the contrary P, who will do his best to force O to state the elementary proposition she asked P for, will copy O’s choices for a term (if O’s provided already such a term) , when he challenges a universal of O or defends an existential.

These lead to the following restrictions:

1. If the depth of a node nis even such that P stated a universal at n, and if among the possible choice for O she can choose a new term, then this move counts as the only immediate successor node of n.
2. If the depth of a node nis odd such that O stated an existential at n, and if among the possible choices for O she can choose a new term, then this move counts as the only immediate successor node of m, i.e. the node where P launched the attack on n.
3. If it is P who has the choice, then only one of the plays triggered by the choice will be kept.

The rules for local and global meaning plus the notion of winning strategy mentioned above set the dialogical conception of classical and intuitionistic logic.

Herewith an example of a winning strategy for a thesis valid in classical logic and non-valid in intuitionistic logic

0.	P∃x(A(x)⊃∀y A(y)) (P sets the thesis)
1.	O ?∃ (O challenges the thesis)
2.	P A(t1)⊃∀y A(y) (P chooses "t1")
3.	O A(t1) (O challenges the implication by granting the antecedent)
4.	P ∀y A(x) (P answers by stating the consequent)
5.	O ?t2 (O challenges the universal by choosing the new singular term "t2")
6.	P A(t2)⊃∀y A(y) (P cames back to his response  to the challenge launched in move 1 chooses to defend the existential this time with the term "t2")
7	O A(t2) (O challenges the implication by granting the antecedent)
8	P A(t2) (P ''uses''the last move of the Opponent to respond to the challenge upon the universal in move 5)

P has a winning strategy since the SR 2c allows him to defend twice the challenge on the existential. This further allows him to defend himself in move 8 against the challenge launched by the Opponent in move 5.

Defending twice is not allowed by the intuitionistic rule SR 2i and accordingly, there is no winning strategy for P:

0.	P∃x(A(x)⊃∀y A(y)) (P sets the thesis)
1.	O ?∃ (O challenges the thesis)
2.	P A(t1)⊃∀y A(y) (P chooses "t1")
3.	O A(t1) (O challenges the implication by granting the antecedent)
4.	P ∀y A(x) (P answers by stating the consequent )
5.	O ?t2 (O challenges the universal by choosing the new singular term "t2")

Recent Developments

Shahid Rahman (Universität des Saarlandes (1987-2001), Université de Lille (2001, ...) and collaborators in Saarbrücken and Lille developed dialogical logic in a general framework for the historic and the systematic study of several forms of inferences and non-classical logics such as free logic, (normal and non-normal) modal logic, hybrid logic, first-order modal logic, paraconsistent logic, linear logic, relevance logic, connexive logic, belief revision, argumentation theory and legal reasoning.

Most of these developements are a result of studying the semantic and epistemological consequences of modifying the structural rules and/or of the logical constants. In fact, they show how to implement the dialogical conception of the structural rules for inference, such as weakening and contraction.

The most recent publications show how to develop material dialogues (i.e., dialogues based on fully interpreted languages) that than dialogues restricted to logical validity. This new approach to dialogues with content, called immanent reasoning, is one of the most important results of the dialogical perspective on Per Martin-Löf's Constructive Type Theory. Among the most prominent results of immanent reasoning are: the elucidation of the role of dialectics in Aristotle's theory of syllogism, the reconstruction of logic and argumentation within the Arabic tradition, and the formulation of cooperative dialogues for legal reasoning and more generally for reasoning by parallelism and analogy.

Further reading

Books

• Aho, T.; Pietarinen, A-V. (2007). Truth and Games. Essays in honour of Gabriel Sandu. Helsinki: Societas Philosophica Fennica. ISBN 978-951-9264-57-8.

• van Benthem, J. (2006). Logic in Games. Cambridge, Massachusetts: The MIT Press. ISBN 978-0-262-01990-3.

• Allen, L.; Sandu, G.; Sevenster, M. (2011). Independence-Friendly Logic. A Game-Theoretic Approach. Cambridge: Cambridge University Press.

• van Benthem, J.; Heinzmann, G.; Rebuschi, M.; Visser, H., eds. (2006). The Age of Alternative Logics. Cambridge: Springer. ISBN 978-1-40-20-5011-4.

• Dégremont, C.; Keiff, L.; Rückert, H., eds. (2008). Dialogues, Logics and Other Strange Things. Essays in Honour of Shahid Rahman. London: College Publications. ISBN 978-1-904987-13-0.

• van Eemeren, F.H.; Grootendorst, R. (2004). A systematic theory of argumentation: The pragma-dialectical approach. Cambridge: Cambridge University Press.

• Rahman, S.; Rückert, H. (2001). New Perspectives in Dialogical Logic. Synthese. Vol. 127. Springer.

• Rahman, S.; Keiff, L. (2004). "On how to be a dialogician". In Vanderveken, D. (ed.). Logic, Thought and Action. Dordrecht: Springer. pp. 359–408.

• Rahman, S.; Clerbout, N., eds. (2015). Linking Games and Constructive Type Theory: Dialogical Strategies, CTT-Demonstrations and the Axiom of Choice. Cham: Springer-Briefs. ISBN 978-3-319-19063-1.

• Rahman, S.; Iqbal, M.; Soufi, Y. (2019). Inferences by Parallel Reasoning in Islamic Jurisprudence. al-Shīrāzī's Insights into the Dialectical Constitution of Meaning and Knowledge. Cham: Springer. ISBN 978-3-030-22381-6.

• Rahman, S.; McConaughey, Z.; Klev, A.; Clerbout, N. (2018). Immanent Reasoning or Equality in Action. A Plaidoyer for the Play level. Cham: Springer. ISBN 978-3-319-91148-9.

• Rahman, S.; Zidani, F.; Redmond, J.; Kadoum, Y. (2019). The dialogical approach to intuitionistic, classical and basic modal logic. Including a brief introduction to the dialogical take on Constructive Type Theory (in árabe). Beirut: Dar Al Farabi. ISBN 978-614-432-513-1.{{cite book}}: CS1 maint: unrecognized language (link)

• Redmond, J.; Fontaine, M. (2011). How to Play Dialogues. An Introduction to Dialogical Logic. Dialogues. Vol. 1. London: College Publications. ISBN 978-1-84890-046-2.

• Woods, J. (1982). Argument: The Logic of the Fallacies. Toronto and New York: McGraw-Hill. ISBN 0-07-548026-3.

• Woods, J. (2004). The Death of Argument: Fallacies in Agent-Based Reasoning. Dordrecht and Boston: Kluwer. ISBN 1-4020-2663-3.

• Woods, J.; Gabbay, Dov M. (2005). The Reach of Abduction: Insight and Trial. A Practical Logic of Cognitive Systems. Vol. 2. Amsterdam: ELSEVIER B.V. ISBN 978-0-08-046092-5.

Articles

• Abramsky, S.; Jagadeesan, R. (1994). "Games and full completeness for multiplicative linear logic". The Journal of Symbolic Logic. 59 (2): 543–574. doi:10.2307/2275407. ISSN 1943-5886. JSTOR 2275407.
• Blass, A. (1992). "A game semantics for linear logic". Annals of Pure and Applied Logic. 56: 151–166. doi:10.1093/jigpal/5.4.487. ISSN 0168-0072.
• Dutilh-Novaes, C. (2015). "A Dialogical, Multiagent Account of the Normativity of Logic". Dialectica. 69 (4): 587–609. doi:10.1111/1746-8361.12118. ISSN 1746-8361.
• Dutilh-Novaes, C.; French, R. (2018). "Paradoxes and structural rules from a dialogical perspective". Philosophical Issues. 28 (1): 129–158. doi:10.1111/phis.12119. ISSN 1758-2237.
• Felscher, W. (1985). "Dialogues as a Foundation for Intuitionistic Logic". Annals of Pure and Applied Logic. 28: 217–254. doi:10.1016/0168-0072(85)90016-8. ISSN 0168-0072.
• Felscher, W. (2002). Gabbay, Dov M.; Guenthner, F. (eds.). "Dialogues as a Foundation for Intuitionistic Logic". Handbook of Philosophical Logic. 5. Kluwer: 115–145. ISSN 0168-0072.
• Girard, J-Y. (2001). "Locus solum: from the rules of logic to the logic of rules" (PDF). Mathematical Structures in Computer Science. 11 (1): 301–506. doi:10.1017/S096012950100336X. ISSN 1469-8072.
• Hodges, W. (2001). "Dialogue foundations: A sceptical look". Aristotelian Society Supplementary. 75 (1): 17–32. doi:10.1111/1467-8349.00076.
• Japaridze, G. (2003). "Introduction to computability logic". Annals of Pure and Applied Logic. 123 (1–3): 1–99. doi:10.1016/S0168-0072(03)00023-X.
• Krabbe, E. (1985). "Formal Systems of Dialogue Rules". Synthese. 63 (3): 295–328. doi:10.1007/BF00485598.
• Krabbe, E. (1986). "A Theory of Modal Dialectics". Journal of Philosophical Logic. 15 (2): 191–217. doi:10.1007/BF00305491.
• Krabbe, E. (2001). "Dialogue Foundations: Dialogue Logic Revisited". Supplement to the Proceedings of the Aristotelian Society. 75: 33–49. doi:10.1111/1467-8349.00077.
• Lorenz, K. (2001). "Basic Objectives of Dialogue Logic in Historical Perspective". Synthese. 127 (1–2): 225–263.
• Marion, M. (2006). "Why Play Logical Games?". Unifying Logic, Language, and Philosophy. 15: 3–26. doi:10.1007/978-1-4020-9374-6. ISBN 978-1-4020-9373-9.
• Marion, M. (2015). "Aristotle on universal quantification: a study from the perspective of game semantics". History and Philosophy of Logic. 37 (3): 201–229. doi:10.1080/01445340.2015.1089043.
• Piecha, T. (2015). "Dialogical Logic". The Internet Encyclopedia of Philosophy.
• Rahman, S.; Keiff, L. (2005). "On how to be a dialogician". Logic Thought and Action: 359–408. ISBN 1-4020-2616-1.
• Rahman, S.; Tulenheimo, T. (2009). "From Games to Dialogues and Back: Towards a General Frame for Validity". Games: Unifying Logic, Language and Philosophy. Springer: 153–208.