English
Related papers

Related papers: A game on partial orderings

200 papers

We introduce a new type of game on natural numbers of variable countable length, which can be regarded as a diagonalization of all games of fixed countable length on natural numbers. Building on previous work by Trang and Woodin, we show…

Logic · Mathematics 2026-01-08 Takehiko Gappo , Sandra Müller

Let (A) and (B) be two first order structures of the same vocabulary. We shall consider the Ehrenfeucht-Fra{i}sse-game of length omega_1 of A and B which we denote by G_{omega_1}(A,B). This game is like the ordinary Ehrenfeucht-Fraisse-game…

Logic · Mathematics 2009-09-25 Alan H. Mekler , Saharon Shelah , Jouko Väänänen

We give a new proof of a theorem of Shelah which states that for every family of labeled trees, if the cardinality $\kappa$ of the family is much larger (in the sense of large cardinals) than the cardinality $\lambda$ of the set of labels,…

Logic · Mathematics 2019-08-08 Trevor M. Wilson

An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…

Logic · Mathematics 2024-08-28 Tonatiuh Matos-Wiederhold , Luciano Salvetti

We show, assuming weak large cardinals, that in the context of games played in a proper class of moves, clopen determinacy is strictly weaker than open determinacy. The proof amounts to an analysis of a certain level of $L$ that exists…

Logic · Mathematics 2016-07-20 Sherwood Hachtman

It is shown that the power set of $\kappa$ ordered by the subset relation modulo various versions of the non-stationary deal can be embedded into the partial order of Borel equivalence relations on $2^\kappa$ under Borel reducibility. Here…

Logic · Mathematics 2025-11-25 Vadim Kulikov

Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…

Computer Science and Game Theory · Computer Science 2015-07-29 Dietmar Berwanger , Anup Basil Mathew

The aim of this note is to investigate the open-open game of uncountable length. We introduce a cardinal number $\mu(X)$, which says how long the Player I has to play to ensure a victory. It is proved that $\su(X)\leq\mu(X)\leq\su(X)^+$. We…

General Topology · Mathematics 2016-12-30 Andrzej Kucharski

We show that the order dimension of the partial order of all finite subsets of $\kappa$ under set inclusion is ${\log}_{2}({\log}_{2}(\kappa))$ whenever $\kappa$ is an infinite cardinal. We also show that the order dimension of any locally…

Logic · Mathematics 2019-02-19 Kojiro Higuchi , Steffen Lempp , Diip Raghavan , Frank Stephan

Berlekamp proposed a class of impartial combinatorial games based on the moves of chess pieces on rectangular boards. We generalize impartial chess games by playing them on Young diagrams and obtain results about winning and losing…

Combinatorics · Mathematics 2025-01-27 Eric Gottlieb , Matjaž Krnc , Peter Muršič

The current paper answers an open question of abs/1007.2426 We say that a countable model M characterizes an infinite cardinal kappa, if the Scott sentence of M has a model in cardinality kappa, but no models in cardinality kappa plus. If M…

Logic · Mathematics 2012-05-07 Ioannis Souldatos

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Logic · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

The present study explores a problem that can be resolved by employing the notion of a partially defined cooperative game, yet cannot by using a restricted game. The following situation is considered: First, it is assumed that the worth of…

Computer Science and Game Theory · Computer Science 2025-11-27 Satoshi Masuya

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Logic · Mathematics 2026-01-06 Saharon Shelah

We modify the game Fuchino, Koppelberg, and Shelah used to characterize the $\kappa$-Freese-Nation property for a given Boolean algebra $A$, replacing players I and II each with a team of $n$ players with limited information. We show that…

Logic · Mathematics 2022-03-02 David Milovich

This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call \emph{Welch games}. Player II having a winning strategy in the Welch game of length $\omega$ on $\kappa$ is…

Logic · Mathematics 2023-08-08 Matthew Foreman , Menachem Magidor , Martin Zeman

Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$ (e.g., if the Generalized Continuum Hypothesis holds), we develop a proof system for classical infinitary logic that includes heterogeneous quantification (i.e., infinite…

Logic · Mathematics 2019-02-04 Christian Espíndola

We investigate a variety of cut and choose games, their relationship with (generic) large cardinals, and show that they can be used to characterize a number of properties of ideals and of partial orders: certain notions of distributivity,…

Logic · Mathematics 2023-02-03 Peter Holy , Philipp Schlicht , Christopher Turner , Philip Welch

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

Logic · Mathematics 2026-03-19 Saharon Shelah

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.

Computer Science and Game Theory · Computer Science 2008-11-26 Nathalie Bertrand , Blaise Genest , Hugo Gimbert
‹ Prev 1 2 3 10 Next ›