中文
相关论文

相关论文: Games and Ramsey-like cardinals

200 篇论文

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…

逻辑 · 数学 2009-09-25 Alan H. Mekler , Saharon Shelah , Jouko Väänänen

We extend the Fundamental Theorem of Epistemic Game Theory to games with Baire class one payoffs and locally compact Polish strategy spaces, and under Projective Determinacy, to games with analytically measurable payoffs and arbitrary…

逻辑 · 数学 2025-12-02 Stuart Zoble

It is shown that Matet's characterization of the Ramsey property relative to a selective co-ideal $\mathcal{H}$, in terms of games of Kastanas, still holds if we consider semiselectivity instead of selectivity. Moreover, we prove that a…

组合数学 · 数学 2014-10-20 Carlos Di Prisco , Jose G. Mijares , Carlos Uzcategui

We show that it is consistent relative to the existence of suitable large cardinals that for any countable-to-one coloring $c: [\omega_2]^2\to \omega_2$, there exists a closed subset $A\subseteq \omega_2$ of order type $\omega_1$ such that…

逻辑 · 数学 2026-05-11 Hannes Jakob , Jing Zhang

This is part I of a study on cardinals that are characterizable by Scott sentences. Building on [3], [6] and [1] we study which cardinals are characterizable by a Scott sentence $\phi$, in the sense that $\phi$ characterizes $\kappa$, if…

逻辑 · 数学 2016-02-10 Ioannis Souldatos

Can classical game-theoretic frameworks be extended to capture the bounded rationality and causal reasoning of AI agents? We investigate this question by extending Causal Normal Form Games (CNFGs) to sequential settings, introducing…

计算机科学与博弈论 · 计算机科学 2026-03-12 Dennis Thumm

Through careful analysis of an argument of Brooke-Taylor and Rosicky, we show that the powerful image of any accessible functor is closed under colimits of $\kappa$-chains, $\kappa$ a sufficiently large almost measurable cardinal. This…

逻辑 · 数学 2019-12-17 Michael Lieberman

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…

逻辑 · 数学 2023-08-08 Matthew Foreman , Menachem Magidor , Martin Zeman

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,…

组合数学 · 数学 2021-07-07 Urban Larsson , Richard J. Nowakowski , Carlos P. Santos

Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…

计算机科学中的逻辑 · 计算机科学 2014-01-14 Stefano Berardi

We study partition properties for uncountable regular cardinals that arise by restricting partition properties defining large cardinal notions to classes of simply definable colourings. We show that both large cardinal assumptions and…

逻辑 · 数学 2018-07-03 Philipp Lücke

In this paper we provide three new results axiomatizing the core of games in characteristic function form (not necessarily having transferable utility) obeying an innocuous condition (that the set of individually rational pay-off vectors is…

理论经济学 · 经济学 2024-10-01 Anindya Bhattacharya

The focus of this essay is a rigorous treatment of infinite games. An infinite game is defined as a play consisting of a fixed number of players whose sequence of moves is repeated, or iterated ad infinitum. Each sequence corresponds to a…

范畴论 · 数学 2010-01-12 Thomas Kellam Meyer

The main goal of the paper is the full proof of a cardinal inequality for a space with points $G_\delta $, obtained with the help of a long version of the Menger game. This result, which improves a similar one of Scheepers and Tall, was…

一般拓扑 · 数学 2017-11-30 Leandro F. Aurichi , Angelo Bella

This work is a part of my upcoming thesis [7]. We establish an equiconsistency between (1) weak indestructibility for all $\kappa +2$-degrees of strength for cardinals $\kappa $ in the presence of a proper class of strong cardinals, and (2)…

逻辑 · 数学 2024-11-20 James Holland

At the beginning of a dynamic game, players may have exogenous theories about how the opponents are going to play. Suppose that these theories are commonly known. Then, players will refine their first-order beliefs, and challenge their own…

计算机科学与博弈论 · 计算机科学 2017-07-28 Emiliano Catonini

The main purpose of the paper is the proof of a cardinal inequality for a space with points $G_\delta$, obtained with the help of a long version of the Menger game. This result improves a similar one of Scheepers and Tall.

一般拓扑 · 数学 2014-05-12 Leandro F. Aurichi , Angelo Bella

Classical game theory treats players as special---a description of a game contains a full, explicit enumeration of all players---even though in the real world, "players" are no more fundamentally special than rocks or clouds. It isn't…

人工智能 · 计算机科学 2015-08-19 Benja Fallenstein , Jessica Taylor , Paul F. Christiano

We strengthen non-structure theorems for almost free Abelian groups by studying long Ehrenfeucht-Fraisse games between a fixed group of cardinality lambda and a free Abelian group. A group is called epsilon-game-free if the isomorphism…

逻辑 · 数学 2007-05-23 Saharon Shelah , Pauli Väisänen

We show a new proof for the fact that when $\kappa$ and $\lambda$ are infinite cardinals satisfying $\lambda ^ \kappa = \lambda$, the cofinality of the set of all functions from $\lambda$ to $\kappa$ ordered by everywhere domination is…

逻辑 · 数学 2014-05-06 Dan Hathaway