AbstractWe study the determinacy of the game Gκ(A) introduced in Fuchino, Koppelberg and Shelah (to appear) for uncountable regular κ and several classes of partial orderings A. Among trees or Boolean algebras, we can always find an A such that Gκ(A) is undetermined. For the class of linear orders, the existence of such A depends on the size of κ<κ. In particular we obtain a characterization of κ<κ = κ in terms of determinacy of the game Gκ(L) for linear orders L
For deterministic tree automata, classical hierarchies, like Mostowski-Rabin (or index) hierarchy, B...
We study the strength of determinacy hypotheses in levels of two hierarchies of subsets of Baire spa...
Abstract. We introduce a new method, involving infinite games and Borel determinacy, which we use to...
AbstractWe study the determinacy of the game Gκ(A) introduced in Fuchino, Koppelberg and Shelah (to ...
Given a set of combinatorial games, the children are all those games that can be generated using as ...
AbstractThe problem of partial order game tree search arises from game playing situations where mult...
The aim of the paper is to use some known results of the theory of boolean functions and of the theo...
Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine...
Given a set of combinatorial games, the children are all those games that can be generated using as ...
AbstractOikkonen, J. and J. Väänänen, Game-theoretic inductive definability, Annals of Pure and Appl...
Abstract. The games Gη1 (κ) and Gη<λ(κ) are played by two players in η+-complete and max(η+, λ)-c...
Borel determinacy states that if $G(T,X) $ is a game and $X $ is Borel, then $G(T,X) $ is determined...
A previous work by Friedman et al. (Theory and Decision, 61:305–318, 2006) introduces the concept of...
algebra B. Games of type (κ, λ, µ) are played in κ-many moves: First White chooses p ∈ B+. In α-th m...
We introduce model-checking games that allow local second-order power on sets of independent transit...
For deterministic tree automata, classical hierarchies, like Mostowski-Rabin (or index) hierarchy, B...
We study the strength of determinacy hypotheses in levels of two hierarchies of subsets of Baire spa...
Abstract. We introduce a new method, involving infinite games and Borel determinacy, which we use to...
AbstractWe study the determinacy of the game Gκ(A) introduced in Fuchino, Koppelberg and Shelah (to ...
Given a set of combinatorial games, the children are all those games that can be generated using as ...
AbstractThe problem of partial order game tree search arises from game playing situations where mult...
The aim of the paper is to use some known results of the theory of boolean functions and of the theo...
Schmidt's game is a powerful tool for studying properties of certain sets which arise in Diophantine...
Given a set of combinatorial games, the children are all those games that can be generated using as ...
AbstractOikkonen, J. and J. Väänänen, Game-theoretic inductive definability, Annals of Pure and Appl...
Abstract. The games Gη1 (κ) and Gη<λ(κ) are played by two players in η+-complete and max(η+, λ)-c...
Borel determinacy states that if $G(T,X) $ is a game and $X $ is Borel, then $G(T,X) $ is determined...
A previous work by Friedman et al. (Theory and Decision, 61:305–318, 2006) introduces the concept of...
algebra B. Games of type (κ, λ, µ) are played in κ-many moves: First White chooses p ∈ B+. In α-th m...
We introduce model-checking games that allow local second-order power on sets of independent transit...
For deterministic tree automata, classical hierarchies, like Mostowski-Rabin (or index) hierarchy, B...
We study the strength of determinacy hypotheses in levels of two hierarchies of subsets of Baire spa...
Abstract. We introduce a new method, involving infinite games and Borel determinacy, which we use to...
DOI
Add to ORKG