Justine Jacot | Lund University (original) (raw)
According to Donald Davidson, linguistic competence and performance are a matter of interpretation and adjustment and are not, as David Lewis thought, a matter of learned and applied conventions. My aim is to show that one can bring together both of these conceptions of language, with, as a starting point, lewisian signaling games and classical game theory. We will see that one can express signaling situations, typical of game situations where information is incomplete, in Independence Friendly Logic. Then I will develop a new kind of signaling games, interpretative adjusting games, in which signaling situations are to be expressed as coordination games between several agents whose task is to reach an adequate adjustment of their respective theories on the meaning intentions of each speaker. Those games, inspired by the evolutionary game-theoretic framework, allow to show how agents learn strategies and manage to refine their mutual adjustments in order to reach equilibrium.
Supervisors: Ingar Brinck and Gabriel Sandu
less
Uploads
Papers by Justine Jacot
This paper outlines how classical propositional logic, particularly the notion of ‘obtaining a c... more This paper outlines how classical propositional logic, particularly the notion of ‘obtaining a classically-valid logical proof’, can be understood as the outcome of an argumentation-game. We adopt two game-rules from dialogical logic under which obtaining such as proof is a matter of due course, as both rules together guarantee a winning-strategy for one player when logical consequence holds. We then show how these rules can arise from players’ preferences, rather than be imposed externally, and can hence count as ‘player self-imposable’. Subsequently, this game is shown to comply with the Pragma-dialectical Code of Conduct, while some of the Code’s rules become gratuitous as their content arises directly from player’s preferences instead. Our discussion is oriented towards future inquiries into how logics other than its classical variant can be similarly “naturalized.”
We study several cases of functional anaphora in natural language, that is, cases in which there ... more We study several cases of functional anaphora in natural language, that is, cases in which there is a functional correlation between individuals in the domain, introduced in the form of two nested quantifi ers "For every x there is an y . . ." followed by anaphorical references to any pair instantiating the two quantifi ers. After discussing the impossibility of contemporary dynamic theories to deal with this phenomenon, we review some of the main approaches which have tried to address this problem. We end up with some considerations on the representation of quantifi ers and anaphora and with some prospects for further work. PM (4) Every man who owns a donkey beats it.
In this paper I present the double disjunction task as introduced by Johnson-Laird. This experime... more In this paper I present the double disjunction task as introduced by Johnson-Laird. This experiment is meant to show how mental model theory explains the discrepancy between logical competence and logical performance of individuals in deductive reasoning. I review the results of the task and identify three problems in the way the task is designed, that all fall under a lack of coordination between the subject and the experimenter, and an insufficient representation of the semantic/pragmatic interface. I then propose a reformulation of the task, that makes explicit the underlying semantic reasoning and emphasizes the difference of interpretation of the ddt between the experimenter and the subjects.
We describe a class of semantic games, generalizing game-theoretic semantics (GTS) to semantic en... more We describe a class of semantic games, generalizing game-theoretic semantics (GTS) to semantic entailment, with algorithmic players. Players of these games are algorithmic, have partial anticipations about future histories, hence compute only partial strategies. We prove that they explore games (by playing successive plays) can be mapped to semantic trees. We conclude with a short discussion of a generalization of these games, which captures GTS and some learningtheoretic models of empirical inquiry.
Talks by Justine Jacot
In this paper, we propose to analyze the informativeness of questions, in the context of 'inquiry... more In this paper, we propose to analyze the informativeness of questions, in the context of 'inquiry games', where a player, Inquirer, intends to establish a certain conclusion by means of a combination of reasoning and interrogation, using information (answers) from other players, Sources. This paper is one step toward a precise game-theoretic foundation for these games, which where suggested by Hintikka to be a model of rational inquiry. 1 Sources may be partially unaware of Inquirer's goal, and becoming aware of her goal may make them unwilling to achieve cooperation (i.e. answer truthfully whenever they can). This introduces a discrepancy with situations amenable to standard game theory, in which the space of strategies is common knowledge among players.
This paper outlines how classical propositional logic, particularly the notion of ‘obtaining a c... more This paper outlines how classical propositional logic, particularly the notion of ‘obtaining a classically-valid logical proof’, can be understood as the outcome of an argumentation-game. We adopt two game-rules from dialogical logic under which obtaining such as proof is a matter of due course, as both rules together guarantee a winning-strategy for one player when logical consequence holds. We then show how these rules can arise from players’ preferences, rather than be imposed externally, and can hence count as ‘player self-imposable’. Subsequently, this game is shown to comply with the Pragma-dialectical Code of Conduct, while some of the Code’s rules become gratuitous as their content arises directly from player’s preferences instead. Our discussion is oriented towards future inquiries into how logics other than its classical variant can be similarly “naturalized.”
We study several cases of functional anaphora in natural language, that is, cases in which there ... more We study several cases of functional anaphora in natural language, that is, cases in which there is a functional correlation between individuals in the domain, introduced in the form of two nested quantifi ers "For every x there is an y . . ." followed by anaphorical references to any pair instantiating the two quantifi ers. After discussing the impossibility of contemporary dynamic theories to deal with this phenomenon, we review some of the main approaches which have tried to address this problem. We end up with some considerations on the representation of quantifi ers and anaphora and with some prospects for further work. PM (4) Every man who owns a donkey beats it.
In this paper I present the double disjunction task as introduced by Johnson-Laird. This experime... more In this paper I present the double disjunction task as introduced by Johnson-Laird. This experiment is meant to show how mental model theory explains the discrepancy between logical competence and logical performance of individuals in deductive reasoning. I review the results of the task and identify three problems in the way the task is designed, that all fall under a lack of coordination between the subject and the experimenter, and an insufficient representation of the semantic/pragmatic interface. I then propose a reformulation of the task, that makes explicit the underlying semantic reasoning and emphasizes the difference of interpretation of the ddt between the experimenter and the subjects.
We describe a class of semantic games, generalizing game-theoretic semantics (GTS) to semantic en... more We describe a class of semantic games, generalizing game-theoretic semantics (GTS) to semantic entailment, with algorithmic players. Players of these games are algorithmic, have partial anticipations about future histories, hence compute only partial strategies. We prove that they explore games (by playing successive plays) can be mapped to semantic trees. We conclude with a short discussion of a generalization of these games, which captures GTS and some learningtheoretic models of empirical inquiry.
In this paper, we propose to analyze the informativeness of questions, in the context of 'inquiry... more In this paper, we propose to analyze the informativeness of questions, in the context of 'inquiry games', where a player, Inquirer, intends to establish a certain conclusion by means of a combination of reasoning and interrogation, using information (answers) from other players, Sources. This paper is one step toward a precise game-theoretic foundation for these games, which where suggested by Hintikka to be a model of rational inquiry. 1 Sources may be partially unaware of Inquirer's goal, and becoming aware of her goal may make them unwilling to achieve cooperation (i.e. answer truthfully whenever they can). This introduces a discrepancy with situations amenable to standard game theory, in which the space of strategies is common knowledge among players.