Related papers: Fine structure from normal iterability

Let $m\ge 1$, in this paper, our object of investigation is the regularity and and continuity properties of the following multilinear strong maximal operator $${\mathscr{M}}_{\mathcal{R}}(\vec{f})(x)=\sup_{\substack{R \ni x…

We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…

We prove structural results for measure preserving systems, called Furstenberg systems, naturally associated with bounded multiplicative functions. We show that for all pretentious multiplicative functions these systems always have rational…

In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…

Let $F$ be a rational function of one complex variable of degree $m\geq 2$. The function $F$ is called simple if for every $z\in \mathbb C\mathbb P^1$ the preimage $F^{-1}\{z\}$ contains at least $m-1$ points. We show that if $F$ is a…

We determine the ZF-provable modal logic of the modality $\Box_{\mathrm{sym}}$, where $\Box_{\mathrm{sym}}\varphi$ means '$\varphi$ holds in every finite symmetry-preserving iteration' of the symmetric method. We prove that the exact logic…

Let $\mathcal{L}$ be a first-order two-sorted language. Let $S$ be some fixed structure. A standard structure is an $\mathcal{L}$-structure of the form $(M,S)$, where $M$ is arbitrary. When $S$ is a compact topological space (and…

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

Let $f$ be a Morse function on a smooth compact manifold $M$ with boundary. The path component $\mathrm{PH}_f^{-1}(D)$ containing $f$ of the space of Morse functions giving rise to the same Persistent Homology $D=\mathrm{PH}(f))$ is shown…

Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

We work on the family of topologies for the Minkowski manifold M. We partially order this family by inclusion to form the lattice \Sigma(M), and focus on the sublattice Z of topologies that induce the Euclidean metric space on every time…

Deep predictive models of neuronal activity have recently enabled several new discoveries about the selectivity and invariance of neurons in the visual cortex. These models learn a shared set of nonlinear basis functions, which are linearly…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

The Extended Theory of Finite Fermi Systems is based on the conventional Landau-Migdal theory and includes the coupling to the low-lying phonons in a consistent way. The phonons give rise to a fragmentation of the single-particle strength…

Fix an integer h>=1. In the universe of coloured trees of height at most h, we prove that for any graph decision problem defined by an MSO formula with r quantifiers, there exists a set of kernels, each of size bounded by an elementary…

Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all…

It is sometimes desirable in choiceless constructions of set theory that one iteratively extends some ground model without adding new sets of ordinals after the first extension. Pushing this further, one may wish to have models $V \subseteq…

For a rigid object $M$ in an algebraic triangulated category $\mathcal{T}$, a functor pr$(M)\to\mathcal{H}^{[-1,0]}({\rm proj}\, A)$ is constructed, which essentially takes an object to its `presentation', where pr$(M)$ is the full…

This paper presents a theoretical, idealized model of the thinking process with the following characteristics: 1) the model can produce complex thought sequences and can be generalized to new inputs, 2) it can receive and maintain input…