Related papers: Approachable Free Subsets and Fine Structure Deriv…
A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…
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…
We show that if $\kappa < \aleph_\omega$ Cohen reals are added to a model of $\mathsf{CH}$, then there are nontrivial automorphisms of $\mathcal P(\omega)/\mathrm{Fin}$ in the extension. Under some further hypotheses on the ground model,…
In this paper, we obtain the consistency, relative to large cardinals, of the existence of dense ideals on every successor of a regular cardinal simultaneously. Using a consequent transfer principle, we show that in this model there is a…
The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…
We prove that if $\lambda$ is a fixed uncountable cardinal and $f = \langle \ka_{\al} : \al < \delta \rangle$ is a sequence of infinite cardinals where $\delta < \omega_3$ and $\ka_{\al}\in \{\om,\lambda\}$ for each $\al < \delta$ in such a…
A $\Lambda$-tree is a $\Lambda$-metric space satisfying three axioms (1), (2) and (3). We give a characterization of those ordered abelian groups $\Lambda$ for which axioms (1) and (2) imply axiom (3). As a special case, it follows that for…
A number of first-order calculi employ an explicit model representation formalism for automated reasoning and for detecting satisfiability. Many of these formalisms can represent infinite Herbrand models. The first-order fragment of…
The theory ZFC implies the scheme that for every cardinal $\delta$ we can make $\delta$ many dependent choices over any definable relation without terminal nodes. Friedman, the first author, and Kanovei constructed a model of ZFC$^-$ (ZFC…
This is a paper that aims to interpret the cardinality of a set in terms of Baire Category, i.e. how many closed nowhere dense sets can be deleted from a set before the set itself becomes negligible. . To do this natural tree-theoretic…
We derive a priori bounds on the size of the structure constants of the free Lie algebra over a set of indeterminates, relative to its Hall bases. We investigate their asymptotic growth, especially as a function of the length of the…
Smallish large cardinals $\kappa$ are often characterized by the existence of a collection of filters on $\kappa$, each of which is an ultrafilter on the subsets of $\kappa$ of some transitive $\mathrm{ZFC}^-$-model of size $ \kappa$. We…
Assuming some large cardinals, a model of ZFC is obtained in which aleph_{omega+1} carries no Aronszajn trees. It is also shown that if lambda is a singular limit of strongly compact cardinals, then lambda^+ carries no Aronszajn trees.
The concept of local symmetry dynamics has recently been used to demonstrate the evolution of discrete symmetries in one-dimensional chains leading to emergent periodicity. Here we go one step further and show that the unboundedness of this…
Two pressing topics in the theory of deep learning are the interpretation of feature learning (FL) mechanisms and the determination of implicit bias of networks in the rich regime. Current theories of rich FL often appear in the form of…
It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…
Starting with infinitely many supercompact cardinals, we show that the tree property at every cardinal $\aleph_n$, $1 < n <\omega$, is consistent with an arbitrary continuum function below $\aleph_\omega$ which satisfies $2^{\aleph_n} >…
We study closure properties of measurable ultrapowers with respect to Hamkin's notion of "freshness" and show that the extent of these properties highly depends on the combinatorial properties of the underlying model of set theory. In one…
Preferential attachment is one possible way to obtain a scale-free network. We develop a self-consistent method to determine whether preferential attachment occurs during the growth of a network, and to extract the preferential attachment…
We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e., the cofinality of ^{lambda}lambda, is strictly bigger than cov_lambda(meagre), i.e. the minimal number of nowhere dense subsets of…