Related papers: Determinacy separations for class games
Recent work by Atserias and Dawar (J. Log. Comp 2019) and Tucker-Foltz (LMCS 2024) has established undefinability results in fixed-point logic with counting (FPC) corresponding to many classical complexity results from the hardness of…
Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two…
A tournament is said to have the $S_k$-property if, for any set of $k$ players, there is another player who beats them all. Minimum tournaments having this property have been explored very well in the 1960's and the early 1970's. In this…
We prove that the determinacy of Gale-Stewart games whose winning sets are infinitary rational relations accepted by 2-tape B\"uchi automata is equivalent to the determinacy of (effective) analytic Gale-Stewart games which is known to be a…
We bound separations between the entangled and classical values for several classes of nonlocal $t$-player games. Our motivating question is whether there is a family of $t$-player XOR games for which the entangled bias is $1$ but for which…
We introduce a new covering property, defined in terms of order types of sequences of open sets, rather than in terms of cardinalities of families. The most general form of this compactness notion depends on two ordinal parameters. In the…
We isolate here a wide class of well founded orders called tame orders and show that each such order of cardinality at most $\kappa$ can be realized as the Mitchell order on a measurable cardinal $\kappa$, from a consistency assumption…
We provide elementary and uniform proofs of order independence for various strategy elimination procedures for finite strategic games, both for dominance by pure and by mixed strategies. The proofs follow the same pattern and focus on the…
We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is $\bf{0^{(\alpha)}}$ for…
The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that…
In this paper, we proved that a clopen version $S_1(C_O, C_O)$ of the Rothberger property and Borel strong measure zeroness are independent. For a zero-dimensional metric space $(X, d)$, $X$ satisfies $S_1(C_O, C_O)$ if, and only if, $X$…
While maximal independent families can be constructed from ZFC via Zorn's lemma, the presence of a maximal $\sigma$-independent family already gives an inner model with a measurable cardinal, and Kunen has shown that from a measurable…
We consider dynamic cooperative games, where the worth of coalitions varies over time according to the history of allocations. When defining the core of a dynamic game, we allow the possibility for coalitions to deviate at any time and…
Wealthy individuals may be less tempted to defect than those with comparatively low payoffs. To take this into consideration, we introduce coevolutionary success-driven multigames in structured populations. While the core game is always the…
We prove two determinacy and decidability results about two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actions.
The $P$ versus $NP$ problem is still unsolved. But there are several oracles with $P$ unequal $NP$ relative to them. Here we will prove, that $P\not=NP$ relative to a $P$-complete oracle. In this paper, we use padding arguments as the proof…
In this paper, we prove an inequality on the cardinalities of the minimum size global defensive alliance and the minimum size global offensive alliance. A global defensive alliance is a dominating set such that when any point inside a…
Cardinal characteristics of the continuum represent the boundaries in size between the countable and the continuum with respect to certain properties of sets. They are often defined as the minimum sizes of families of reals that meet some…
Once failure is irreversible, continuation payoffs cannot be meaningfully aggregated across strategies that differ in their survival properties. Standard scalar evaluation sidesteps this by arbitrarily completing payoffs beyond termination,…
We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem: Suppose $\kappa$ is a singular strong limit cardinal and…