Related papers: Partitioning a reflecting stationary set
We introduce a generalization of stationary set reflection which we call "filter reflection", and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We prove the independence of filter reflection…
If $S,T$ are stationary subsets of a regular uncountable cardinal $\kappa$, we say that $S$ reflects fully in $T$, $S<T$, if for almost all $\alpha \in T$ (except a nonstationary set) $S \cap \alpha$ is stationary in $\alpha .$ This…
The notion of stationary reflection is one of the most important notions of combinatorial set theory. We investigate weak reflection, which is, as the name suggests, a weak version of stationary reflection. This sort of reflection was…
Bounded stationary reflection at a cardinal $\lambda$ is the assertion that every stationary subset of $\lambda$ reflects but there is a stationary subset of $\lambda$ that does not reflect at arbitrarily high cofinalities. We produce a…
A stationary subset S of a regular uncountable cardinal kappa reflects fully at regular cardinals if for every stationary set T subseteq kappa of higher order consisting of regular cardinals there exists an alpha in T such that S cap alpha…
Combining stationary reflection (a compactness property) with the failure of SCH (an instance of non-compactness) has been a long-standing theme. We obtain this at $\aleph_{\omega_1}$, answering a question of Ben-Neria, Hayut, and Unger: We…
In this paper we prove that from large cardinals it is consistent that there is a singular strong limit cardinal $\nu$ such that the singular cardinal hypothesis fails at $\nu$ and every collection of fewer than $\mathrm{cf}(\nu)$…
We introduce and axiomatize the notion of a reflective cardinal, use it to give semantics to higher order set theory, and explore connections between the notion of reflective cardinals and large cardinal axioms.
A stationary subset $S$ of a regular uncountable cardinal $\kappa$ {\it reflects fully} at regular cardinals if for every stationary set $T \subseteq \kappa$ of higher order consisting of regular cardinals there exists an $\alpha \in T$…
We prove that, e.g., if mu >cf(mu)= aleph_0 and mu>2^{aleph_0} and every stationary family of countable subsets of mu^+ reflect in some subset of mu^+ of cardinality aleph_1, then the SCH for mu^+ (moreover, for mu^+, any scale for mu^+ has…
We improve the upper bound for the consistency strength of stationary reflection at successors of singular cardinals.
We obtain strong coloring theorems at successors of singular cardinals from failures of certain instances of simultaneous reflection of stationary sets. Along the way, we establish new results in club-guessing and in the general theory of…
Let kappa be a regular uncountable cardinal and lambda >=kappa^+ . The principle of stationary reflection for P_kappa lambda has been successful in settling problems of infinite combinatorics in the case kappa=omega_1. For a greater kappa…
Inspired by Zermelo's quasi-categoricity result characterizing the models of second-order Zermelo-Fraenkel set theory $\text{ZFC}_2$, we investigate when those models are fully categorical, characterized by the addition to $\text{ZFC}_2$…
We study consequences of stationary and semi-stationary set reflection. We show that the semi stationary reflection principle implies the Singular Cardinal Hypothesis, the failure of weak square principle, etc. We also consider two cardinal…
In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…
This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…
Large sets of combinatorial designs has always been a fascinating topic in design theory. These designs form a partition of the whole space into combinatorial designs with the same parameters. In particular, a large set of block designs,…
Every infinite group $G$ of regular cardinality can be partitioned $G=A_1\cup A_2$ so that $G\neq FA_1$, $G\neq FA_2$ for every subset $F\subset G$ of cardinality $|F|<|G|$. The first author asked whether the same is true for each group $G$…
Working in the context of restricted forms of the Axiom of Choice, we consider the problem of splitting the ordinals below $\lambda$ of cofinality $\theta$ into $\lambda$ many stationary sets, where $\theta < \lambda$ are regular cardinals.…