Semantic games for first-order entailment with algorithmic players

Abstract

If semantic consequence is analyzed with extensive games, logical reasoning can be accounted for by looking at how players solve entailment games. However, earlier approaches to game semantics cannot achieve this reduction, by want of explicitly dened preferences for players. Moreover, although entailment games can naturally translate the idea of argumentation about a common ground, a cognitive interpretation is undermined by the complexity of strategic reasoning. We thus describe a class of semantic extensive entailment game with algorithmic players, who have preferences for parsimonious spending of computational resources and thus compute partial strategies under qualitative uncertainty about future histories. We prove the existence of local preferences for moves and of strategic fixpoints that allow to map game-trees to tableaux proofs, and exhibit a strategy prole that solves the fixpoint selection problem, and can be mapped to systematic constructions of semantic trees, yielding a completeness result by translation. We then discuss the correspondence between proof heuristics and strategies in our games, the relations of our games to gts, and possible extensions to other entailment relations. We conclude that the main interest of our result lies in the possibility to bridge argumentative and cognitive models of logical reasoning, rather than in new meta-theoretic results. All proofs are given in appendix.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Logical Dialogues with Explicit Preference Profiles and Strategy Selection.Emmanuel Genot & Justine Jacot - 2017 - Journal of Logic, Language and Information 26 (3):261-291.
Logic games are complete for game logics.Johan van Benthem - 2003 - Studia Logica 75 (2):183-203.
Question–answer games.Thomas Ågotnes, Johan van Benthem, Hans van Ditmarsch & Stefan Minica - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):265-288.
Comparing the power of games on graphs.Ronald Fagin - 1997 - Mathematical Logic Quarterly 43 (4):431-455.
Mindreading and endogenous beliefs in games.Lauren Larrouy & Guilhem Lecouteux - 2017 - Journal of Economic Methodology 24 (3):318-343.

Analytics

Added to PP
2020-01-13

Downloads
4 (#1,426,245)

6 months
1 (#1,040,386)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Justine Jacot
Lund University

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references