相关论文: A game on partial orderings

Duch\^ene and Rigo introduced the notion of invariance for take-away games on heaps. Roughly speaking, these are games whose rulesets do not depend on the position. Given a sequence $S$ of positive tuples of integers, the question of…

We extend A. Miller's framework of $\alpha$-forcing to the case of a regular uncountable cardinal $\kappa = \kappa^{<\kappa}$ and apply it to study the structure of the $\kappa$-Borel hierarchy on subspaces of the generalized Baire space…

It is shown that determinacy of $F_\sigma$ games of length $\omega^2$ is equivalent to the existence of a transitive model of KP + AD which contains the reals and reflects $\Pi_1$ facts about the next admissible set.

For finite semidistributive lattices the map $\kappa$ gives a bijection between the sets of completely join-irreducible elements and completely meet-irreducible elements. Here we study the $\kappa$-map in the context of torsion classes. It…

We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…

In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…

We introduce a natural notion of limit-deterministic parity automata and present a method that uses such automata to construct satisfiability games for the weakly aconjunctive fragment of the $\mu$-calculus. To this end we devise a method…

We show that the higher-order matching problem is decidable using a game-theoretic argument.

We define a new class of infinitary logics $\mathscr L^1_{\kappa,\alpha}$ generalizing Shelah's logic $\mathbb L^1_\kappa$ defined in \cite{MR2869022}. If $\kappa=\beth_\kappa$ and $\alpha <\kappa$ is infinite then our logic coincides with…

The traditional mathematical model for an impartial combinatorial game is defined recursively as a set of the options of the game, where the options are games themselves. We propose a model called gamegraph, together with its generalization…

It is shown that Borel games of length $\omega^2$ are determined if, and only if, for every countable ordinal $\alpha$, there is a fine-structural, countably iterable extender model of Zermelo set theory with $\alpha$-many iterated…

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

We determine the consistency strength of determinacy for projective games of length $\omega^2$. Our main theorem is that $\boldsymbol\Pi^1_{n+1}$-determinacy for games of length $\omega^2$ implies the existence of a model of set theory with…

Picture countably many logicians all wearing a hat in one of $\kappa$-many colours. They each get to look at finitely many other hats and afterwards make finitely many guesses for their own hat's colour. For which $\kappa$ can the logicians…

In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…

Partial methods play an important role in formal methods and beyond. Recently such methods were developed for parity games, where polynomial-time partial solvers decide the winners of a subset of nodes. We investigate here how effective…

We study the underlying mathematical properties of various partial order models of concurrency based on transition systems, Petri nets, and event structures, and show that the concurrent behaviour of these systems can be captured in a…

We introduce a class of extensive form games where players might not be able to foresee the possible consequences of their decisions and form a model of their opponents which they exploit to achieve a more profitable outcome. We improve…

We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations…

This paper addresses the longstanding problem of determining the structure of the $\leq_{\mathrm{LT}}$-order in the Effective Topos, known to effectively embed the Turing degrees. In a surprising discovery, we show that the…