scientific article; zbMATH DE number 3078993
From MaRDI portal
Publication:5817866
zbMath0050.14305MaRDI QIDQ5817866
Publication date: 1953
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
Differential Game Logic ⋮ Adaptive competitive decision in repeated play of a matrix game with uncertain entries ⋮ Unnamed Item ⋮ Open determinacy for class games ⋮ On history-deterministic one-counter nets ⋮ Determinacy and regularity properties for idealized forcings ⋮ Reachability games and parity games ⋮ Determinacy axioms and large cardinals ⋮ A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct ⋮ Generalizing Pure and Impure Iterated Prisoner’s Dilemmas to the Case of Infinite and Infinitesimal Quantities ⋮ Interview with Andrzej Nowak - Laureate of the Rufus Isaacs Award ⋮ Transfinite game values in infinite draughts ⋮ On Badly Approximable Numbers and Certain Games ⋮ The Game Quantifier ⋮ Determinacy and the sharp function on the reals ⋮ On Values of Games ⋮ Topological properties of omega context-free languages ⋮ The Complexity of Nash Equilibria in Infinite Multiplayer Games ⋮ Canonical varieties with no canonical axiomatisation ⋮ On winning shifts of marked uniform substitutions ⋮ Determinacy and the sharp function on the reals ⋮ GAMES AND REFLECTION IN ⋮ Good-for-Game QPTL: An Alternating Hodges Semantics ⋮ The challenge of non-zero-sum stochastic games ⋮ Solving Infinite Games in the Baire Space ⋮ Power type asymptotically uniformly smooth and asymptotically uniformly flat norms ⋮ Progress measures, immediate determinacy, and a subset construction for tree automata ⋮ Strategies in Games: A Logic-Automata Study ⋮ Alternation and \(\omega\)-type Turing acceptors ⋮ Unnamed Item ⋮ The axiom of determinacy and the modern development of descriptive set theory ⋮ Alternating automata on infinite trees ⋮ The consistency strength of projective absoluteness ⋮ Unraveling \({\boldsymbol\Pi}^1_1\) sets, revisited ⋮ Descriptive set theory, from Cantor to Wadge and beyond ⋮ Infinite games specified by 2-tape automata ⋮ Ranks of Maharam algebras ⋮ A game-theoretic equivalence to the Hahn-Banach theorem ⋮ David Gale in Paris ⋮ ReGale: some memorable results ⋮ Lower bounds on degrees of game-theoretic structures ⋮ An infinite version of Arrow's theorem in the effective setting ⋮ Game semantics for non-monotonic intensional logic programming ⋮ Weihrauch Degrees of Finding Equilibria in Sequential Games ⋮ The structure of non-zero-sum stochastic games ⋮ Polynomial games and determinacy ⋮ A semi-potential for finite and infinite games in extensive form ⋮ Topological extension of parity automata ⋮ Finite-state strategies in delay games ⋮ Approximating the minimal lookahead needed to win infinite games ⋮ On branching and looping. I ⋮ On branching and looping. II ⋮ Information tracking in games on graphs ⋮ Set theory and the analyst ⋮ A Topological Study of Tilings ⋮ The axiom of real Blackwell determinacy ⋮ Max Euwe's Set-Theoretic Observations on the Game of Chess — Introductory Notes ⋮ \({\mathbf H}\)-trivial spaces ⋮ A game-theoretic characterization of Boolean grammars ⋮ Ordinal solution of open games and analytic sets ⋮ Introduction to computability logic ⋮ Galvin's ``racing pawns game, internal hyperarithmetic comprehension, and the law of excluded middle ⋮ Greatly Erdős cardinals with some generalizations to the Chang and Ramsey properties ⋮ Unnamed Item ⋮ Groups, graphs, languages, automata, games and second-order monadic logic ⋮ Minimal collapsing extensions of models of ZFC ⋮ Lottery semantics: a compositional semantics for probabilistic first-order logic with imperfect information ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Some undecidable determined games ⋮ Unnamed Item ⋮ Asset market games of survival: a synthesis of evolutionary and dynamic games ⋮ On the determinacy of concurrent games on event structures with infinite winning sets ⋮ First-order dialogical games and tableaux ⋮ Indecision and delays are the parents of failure -- taming them algorithmically by synthesizing delay-resilient control ⋮ A characterization of \(\Sigma_1^1\)-reflecting ordinals ⋮ Deductive verification of alternating systems ⋮ Homogeneity for Open Partitions of Pairs of Reals ⋮ Games of search and completion ⋮ A game semantics for linear logic ⋮ Degree Spectra of Relations on a Cone ⋮ Generic Vopěnka's principle, remarkable cardinals, and the weak proper forcing axiom ⋮ Non-Archimedean game theory: a numerical approach ⋮ Recursively presented games and strategies ⋮ Parallel strategies ⋮ Gurevich-Harrington's games defined by finite automata ⋮ An infinite-game semantics for well-founded negation in logic programming ⋮ Forcing axioms and stationary sets ⋮ Happy families and completely Ramsey sets ⋮ A logical analysis of Monty Hall and Sleeping Beauty ⋮ First-cycle games ⋮ Catch games: the impact of modeling decisions ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Topological aspects of poset spaces ⋮ Strongly representable atom structures of relation algebras ⋮ Limit of multistage \(n\)-person games ⋮ Symmetric Derivates, Scattered, and Semi-Scattered Sets ⋮ The uniform measure of simple regular sets of infinite trees ⋮ Propositional games with explicit strategies ⋮ Facets of Synthesis: Revisiting Church’s Problem
This page was built for publication:
