The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Semantic Games for Algorithmic Players

På svenska

Author

Summary, in English

We describe a class of semantic extensive entailment game (eeg) with algorithmic players, related to game-theoretic semantics (gts), and generalized to classical first-order semantic entailment. Players have preferences for parsimonious spending of computational resources, and compute partial strategies, under qualitative uncertainty about future histories. We prove the existence of local preferences for moves, and strategic fixpoints, that allow to map eeg game-tree to the building rules and closure rules of Smullyan's semantic tableaux (st). We also exhibit a strategy profile that solves the fixpoint selection problem, and can be mapped to systematic constructions of semantic trees, yielding a completeness

result by translation. We conclude on possible generalizations of our games.

Department/s

Publishing year

2012

Language

English

Document type

Conference paper

Topic

  • Philosophy

Conference name

Decisions, Games & Logic '12

Conference date

2012-06-29

Status

Published

Research group

  • Lund University Information Quality Research Group (LUIQ)