Related papers: When Locality Meets Preservation

In this paper, we give an extension of the J\'{o}nsson-Tarski representation theorem for both normal and non-normal modal algebras so that it preserves countably many infinitary meets and joins. To extend the J\'{o}nsson-Tarski…

There are a number of localic separation axioms which are roughly analogous to the $T_1$-axiom from classical topology. For instance, besides the well-known subfitness and fitness, there are also Rosicky-Smarda's $T_1$-locales, totally…

We study the existence of a $\Theta$ sentence which is simultaneously $\Gamma$-conservative over consistent RE extensions $T$ and $U$ of Peano Arithmetic for various reasonable pairs $(\Gamma, \Theta)$. As a result of this study, we prove…

Foreman proved the Duality Theorem, which gives an algebraic characterization of certain ideal quotients in generic extensions. As an application he proved that generic supercompactness of $\omega_1$ is preserved by any proper forcing. We…

Words in natural language follow a Zipfian distribution whereby some words are frequent but most are rare. Learning representations for words in the "long tail" of this distribution requires enormous amounts of data. Representations of rare…

We prove that every place of an algebraic function field F|K of arbitrary characteristic admits local uniformization in a finite extension F' of F. We show that F'|F can be chosen to be normal. If K is perfect and P is of rank 1, then…

We develop a categorical and algebro-geometric treatment of localization for cohomological theories endowed with an open--closed recollement. Starting from a class on a space whose restriction to the open complement vanishes, we show that…

Motivated by the Polynomial Freiman-Ruzsa (PFR) Conjecture, we develop a theory of locality in sumsets, with applications to John-type approximation and sets with small doubling. First we show that if $A \subset \mathbb{Z}$ with $|A+A| \le…

We show that local deformations, near closed subsets, of solutions to open partial differential relations can be extended to global deformations, provided all but the highest derivatives stay constant along the subset. The applicability of…

First-order logic is known to have limited expressive power over finite structures. It enjoys in particular the locality property, which states that first-order formulae cannot have a global view of a structure. This limitation ensures on…

The Lovasz Local Lemma [EL75] is a powerful tool to non-constructively prove the existence of combinatorial objects meeting a prescribed collection of criteria. In his breakthrough paper [Bec91], Beck demonstrated that a constructive…

Linear convergence of first-order methods is typically characterized by global optimization conditions whose constants reflect worst-case geometry of the ambient space. In high-dimensional or structured problems, these global constants can…

We examine cyclic, non-well-founded and well-founded derivations in the provability logic $\mathsf{GLP}$. While allowing cyclic derivations does not change the system, the non-well-founded and well-founded derivations we consider define the…

We consider weighted structures, which extend ordinary relational structures by assigning weights, i.e. elements from a particular group or ring, to tuples present in the structure. We introduce an extension of first-order logic that allows…

We say that a convergence law holds for a sequence of random combinatorial objects if, for any first-order sentence $\varphi$, the proportion of objects satisfying $\varphi$ converges to a limiting value as the size of the objects tends to…

We prove the convergence of solutions of nonlocal conservation laws to their local entropic counterpart for a fundamentally extended class of nonlocal kernels when these kernels approach a Dirac distribution. The nonlocal kernels are…

For a conformal vector field on a closed, real-analytic, Lorentzian manifold we prove that the flow is locally isometric -- that it preserves a metric in the conformal class on a neighborhood of any point -- or the metric is everywhere…

The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…

Evaluating a Boolean conjunctive query Q against a guarded first-order theory F is equivalent to checking whether "F and not Q" is unsatisfiable. This problem is relevant to the areas of database theory and description logic. Since Q may…

We provide a general preservation theorem for preserving selective independent families along countable support iterations. The theorem gives a general framework for a number of results in the literature concerning models in which the…