English
Related papers

Related papers: Metric Linear Orders and O-Minimality

200 papers

Order-invariant formulas access an ordering on a structure's universe, but the model relation is independent of the used ordering. Order invariance is frequently used for logic-based approaches in computer science. Order-invariant formulas…

Logic in Computer Science · Computer Science 2016-06-22 Michael Elberfeld , Marlin Frickenschmidt , Martin Grohe

Following a review of metric, ultrametric and generalized ultrametric, we review their application in data analysis. We show how they allow us to explore both geometry and topology of information, starting with measured data. Some themes…

Logic in Computer Science · Computer Science 2010-08-24 Fionn Murtagh

This is mainly a survey on the properties of Strong Metric Regularity (SMR) and Strong Metric subRegularity (SMsR) of mappings representing first order optimality conditions (so-called optimality mappings) of optimization problems in…

Optimization and Control · Mathematics 2024-10-01 Nicolai A. Jork , Nikolai P. Osmolovskii , Vladimir M. Veliov

We prove the Zil'ber Trichotomy Principle for all 1-dimensional structures which are definable in o-minimal ones. In particular, we show that any stable 1-dimensional structure is necessarily locally modular. The main tool is a theory for…

Logic · Mathematics 2007-05-23 Assaf Hasson , Alf Onshuus , Ya'acov Peterzil

Let $ (X,d) $ be a metric space. We study a metric $ d_0 $ on $ X $ naturally derived from $ d $. If $ (X,d) $ is complete and locally compact, or if it is complete and $ (d_0)_0=d_0 $, then $ d_0 $ coincides with the length metric induced…

Metric Geometry · Mathematics 2018-04-26 Pedro Zühlke

We introduce the notions of triviality and order-triviality for global invariant types in an arbitrary first-order theory and show that they are well behaved in the NIP context. We show that these two notions agree for invariant global…

Logic · Mathematics 2026-02-24 Slavko Moconja , Predrag Tanović

Many systems include components interacting with each other that evolve with possibly very different speeds. To deal with this situation many formal models adopt the abstraction of "zero-time transitions", which do not consume time. These…

Logic in Computer Science · Computer Science 2012-06-06 Luca Ferrucci , Dino Mandrioli , Angelo Morzenti , Matteo Rossi

We discuss the role and merits of symmetry methods for the analysis of biological systems. In particular, we consider systems of first order ordinary differential equations and provide a comprehensive review of the geometrical foundations…

Quantitative Methods · Quantitative Biology 2022-02-11 Johannes Borgqvist , Fredrik Ohlsson , Ruth E. Baker

We initiate the study of pseudofiniteness in continuous logic. We introduce a related concept, namely that of pseudocompactness, and investigate the relationship between the two concepts. We establish some basic properties of…

Logic · Mathematics 2016-02-10 Isaac Goldbring , Vinicius Cifu Lopes

We study monotone skew-product semiflows generated by families of nonautonomous neutral functional differential equations with infinite delay and stable D-operator, when the exponential ordering is considered. Under adequate hypotheses of…

Dynamical Systems · Mathematics 2024-02-02 Sylvia Novo , Rafael Obaya , Víctor M. Villarragut

We propose new structures called almost o-minimal structures and $\mathfrak X$-structures. The former is a first-order expansion of a dense linear order without endpoints such that the intersection of a definable set with a bounded open…

Logic · Mathematics 2022-06-08 Masato Fujita

Linear complementarity problems provide a powerful framework to model nonsmooth phenomena in a variety of real-world applications. In dynamical control systems, they appear coupled to a linear input-output system in the form of linear…

Systems and Control · Electrical Eng. & Systems 2023-03-23 Felix Miranda-Villatoro , Fernando Castaños , Alessio Franci

Algorithmic meta-theorems explain the tractability of large classes of computational problems by linking logical expressibility with structural graph properties. While extensions of first-order logic such as FO+dp admit efficient model…

Logic in Computer Science · Computer Science 2026-05-04 Ignasi Sau , Nicole Schirrmacher , Sebastian Siebertz , Giannos Stamoulis , Dimitrios M. Thilikos , Alexandre Vigny

We characterize model theoretic properties of the Urysohn sphere as a metric structure in continuous logic. In particular, our first main result shows that the theory of the Urysohn sphere is $\text{SOP}_n$ for all $n\geq 3$, but does not…

Logic · Mathematics 2018-08-17 Gabriel Conant , Caroline Terry

We make available some results about model theory cyclically ordered groups. We start with a classification of complete theories of divisible abelian cyclically ordered groups. Then we look at the cyclically ordered groups where the only…

Logic · Mathematics 2021-11-17 Gérard Leloup

When implementing the DSmT, a difficulty may arise from the possible huge dimension of hyperpower sets, which are indeed free structures. However, it is possible to reduce the dimension of these structures by involving logical constraints.…

General Mathematics · Mathematics 2007-05-23 Frederic Dambreville

Temporal logic is a very powerful formalism deeply investigated and used in formal system design and verification. Its application usually reduces to solving specific decision problems such as model checking and satisfiability. In these…

Logic in Computer Science · Computer Science 2016-09-15 Gaëlle Fontaine , Fabio Mogavero , Aniello Murano , Giuseppe Perelli , Loredana Sorrentino

We introduce an elementary class of linearly ordered groups, called growth order groups, encompassing certain groups under composition of formal series (e.g. transseries) as well as certain groups $\mathcal{G}_{\mathcal{M}}$ of infinitely…

Logic · Mathematics 2025-05-27 Vincent Mamoutou Bagayoko

We prove strong completeness results for some modal logics with the universal modality, with respect to their topological semantics over 0-dimensional dense-in-themselves metric spaces. We also use failure of compactness to show that, for…

Logic · Mathematics 2020-08-12 Robert Goldblatt , Ian Hodkinson

We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers,…

Logic in Computer Science · Computer Science 2008-03-20 Tobias Ganzow , Sasha Rubin