The following pages link to (Q5817866):
Displayed 50 items.
- 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)
- The axiom of real Blackwell determinacy (Q1938402) (← links)
- Galvin's ``racing pawns'' game, internal hyperarithmetic comprehension, and the law of excluded middle (Q1949169) (← links)
- Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information (Q1956374) (← links)
- Catch games: the impact of modeling decisions (Q2002066) (← links)
- Game characterizations and lower cones in the Weihrauch degrees (Q2011671) (← links)
- The uniform measure of simple regular sets of infinite trees (Q2029602) (← links)
- Wadge-Wagner hierarchies (Q2074220) (← links)
- Descriptive set theory, from Cantor to Wadge and beyond (Q2148861) (← links)
- A semi-potential for finite and infinite games in extensive form (Q2175356) (← links)
- Finite-state strategies in delay games (Q2182729) (← links)
- Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control (Q2231651) (← links)
- A characterization of \(\Sigma_1^1\)-reflecting ordinals (Q2231693) (← links)
- Non-Archimedean game theory: a numerical approach (Q2244113) (← links)
- Dual selection games (Q2295645) (← links)
- Determinacy of games with stochastic eventual perfect monitoring (Q2347775) (← links)
- Unraveling \({\boldsymbol\Pi}^1_1\) sets, revisited (Q2382328) (← links)
- David Gale in Paris (Q2389279) (← links)
- ReGale: some memorable results (Q2389290) (← links)
- Set theory and the analyst (Q2419681) (← links)
- Ordinal solution of open games and analytic sets (Q2431007) (← links)
- On the determinacy of concurrent games on event structures with infinite winning sets (Q2453582) (← links)
- An infinite-game semantics for well-founded negation in logic programming (Q2474440) (← links)
- Complexity of winning strategies (Q2554653) (← links)
- A game-theoretic equivalence to the Hahn-Banach theorem (Q2640469) (← links)
- Approximating the minimal lookahead needed to win infinite games (Q2671807) (← links)
- Strongly representable atom structures of relation algebras (Q2781354) (← links)
- The determinacy of infinite games with eventual perfect monitoring (Q3093451) (← links)