Easier Ways to Win Logical Games
نویسنده
چکیده
The key tool in proving inexpressibility results in finite-model theory is Ehrenfeucht-F'rai'ss6 games. This paper surveys various game-theoretic techniques and tools that lead to simpler proofs of inexpressibility results. The focus is on first-order logic and
منابع مشابه
Comparing the Power of Games on Graphs
The descriptive complexity of a problem is the complexity of describing the problem in some logical formalism. One of the few techniques for proving separation results in descriptive complexity is to make use of games on graphs played between two players, called the spoiler and the duplicator. There are two types of these games, which differ in the order in which the spoiler and duplicator make...
متن کاملThe Right to Remember: Implementing a Rudimentary Emotive-Effect Layer for Frustration on AI Agent Gameplay Strategy
AI is often looked at as a logical rational way to develop a games agent that methodically looks at options and delivers rational solutions. This paper is based on developing an AI agent that plays a game with a similar emotive content like a human. The purpose of the study was to see if the incorporation of this emotive content would influence the outcomes within the game Love Letter. In order...
متن کاملThe Duplicator-Spoiler Game for an Ordinal Number of Turns
In this paper, we investigate Duplicator-Spoiler Games, a method of comparing the properties of structures. These games are especially significant because they have deep connections to logical expressibility. Traditionally, Duplicator-Spoiler Games were played with a preset, finite number of turns. We do not examine such situations but instead consider games of arbitrary lengths, which we repre...
متن کاملHow Much Lookahead is Needed to Win Infinite Games?
Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent’s moves. For ω-regular winning conditions it is known that such games can be solved in doubly-exponential time and that doublyexponential lookahead is sufficient. We improve upon both results by giving an exponential time algorithm and an exponential upper bound on...
متن کاملWhy Play Logical Games?
We owe to Paul Lorenzen an extraordinarily rich intuitive idea, first presented in his papers ‘Logik und Agon’ [Lorenzen 1960] and ‘Ein dialogisches Konstruktivitätskriterium’ [Lorenzen 1961], the fruitfulness of which we are barely encompassing today. In the language of game theory, it is the idea of defining logical particles in terms of rules for non-collaborative, zero-sum games between two...
متن کامل