Related papers: Exactly controlling the non-supercompact strongly …
We study combinatorial principles known as stick and club. Several variants of these principles and cardinal invariants connected to them are also considered. We introduce a new kind of side-by-side product of partial orders which we call…
Providing explanations about how machine learning algorithms work and/or make particular predictions is one of the main tools that can be used to improve their trusworthiness, fairness and robustness. Among the most intuitive type of…
We show that many large cardinal notions can be characterized in terms of the existence of certain elementary embeddings between transitive set-sized structures, that map their critical point to the large cardinal in question. In…
In this paper we study the notion of strong non-reflection, and its contrapositive weak reflection. We say theta strongly non-reflects at lambda iff there is a function F: theta ---> lambda such that for all alpha < theta with cf(alpha)=…
We introduce a hierarchy of large cardinals between weakly compact and measurable cardinals, that is closely related to the Ramsey-like cardinals introduced by Victoria Gitman, and is based on certain infinite filter games, however also has…
A version of Woodin's HOD dichotomy is proved assuming the existence of just one strongly compact cardinal.
We study the compactification of nonautonomous systems with autonomous limits and related dynamics. Although the $C^{1}$ extension of the compactification was well established, a great number of problems arising in bifurcation and stability…
This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
Index tracking is a popular passive investment strategy aimed at optimizing portfolios, but fully replicating an index can lead to high transaction costs. To address this, partial replication have been proposed. However, the cardinality…
Assume V=L and lambda is regular smaller than the first weakly compact cardinal. Under those circumstances and with arbitrary requirements on the structure of Ext(G,Z) (under well known limitations), we construct an abelian group G of…
We isolate here a wide class of well founded orders called tame orders and show that each such order of cardinality at most $\kappa$ can be realized as the Mitchell order on a measurable cardinal $\kappa$, from a consistency assumption…
We show that some common and important global constraints like ALL-DIFFERENT and GCC can be decomposed into simple arithmetic constraints on which we achieve bound or range consistency, and in some cases even greater pruning. These…
In [Bon20], model theoretic characterizations of several established large cardinal notions were given. We continue this work, by establishing such characterizations for Woodin cardinals (and variants), various virtual large cardinals, and…
Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…
In 1990, Comfort asked: is there, for every cardinal number $\alpha \leq 2^{\mathfrak{c}}$, a topological group $G$ such that $G^\gamma$ is countably compact for all cardinals $\gamma<\alpha$, but $G^\alpha$ is not countably compact? A…
An important classical result in ZFC asserts that every infinite cardinal number is idempotent. Using this fact, we obtain several algebraic results in this article. The first result asserts that an infinite Abelian group has a proper…
We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…
Let $\mathcal{N}$ be the $\sigma$-ideal of the null sets of reals. We introduce a new property of forcing notions that enable control of the additivity of $\mathcal{N}$ after finite support iterations. This is applied to answer some open…
We show that Keisler's order is not linear, assuming the existence of a supercompact cardinal.