English
Related papers

Related papers: Cardinals of the $P_\kappa(\lambda)$-Filter Games

200 papers

We will give an overview of four families of cardinal characteristics defined on subspaces $\prod_{\alpha\in\kappa}b(\alpha)$ of the generalised Baire space ${}^\kappa\kappa$, where $\kappa$ is strongly inaccessible and…

Logic · Mathematics 2025-03-17 Tristan van der Vlugt

We characterize several large cardinal notions by model-theoretic properties of extensions of first-order logic. We show that $\Pi_n$-strong cardinals, and, as a corollary, ``Ord is Woodin" and weak Vop\v{e}nka's Principle, are…

Logic · Mathematics 2025-05-22 Will Boney , Jonathan Osinski

Let $\mu < \kappa < \lambda$ be three infinite cardinals, the first two being regular. We show that if there is no inner model with large cardinals, $u (\kappa, \lambda)$ is regular, where $u (\kappa, \lambda)$ denotes the least size of a…

Logic · Mathematics 2023-08-30 Pierre Matet

We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…

Logic · Mathematics 2019-01-18 P. D. Welch

Given a forcing notion $P$ that forces certain values to several classical cardinal characteristics of the reals, we show how we can compose $P$ with a collapse (of a cardinal $\lambda>\kappa$ to $\kappa$) such that the composition still…

Logic · Mathematics 2020-06-19 Martin Goldstern , Jakob Kellner , Diego A. Mejía , Saharon Shelah

Picture countably many logicians all wearing a hat in one of $\kappa$-many colours. They each get to look at finitely many other hats and afterwards make finitely many guesses for their own hat's colour. For which $\kappa$ can the logicians…

Logic · Mathematics 2024-11-12 Andreas Lietz , Jeroen Winkel

The paper settles the problem of the consistency of the existence of a single universal graph between a strong limit singular and its power. Assuming that in a model of $\mathbf{GCH}$ $\kappa$ is supercompact and the cardinals $\theta <…

Logic · Mathematics 2022-01-04 Márk Poór , Saharon Shelah

We determine the consistency strength of determinacy for projective games of length $\omega^2$. Our main theorem is that $\boldsymbol\Pi^1_{n+1}$-determinacy for games of length $\omega^2$ implies the existence of a model of set theory with…

Logic · Mathematics 2020-04-22 Juan P. Aguilera , Sandra Müller

We prove that consistently there is a singular cardinal $\kappa$ of uncountable cofinality such that $2^\kappa$ is weakly inaccessible, and every regular cardinal strictly between $\kappa$ and $2^\kappa$ is the character of some uniform…

Logic · Mathematics 2019-07-30 James Cummings , Charles Morgan

The rationalizability concept was introduced in \cite{Ber84} and \cite{Pea84} to assess what can be inferred by rational players in a non-cooperative game in the presence of common knowledge. However, this notion can be defined in a number…

Computer Science and Game Theory · Computer Science 2007-06-13 Krzysztof R. Apt

We show that if $\lambda^{<\kappa} = \lambda$ and every normal filter on $P_\kappa\lambda$ can be extended to a $\kappa$-complete ultrafilter then so does every $\kappa$-complete filter on $\lambda$. This answers a question of Gitik.

Logic · Mathematics 2019-10-30 Yair Hayut

In this paper we use infinitary Turing machines with tapes of length $\kappa$ and which run for time $\kappa$ as presented, e.g., by Koepke \& Seyfferth, to generalise the notion of type two computability to $2^{\kappa}$, where $\kappa$ is…

Logic · Mathematics 2017-04-11 Lorenzo Galeotti , Hugo Nobrega

Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…

Logic · Mathematics 2012-08-14 M. Malliaris , S. Shelah

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…

Logic · Mathematics 2024-03-15 Andreas Lietz

We apply the theory of infinite two-person games to two well-known problems in topology: Suslin's Problem and Arhangel'skii's problem on $G_\delta$ covers of compact spaces. More specifically, we prove results of which the following two are…

General Topology · Mathematics 2015-07-09 Santi Spadaro

Given a weakly compact cardinal $\kappa$, we give an axiomatization of intuitionistic first-order logic over $\mathcal{L}_{\kappa^+, \kappa}$ and prove it is sound and complete with respect to Kripke models. As a consequence we get the…

Logic · Mathematics 2020-12-29 Christian Espíndola

The paper gives several sufficient conditions on the paracompactness of box products with an arbitrary number of many factors and boxes of arbitrary size. The former include results on generalised metrisability and Sikorski spaces. Of…

Logic · Mathematics 2022-11-07 David Buhagiar , Mirna Džamonja

Let $\kappa$,$\lambda$ be regular uncountable cardinals such that $\lambda > \kappa^+$ is not a successor of a singular cardinal of low cofinality. We construct a generic extension with $s(\kappa) = \lambda$ starting from a ground model in…

Logic · Mathematics 2015-08-18 Omer Ben-Neria , Moti Gitik

Inspired by work of Scheepers and Tall, we use properties defined by topological games to provide bounds for the cardinality of topological spaces. We obtain a partial answer to an old question of Bell, Ginsburg and Woods regarding the…

General Topology · Mathematics 2013-02-22 Angelo Bella , Santi Spadaro

We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respect to the product topology on the tree). Gale and Stewart…

Optimization and Control · Mathematics 2026-02-17 Dean Kraizberg