Related papers: Increasing the second uniform indiscernible by str…

We investigate iterating the construction of $C(\mathtt{aa})$, the $L$-like inner model constructed using stationary-logic. We show that it is possible to force over generic extensions of $L$ to obtain a model of $V=C(\mathtt{aa})$, and to…

For $\lambda$ inaccessible, we may consider $(< \lambda)$-support iteration of some specific $(<\lambda)$-complete $\lambda^+$-c.c. forcing notion. But this fails a "preservation by restricting to a sub-sequence of the forcing, we "correct"…

Using a game-theoretic approach we present a generalization of the classical result of Brzuchowski, Cicho\'n, Grzegorek and Ryll-Nardzewski on non-measurable unions. We also present applications of obtained results to Marczewski--Burstin…

Let $Z_3$ denote $3^{rd}$ order arithmetic. Let Harrington's Principle, HP, denote the statement that there is a real $x$ such that every $x$--admissible ordinal is a cardinal in $L$. In this paper, assuming there exists a remarkable…

Rock-paper-scissors games metaphorically model cyclic dominance in ecology and microbiology. In a static environment, these models are characterized by fixation probabilities obeying two different "laws" in large and small well-mixed…

Parrondo's paradox arises in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. We present a suitable version…

We solve the problem of automatically computing a new class of environment assumptions in two-player turn-based finite graph games which characterize an ``adequate cooperation'' needed from the environment to allow the system player to win.…

We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…

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…

Spatial evolution game has traditionally assumed that players interact with neighbors on a single network, which is isolated and not influenced by other systems. We introduce the simple game model into the interdependent networks composed…

In \cite{MV} we defined and proved the consistency of the principle ${\rm GM}^+(\omega_3,\omega_1)$ which implies that many consequences of strong forcing axioms hold simultaneously at $\omega_2$ and $\omega_3$. In this paper we formulate a…

This paper continues the author's previous study \cite{Kura20}, showing that several weak principles inspired by non-normal modal logic suffice to derive various refined forms of the second incompleteness theorem. Among the main results of…

We answer a question of Woodin by showing that assuming an inaccessible cardinal $\kappa$ which is a limit of ${<}\kappa$-supercompact cardinals exists, there is a stationary set preserving forcing $\mathbb{P}$ so that $V^{\mathbb…

We consider average-energy games, where the goal is to minimize the long-run average of the accumulated energy. While several results have been obtained on these games recently, decidability of average-energy games with a lower-bound…

We propose a unifying additive theory for standard conventions in Combinatorial Game Theory, including normal-, mis\`ere- and scoring-play, studied by Berlekamp, Conway, Dorbec, Ettinger, Guy, Larsson, Milley, Neto, Nowakowski, Renault,…

Shelah shows that certain revised countable support (RCS) iterations do not add reals. His motivation is to establish the independence (relative to large cardinals) of Avraham's problem on the existence of uncountable non-constuctible…

Parrondo games with one-dimensional spatial dependence were introduced by Toral and extended to the two-dimensional setting by Mihailovi\'c and Rajkovi\'c. $MN$ players are arranged in an $M\times N$ array. There are three games, the fair,…

We investigate game-theoretic variants of cardinal invariants of the continuum. The invariants we treat are the reaping number $\mathfrak{r}$, the bounding number $\mathfrak{b}$, the dominating number $\mathfrak{d}$, and the additivity…

Infinite-duration games with disturbances extend the classical framework of infinite-duration games, which captures the reactive synthesis problem, with a discrete measure of resilience against non-antagonistic external influence. This…

We prove exponential convergence to the stationary measure for a class of 1d Lagrangian systems with random forcing in the space-periodic setting: $$ \phi_t+\phi_x^2/2=F^{\omega}, x \in S^1 = \mathbb{R}/\mathbb{Z}. $$ This confirms a part…