Cargando…
The determinacy of long games
In this volume the author develops and applies methods for proving, from large cardinals, the determinacy of definable games of countable length on natural numbers. The determinacy is ultimately derived from iteration strategies, connecting games on natural numbers with the specific iteration games...
Autor principal: | Neeman, Itay |
---|---|
Lenguaje: | eng |
Publicado: |
De Gruyter
2004
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1990595 |
Ejemplares similares
-
The Axiom of Determinacy, Forcing Axioms, and the Nonstationary Ideal
por: Woodin, W Hugh
Publicado: (2010) -
Unfolding and determinacy theorems for subgroups of A and K
por: Damon, James
Publicado: (1984) -
Repeated games and reputations: long-run relationships
por: Mailath, George J, et al.
Publicado: (2006) -
Game sutra: rescuing game theory from the game theorists
por: Prasad, Rohit
Publicado: (2019) -
Foundations of game theory: noncooperative games
por: Vorob’ev, Nicolai N
Publicado: (1994)