Related papers: On definable Skolem functions and trichotomy
We continue the study of a class of topological $\mathcal{L}$-fields endowed with a generic derivation $\delta$, focussing on describing definable groups. We show that one can associate to an $\mathcal{L}_{\delta}$ definable group a type…
Recently Paw\l{}ucki showed that compact sets that are definable in some o-minimal structure admit triangulations of class $\mathcal{C}^p$ for each integer $p\geq 1$. In this work, we make use of these new techniques of triangulation to…
We show that every definable nested family of closed and bounded subsets of a $P$-minimal field $K$ has non-empty intersection. As an application we answer a question of Darni\`ere and Halupczok showing that $P$-minimal fields satisfy the…
Skolem functions play a central role in the study of first order logic, both from theoretical and practical perspectives. While every Skolemized formula in first-order logic makes use of Skolem constants and/or functions, not all such…
Definability is a key notion in the theory of Grothendieck fibrations that characterises when an external property of objects can be accessed from within the internal logic of the base of a fibration. In this paper we consider a…
A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete…
We demonstrate that the open core of a definably complete expansion of a densely linearly ordered abelian group is locally o-minimal if and only if any definable closed subset of $R$ is either discrete or contains a nonempty open interval.…
We study relative precompleteness in the context of the theory of numberings, and relate this to a notion of lowness. We introduce a notion of divisibility for numberings, and use it to show that for the class of divisible numberings,…
Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…
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…
Let $G$ be a topological group and let $\mu$ be the Lebesgue measure on the interval $[0,1]$. We let $L_0(G)$ to be the topological group of all $\mu$-equivalence classes of $\mu$-measurable functions defined on [0,1] with values in $G$,…
We discuss the construction of finite element spaces of differential forms which satisfy the crucial assumptions of the finite element exterior calculus, namely that they can be assembled into subcomplexes of the de Rham complex which admit…
In 1974 Kolmogorov proposed a non-probabilistic approach to statistics and model selection. Let data be finite binary strings and models be finite sets of binary strings. Consider model classes consisting of models of given maximal…
We prove a decomposition of definable groups in o-minimal structures generalizing the Jordan-Chevalley decomposition of linear algebraic groups. It follows that any definable linear group G is a semidirect product of its maximal normal…
In this paper we study definable families of functions from an ordered abelian group into various naturally arising definable quotients. We show that for an ordered abelian group $G$ and definable family of convex subgroups…
Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…
A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…
For a Tychonoff space $X$, we denote by $C_k(X)$ the space of all real-valued continuous functions on X with the compact-open topology. In this paper, we have gave characterization for $C_k(X)$ to satisfy $S_{fin}(S, S)$.
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that appear in imprecise-probabilistic decision…
Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…