Related papers: Uniform bounds on growth in o-minimal structures

In this paper we study the right differentiability of a parametric infimum function over a parametric set defined by equality constraints. We present a new theorem with sufficient conditions for the right differentiability with respect to…

One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…

We show that if a bounded domain $\Omega$ is exhausted by a bounded strictly pseudoconvex domain $D$ with $C^2$ boundary, then $\Omega$ is holomorphically equivalent to $D$ or the unit ball, and show that a bounded domain has to be…

The theory of abstract argumentation frameworks (afs) has, in the main, focused on finite structures, though there are many significant contexts where argumentation can be regarded as a process involving infinite objects. To address this…

We define a class of functions termed "Computable in the Limit", based on the Machine Learning paradigm of "Identification in the Limit". A function is Computable in the Limit if it defines a property P_p of a recursively enumerable class A…

We settle some open problems in the special case of groups in o-minimal structures, such as the equality of G^00 and G^000 and the equivalence of definable amenability and existence of a type with bounded orbit. We prove almost exactness of…

Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…

S-metric and b-metric spaces are metrizable, but it is still quite impossible to get an explicit form of the concerned metric function. To overcome this, the notion of $\phi$-metric is developed by making a suitable modification in triangle…

We characterize the equality between ultradifferentiable function classes defined in terms of abstractly given weight matrices and in terms of the corresponding matrix of associated weight functions by using new growth indices. These…

This article presents two constructions motivated by a conjecture of L. van den Dries and C. Miller concerning the restricted analytic field with exponentiation. The first construction provides an example of two o-minimal expansions of a…

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…

Ideally, the time that an incremental algorithm uses to process a change should be a function of the size of the change rather than, say, the size of the entire current input. Based on a formalization of ``the set of things changed'' by an…

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

Some type-based approaches to termination use sized types: an ordinal bound for the size of a data structure is stored in its type. A recursive function over a sized type is accepted if it is visible in the type system that recursive calls…

We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…

We develop \emph{Fra\"iss\'e theory}, namely the theory of \emph{Fra\"iss\'e classes} and \emph{Fra\"iss\'e limits}, in the context of metric structures. We show that a class of finitely generated structures is Fra\"iss\'e if and only if it…

We present a diagram surveying equivalence or strict implication for properties of different nature (algebraic, model theoretic, topological, etc.) about groups definable in o-minimal structures. All results are well-known and an extensive…

We show that, for a certain large class of power-bounded $o$-minimal $\mathcal{L}_T$-theories $T$ whose field of exponents is infinite-dimensional as a vector space over the rationals, any definable set in a $T$-convex valued field…