An application of games to the completeness problem for formalized theories
Andrzej Ehrenfeucht (1961)
Fundamenta Mathematicae
Similarity:
Andrzej Ehrenfeucht (1961)
Fundamenta Mathematicae
Similarity:
Julien Bernet, David Janin, Igor Walukiewicz (2002)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem...
Paul Harrenstein (2004)
Philosophia Scientiae
Similarity:
Logical notions of consequence have frequently been related to game-theoretical solution concepts. The correspondence between a formula being classically valid and the existence of a winning strategy for a player in a related two-person game, has been most prominent in this context. We propose a conservative extension of the classical notion of consequence that is based on a generalization of the game-theoretical solution concept of Nash equilibrium.
Jean-Michel Coulomb (1997)
ESAIM: Probability and Statistics
Similarity:
J. M. Lasry, J. M. Morel, S. Solimini (1989)
Revista Matemática de la Universidad Complutense de Madrid
Similarity:
We give a formalization of the ?knowledge games? which allows to study their decidability and convergence as a problem of mathematics. Our approach is based on a metalemma analogous to those of Von Neumann and Morgenstern at the beginning of Game Theory. We are led to definitions which characterize the knowledge games as objects is standard set theory. We then study rigorously the most classical knowledge games and, although we also prove that the ?common knowledge? in these games may...
Kane, Daniel M. (2010)
Integers
Similarity:
John Burgess (1983)
Fundamenta Mathematicae
Similarity:
Mesdal, G.A., Ottaway, P. (2007)
Integers
Similarity:
Holshouser, Arthur, Reiter, Harold (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Cincotti, Alessandro (2009)
Integers
Similarity: