Related papers: Equivalent definitions of superstability in tame a…
Robustness is a property of system analyses, namely monotonic maps from the complete lattice of subsets of a (system's state) space to the two-point lattice. The definition of robustness requires the space to be a metric space. Robust…
Just as a herd of animals relies on its robust social structure to survive in the wild, similarly robustness is a crucial characteristic for the survival of a complex network under attack. The capacity to measure robustness in complex…
We work with a pre-$\lambda$-frame, which is an abstract elementary class (AEC) endowed with a collection of basic types and a non-forking relation satisfying certain natural properties with respect to models of cardinality $\lambda$. We…
Looped Language Models (LoopLMs) enable efficient latent reasoning through depth recurrence, yet exhibit unreliable test-time scaling behavior: performance often peaks at a certain iteration depth and then collapses with further recurrence.…
We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite…
We show that a simple separable unital nuclear nonelementary $C^*$-algebra whose tracial state space has a compact extreme boundary with finite covering dimension admits uniformly tracially large order zero maps from matrix algebras into…
We find sufficient conditions for commutative non-autonomous systems on certain metric spaces to be topologically stable. In particular, we prove that (i) Every mean equicontinuous, mean expansive system with strong average shadowing…
We study AECs without assuming the amalgamation property in general. We do assume the disjoint amalgamation property in a specific cardinality lambda and assume that there is no maximal model in \lambda. Under these hypotheses, we prove the…
In [Sh E46], Shelah obtained a non-forking relation for an AEC, (K,\preceq), with LST-number at most \lambda, which is categorical in \lambda and \lambda^+ and has less than 2^{\lambda^+} models of cardinality \lambda^{++}, but at least…
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…
An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more expressive types of rules. Emphasis is placed on the use of…
A comma category, exemplified in algebraic geometry by coherent systems, combines two categories over a third through morphisms between their objects. We establish sufficient conditions for it to be abelian, compute its Grothendieck group,…
We present an exactly solvable random-subcube model inspired by the structure of hard constraint satisfaction and optimization problems. Our model reproduces the structure of the solution space of the random k-satisfiability and k-coloring…
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 a many-to-one matchingmodel with responsive preferences in which indifferences are allowed, we study three notions of core, three notions of stability, and their relationships. We show that (i) the core contains the stable set, (ii) the…
Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…
A machine learning model is traditionally considered robust if its prediction remains (almost) constant under input perturbations with small norm. However, real-world tasks like molecular property prediction or point cloud segmentation have…
We use algorithmic methods from online learning to explore some important objects at the intersection of model theory and combinatorics, and find natural ways that algorithmic methods can detect and explain (and improve our understanding…
Stability is a well investigated concept in extremal combinatorics. The main idea is that if some object is close in size to an extremal object, then it retains the structure of the extremal construction. In the present paper we study…
In continuous first-order logic, the union of definable sets is definable but generally the intersection is not. This means that in any continuous theory, the collection of $\varnothing$-definable sets in one variable forms a…