Related papers: On model completion of T_{aut}
As attribution-based explanation methods are increasingly used to establish model trustworthiness in high-stakes situations, it is critical to ensure that these explanations are stable, e.g., robust to infinitesimal perturbations to an…
The Turing machine, as it was presented by Turing himself, models the calculations done by a person. This means that we can compute whatever any Turing machine can compute, and therefore we are Turing complete. The question addressed here…
In the dynamic discrete-time trading setting of Kyle (1985), we prove that Kyle's equilibrium model is stable when there are one or two trading times. For three or more trading times, we prove that Kyle's equilibrium is not stable. These…
Stability is a general notion that quantifies the sensitivity of a learning algorithm's output to small change in the training dataset (e.g. deletion or replacement of a single training sample). Such conditions have recently been shown to…
For $n\geq 3$, let $M$ be an $(n+r)$-dimensional irreducible Hermitian symmetric space of compact type and let $\mathcal{O}_M(1)$ be the ample generator of $Pic(M)$. Let $Y=H_1\cap\dots\cap H_r$ be a smooth complete intersection of…
We prove normalization for MTT, a general multimodal dependent type theory capable of expressing modal type theories for guarded recursion, internalized parametricity, and various other prototypical modal situations. We prove that deciding…
In this paper, we investigate stable matching in structured networks. Consider case of matching in social networks where candidates are not fully connected. A candidate on one side of the market gets acquaintance with which one on the…
The CSP of a first-order theory $T$ is the problem of deciding for a given finite set $S$ of atomic formulas whether $T \cup S$ is satisfiable. Let $T_1$ and $T_2$ be two theories with countably infinite models and disjoint signatures.…
Interpretable classification models are built with the purpose of providing a comprehensible description of the decision logic to an external oversight agent. When considered in isolation, a decision tree, a set of classification rules, or…
We formulate and prove a new criterion for stability of e-processes. It says that any e-process which is averagely bounded and concentrating is asymptotically stable. In the second part, we show how this general result applies to some shell…
Homological stability has shown itself to be a powerful tool for the computation of homology of families of groups such as general linear groups, mapping class groups or automorphisms of free groups. We survey here tools and techniques for…
This paper engages the question "Does the consistency of a set of axioms entail the existence of a model in which they are satisfied?" within the frame of the Frege-Hilbert controversy. The question is related historically to the…
We study elementary submodels of a stable homogeneous structure. We improve the independence relation defined in [T. Hyttinen, On nonstructure of elementary submodels of a stable homogeneous structure, Fundamenta Mathematicae, 156(1998):…
Mekler constructed a way to produce a pure group from any given structure where the construction preserves $\kappa$-stability for any cardinal $\kappa$. Not only the stability, it is known that his construction preserves various…
We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields…
Let $A$ be a (not necessarily unital) separable non-elementary simple amenable C*-algebra whose tracial basis may not have finite covering dimension and may not be compact but satisfies certain condition (C). We show that $A$ is ${\cal…
We classify the stable formulas in the theory of Dense Linear Orders without endpoints, the stable formulas in the theory of Divisible Abelian Groups, and the stable formulas without parameters in the theory of Real Closed Fields. The third…
In [MaII] Mather proved that a smooth proper infinitesimally stable map is stable. This result is the key component of the Mather stability theorem [MaV], which can be reformulated as follows: a smooth proper map $f: M\to N$ is stable if…
A definable type of a first-order theory is the same as a section (retraction) of the simplicial path space (decalage) of its space of types viewed as a simplicial topological space; as is well-known, in the category of simplicial sets such…
The injective stabilization of the tensor product is subjected to an iterative procedure that utilizes its bifunctor property. The limit of this procedure, called the asymptotic stabilization of the tensor product, provides a homological…