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

We use Shelah's theory of possible cofinalities in order to solve a problem about ultrafilters. THEOREM. Suppose that $ \lambda $ is a singular cardinal, $ \lambda ' < \lambda $, and the ultrafilter $D$ is $ \kappa $-decomposable for all…

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…

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

This paper establishes a number of constraints on the structure of large cardinals under strong compactness assumptions. These constraints coincide with those imposed by the Ultrapower Axiom, a principle that is expected to hold in Woodin's…

We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…

We consider the partition lattice $\Pi_\kappa$ on any set of transfinite cardinality $\kappa$ and properties of $\Pi_\kappa$ whose analogues do not hold for finite cardinalities. Assuming the Axiom of Choice we prove: (I) the cardinality of…

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…

The lottery preparation, a new general kind of Laver preparation, works uniformly with supercompact cardinals, strongly compact cardinals, strong cardinals, measurable cardinals, or what have you. And like the Laver preparation, the lottery…

Let $\mathrm{cof}(\mu)=\mu$ and $\kappa$ be a supercompact cardinal with $\mu<\kappa$. Assume that there is an increasing and continuous sequence of cardinals $\langle\kappa_\xi\mid \xi<\mu\rangle$ with $\kappa_0:=\kappa$ and such that, for…

Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We…

We study the effects of piece selection principles on cardinal arithmetic (Shelah style). As an application, we discuss questions of Abe and Usuba. In particular, we show that if $\lambda \geq 2^\kappa$, then (a) $I_{\kappa, \lambda}$ is…

The game theoretic concepts of rationalizability and iterated dominance are closely related and provide characterizations of each other. Indeed, the equivalence between them implies that in a two player finite game, the remaining set of…

V\"a\"an\"anen and Welch asked in the paper "When cardinals determine the power set: inner models and H\"artig quantifier logic" which large cardinals are consistent with the power set operation $x\mapsto P(x)$ being $\Sigma_1$-definable in…

We extend a theorem by Juh\'asz and Szentmikl\'ossy to notions related to pseudocompactness. We also allow the case when one of the cardinals under consideration is singular. We give an application to the study of decomposable ultrafilters:…

Given a Woodin cardinal $\delta$, I show that if $F$ is any Easton function with $F"\delta\subseteq\delta$ and $\GCH$ holds, then there is a cofinality-preserving forcing extension in which $2^\gamma= F(\gamma)$ for each regular cardinal…

Assuming $\kappa$ is a supercompact cardinal and $\lambda$ is an inaccessible cardinal above it, we present an idea due to Magidor, to find a generic extension in which $\kappa=\aleph_\omega$ and $\lambda=\aleph_{\omega+1}.$

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…

We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations…

We show that the notions of "strongly unfoldable cardinals", introduced by Villaveces in his model-theoretic studies of models of set theory, and "shrewd cardinals", introduced by Rathjen in a proof-theoretic context, coincide. We then…

In this paper, we characterize the possible cofinalities of the least $\lambda$-strongly compact cardinal. We show that, on the one hand, for any regular cardinal, $\delta$, that carries a $\lambda$-complete uniform ultrafilter, it is…