English
Related papers

Related papers: Pseudo-finite sets, pseudo-o-minimality

200 papers

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

We reformulate slightly Russell's notion of typicality, so as to eliminate its circularity and make it applicable to elements of any first-order structure. We argue that the notion parallels Martin-L\"{o}f (ML) randomness, in the sense that…

Logic · Mathematics 2023-03-22 Athanassios Tzouvaras

A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…

Logic · Mathematics 2026-03-09 Claude Tardif

This paper has two parts. In the first one, we prove that an invariant dp-minimal type is either finitely satisfiable or definable. We also prove that a definable version of the (p,q)-theorem holds in dp-minimal theories of small or medium…

Logic · Mathematics 2015-09-24 Pierre Simon

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…

We propose to grok Lipschitz stratifications from a non-archimedean point of view and thereby show that they exist for closed definable sets in any power-bounded o-minimal structure on a real closed field. Unlike the previous approaches in…

Logic · Mathematics 2016-02-10 Immanuel Halupczok , Yimu Yin

Let A be a finite or countable alphabet and let $\theta$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2018-09-06 Jean Néraud , Carla Selmi

Given a real closed field $R$, we identify exactly four proper reducts of $R$ which expand the underlying (unordered) $R$-vector space structure. Towards this theorem we introduce a new notion, of strongly bounded reducts of linearly…

Logic · Mathematics 2023-11-08 Hind Abu Saleh , Ya'acov Peterzil

We prove the higher dimensional case of the o-minimal variant of Zilber's Restricted Trichotomy Conjecture. More precisely, let $\mathcal R$ be an o-minimal expansion of a real closed field, let $M$ be an interpretable set in $\mathcal R$,…

Logic · Mathematics 2024-06-14 Benjamin Castle

Termination analysis of linear loops plays a key r\^{o}le in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination…

Computational Complexity · Computer Science 2020-05-13 Shaull Almagor , Dmitry Chistikov , Joël Ouaknine , James Worrell

We prove that the category of models of any relational Horn theory satisfying a mild syntactic condition is infinitely extensive. Central examples of such categories include the categories of preordered sets and partially ordered sets, and…

Category Theory · Mathematics 2022-07-08 Jason Parker

We show some basic facts about dp-minimal ordered structures. The main results are : dp-minimal groups are abelian-by-finite-exponent, in a divisible ordered dp-minimal group, any infinite set has non-empty interior, and any theory of pure…

Logic · Mathematics 2009-09-24 P. Simon

We examine the class of languages that can be defined entirely in terms of provability in an extension of the sorted type theory (Ty_n) by embedding the logic of phonologies, without introduction of special types for syntactic entities.…

Computation and Language · Computer Science 2011-02-28 Victor Gluzberg

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

Logic · Mathematics 2023-07-25 Annalisa Conversano

We study the following problem: Determine which almost structurally complete quasivarieties are structurally complete. We propose a general solution to this problem and then a solution in the semisimple case. As a consequence, we obtain a…

Logic · Mathematics 2014-08-21 Miguel Campercholi , Michal M. Stronkowski , Diego Vaggione

We analyse domination between invariant types in o-minimal expansions of ordered groups, showing that the domination poset decomposes as the direct product of two posets: the domination poset of an o-minimal expansion of a real closed…

Let 2<n\leq l<m< \omega. Let L_n denote first order logic restricted to the first n variables. We show that the omitting types theorem fails dramatically for the n--variable fragments of first order logic with respect to clique guarded…

Logic · Mathematics 2015-04-24 Tarek Sayed Ahmed

We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…

Category Theory · Mathematics 2019-12-30 M. Gavrilovich

We work over an o-minimal expansion of a real closed field R. Given a closed simplicial complex K and a finite number of definable subsets of its realization |K| in R we prove that there exists a triangulation (K',f) of |K| compatible with…

Logic · Mathematics 2007-10-31 Elias Baro

We prove that if X is any 2-regular projective scheme (in the sense of Castelnuovo-Mumford) then X is "small". This means that if L is a linear space and Y:= L\cap X is finite, then Y is "linearly independent" in the sense that the…

Algebraic Geometry · Mathematics 2007-05-23 David Eisenbud , Mark Green , Klaus Hulek , Sorin Popescu