English
Related papers

Related papers: On Approximate Classification of Theories

200 papers

We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…

Logic · Mathematics 2025-04-03 Juan Felipe Carmona , Alf Onshuus

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…

Category Theory · Mathematics 2023-03-31 Misha Gavrilovich

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…

Logic · Mathematics 2024-10-24 Daniel Max Hoffmann , Chieu-Minh Tran , Jinhe Ye

It is a well-known empirical phenomenon that natural axiomatic theories are pre-well-ordered by consistency strength. Without a precise mathematical definition of "natural," it is unclear how to study this phenomenon mathematically. We will…

Logic · Mathematics 2026-03-04 James Walsh

We present an adaptation of two recent low-rank approximation technique proposed for first-order model reduction systems to the second-order systems. The resulting reduced order models are guaranteed to keep the second order structure which…

Dynamical Systems · Mathematics 2015-12-01 Younes Chahlaoui

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

Logic · Mathematics 2019-02-01 Rob Egrot

In this paper, we derive an optimal first-order Taylor-like formula. In a seminal paper [14], we introduced a new first-order Taylor-like formula that yields a reduced remainder compared to the classical Taylor's formula. Here, we relax the…

Numerical Analysis · Mathematics 2023-11-27 Joël Chaskalovic , Franck Assous

We propose two solution concepts for matchings under preferences: robustness and near stability. The former strengthens while the latter relaxes the classic definition of stability by Gale and Shapley (1962). Informally speaking, robustness…

Computer Science and Game Theory · Computer Science 2019-06-06 Jiehua Chen , Piotr Skowron , Manuel Sorge

Using an elementary argument, we prove new fixed point theorems for classical elliptic complexes. We obtain new results for conformal relations and coisotropic intersections. We obtain theorems for the average intersections of families of…

Differential Geometry · Mathematics 2007-05-23 Mark Stern

I review the construction of Simplified Models for Dark Matter searches. After discussing the philosophy and some simple examples, I turn the attention to the aspect of the theoretical consistency and to the implications of the necessary…

High Energy Physics - Phenomenology · Physics 2022-11-14 Enrico Morgante

This is the second in a series of articles developing abstract classification theory for classes that have a notion of prime models over independent pairs and over chains. It deals with the problem of smoothness and establishing the…

Logic · Mathematics 2016-09-06 John T. Baldwin , Saharon Shelah

Good frames were suggested in [Sh:h] as the (bare-bones) parallel, in the context of AECs, to superstable (among elementary classes). Here we consider $(\mu,\lambda,\kappa)$-frames as candidates for being (in the context of AECs) the…

Logic · Mathematics 2023-05-04 Saharon Shelah

Classical algebraic structures require exact satisfaction of their defining axioms. We propose similarity algebra, a framework extending algebraic and Lie structures to settings where operations satisfy quantitative bounds up to a tolerance…

Rings and Algebras · Mathematics 2026-02-17 Benyamin Ghojogh , Golbahar Amanpour

Sharpness is an almost generic assumption in continuous optimization that bounds the distance from minima by objective function suboptimality. It facilitates the acceleration of first-order methods through restarts. However, sharpness…

Optimization and Control · Mathematics 2024-07-24 Ben Adcock , Matthew J. Colbrook , Maksym Neyra-Nesterenko

For simple theories with a strong version of amalgamation we obtain the canonical hyperdefinable group from the group configuration. This provides a generalization to simple theories of the group configuration theorem for stable theories.

Logic · Mathematics 2007-05-23 Tristram De Piro , Byunghan Kim , Jessica Millar

Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…

Logic · Mathematics 2019-02-19 Michael Lieberman , Jiří Rosický , Sebastien Vasey

Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative notion of similarity based on the…

Artificial Intelligence · Computer Science 2025-05-20 Christian Antić

This paper proposes a methodology to stabilize relative equilibria in a model of identical, steered particles moving in three-dimensional Euclidean space. Exploiting the Lie group structure of the resulting dynamical system, the…

Optimization and Control · Mathematics 2008-06-23 Luca Scardovi , Naomi Leonard , Rodolphe Sepulchre

In this article, we define two equivalent new model structures on $\mathbf{sCat}$ the category of simplicial objects in $\mathbf{Cat}$. Then we construct the corresponding stable model category of spectra $Sp(\mathbf{sCat})$ and make some…

Algebraic Topology · Mathematics 2012-06-28 Ilias Amrani

This work is dedicated to the results were got in the model theory of the regular polygons. We give the characterization of the monoids with axiomatizable and model complete class of regular polygons. We describe the monoids with complete…

Logic · Mathematics 2018-05-09 A. V. Mikhalev , E. V. Ovchinnikova , E. A. Palyutin , A. A. Stepanova
‹ Prev 1 3 4 5 6 7 10 Next ›