The following pages link to (Q5817866):
Displaying 50 items.
- On values of repeated games with signals (Q259588) (← links)
- The challenge of non-zero-sum stochastic games (Q267089) (← links)
- Infinite games specified by 2-tape automata (Q324245) (← links)
- Game semantics for non-monotonic intensional logic programming (Q345702) (← links)
- Topological extension of parity automata (Q388217) (← links)
- Groups, graphs, languages, automata, games and second-order monadic logic (Q444388) (← links)
- Asset market games of survival: a synthesis of evolutionary and dynamic games (Q470650) (← links)
- First-order dialogical games and tableaux (Q484155) (← links)
- Generic Vopěnka's principle, remarkable cardinals, and the weak proper forcing axiom (Q512131) (← links)
- First-cycle games (Q528186) (← links)
- Information tracking in games on graphs (Q616037) (← links)
- A game-theoretic characterization of Boolean grammars (Q631778) (← links)
- Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties (Q639684) (← links)
- Games of search and completion (Q676805) (← links)
- Gurevich-Harrington's games defined by finite automata (Q685082) (← links)
- Happy families and completely Ramsey sets (Q688852) (← links)
- Propositional games with explicit strategies (Q731893) (← links)
- Axioms of determinacy and biorthogonal systems (Q748820) (← links)
- Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies (Q752703) (← links)
- The structure of non-zero-sum stochastic games (Q865285) (← links)
- Minimal collapsing extensions of models of ZFC (Q914664) (← links)
- Deductive verification of alternating systems (Q939163) (← links)
- Topological aspects of poset spaces (Q977107) (← links)
- On effectively computable realizations of choice functions (Q1072545) (← links)
- Alternation and \(\omega\)-type Turing acceptors (Q1088417) (← links)
- The axiom of determinacy and the modern development of descriptive set theory (Q1097880) (← links)
- Alternating automata on infinite trees (Q1098325) (← links)
- Lower bounds on degrees of game-theoretic structures (Q1106754) (← links)
- An infinite version of Arrow's theorem in the effective setting (Q1108914) (← links)
- On branching and looping. I (Q1134530) (← links)
- On branching and looping. II (Q1134531) (← links)
- Some undecidable determined games (Q1171511) (← links)
- A game semantics for linear logic (Q1192350) (← links)
- Recursively presented games and strategies (Q1196205) (← links)
- Forcing axioms and stationary sets (Q1201333) (← links)
- Limit of multistage \(n\)-person games (Q1235068) (← links)
- On the independence of core-equivalence results from Zermelo-Fraenkel set theory (Q1263580) (← links)
- Analytic ideals and cofinal types (Q1304545) (← links)
- On the power of randomization in on-line algorithms (Q1312184) (← links)
- Infinite games played on finite graphs (Q1314640) (← links)
- Progress measures, immediate determinacy, and a subset construction for tree automata (Q1337694) (← links)
- \({\mathbf H}\)-trivial spaces (Q1403814) (← links)
- Introduction to computability logic (Q1408853) (← links)
- Power type asymptotically uniformly smooth and asymptotically uniformly flat norms (Q1624059) (← links)
- Ranks of Maharam algebras (Q1644965) (← links)
- A logical analysis of Monty Hall and Sleeping Beauty (Q1756594) (← links)
- Variations on a game (Q1836601) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- The consistency strength of projective absoluteness (Q1896614) (← links)
- Polynomial games and determinacy (Q1919550) (← links)
