Related papers: Strictly convergent analytic structures
Given a valuation $v$ with quotient field $K$ and a sequence $\mathcal{K} :K_0\subseteq K_1\subseteq\cdots$ of finite extensions of $K$, we construct a weighted tree $\mathcal{T}(v,\mathcal{K})$ encoding information about the ramification…
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…
We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…
An expansion of a definably complete field either defines a discrete subring, or the image of a definable discrete set under a definable map is nowhere dense. As an application we show a definable version of Lebesgue's differentiation…
We construct completely integrable systems on the dual of the Lie algebra of any compact Lie group $K$ with respect to the standard Lie-Poisson structure. These systems generalize key properties of Gelfand-Zeitlin systems: A) the pullback…
We introduce $L^2_{K,P}$, a monadic second-order language for reasoning about trees which characterizes the strongly Context-Free Languages in the sense that a set of finite trees is definable in $L^2_{K,P}$ iff it is (modulo a projection)…
We study function fields of curves over a base field $K$ which is either a global field or a large field having a separable field extension of degree divisible by $4$. We show that, for any such function field, Hilbert's 10th Problem has a…
In this paper syntactic objects---concept constructors called part restrictions which realize rational grading are considered in Description Logics (DLs). Being able to convey statements about a rational part of a set of successors, part…
We prove the triviality of the Grothendieck ring of a integer-valued field K under slight conditions on the logical language and on K. We construct a definable bijection from the plane K^2 to itself minus a point. When we specialize to…
The notion of newtonianity is central to the study of the ordered differential field of logarithmic-exponential transseries done by Aschenbrenner, van den Dries, and van der Hoeven; see Chapter 14 of arxiv:1509.02588. We remove the…
For a given number field $K$, we give a $\forall\exists\forall$-first order description of affine Darmon points over $\mathbb{P}^1_K$, and show that this can be improved to a $\forall\exists$-definition in a remarkable particular case.…
Standard Description Logics (DLs) can encode quantitative aspects of an application domain through either number restrictions, which constrain the number of individuals that are in a certain relationship with an individual, or concrete…
Recent pre-trained language models (PLMs) equipped with foundation reasoning skills have shown remarkable performance on downstream complex tasks. However, the significant structure reasoning skill has been rarely studied, which involves…
We present a unified framework for the declarative analysis of structured communications. By relying on a (timed) concurrent constraint programming language, we show that in addition to the usual operational techniques from process calculi,…
We argue that in some KR applications, we want to quantify over sets of concepts formally represented by symbols in the vocabulary. We show that this quantification should be distinguished from second-order quantification and…
We consider the language of $\Delta_0$-formulas with list terms interpreted over hereditarily finite list superstructures. We study the complexity of reasoning in extensions of the language of $\Delta_0$-formulas with non-standard list…
A celebrated result by M. Davis, H. Putnam, J. Robinson, and Y. Matiyasevich shows that a set of integers is listable if and only if it is positive existentially definable in the language of arithmetic. We investigate analogues of this…
We describe a class of sharply o-minimal structures, called analytically generated structures, whose definable sets and their complexity filtration are determined by the collection of definable complex cells. We prove a polynomially…
Suppose that $\widetilde{\mathbb R}$ is an o-minimal expansion of the real field in which restricted power functions are definable. We show that if $\widehat{\mathbb R}$ is both a reduct (in the sense of definability) of the expansion…
We show a transfer principle for the property that all types realised in a given elementary extension are definable. It can be written as follows: a Henselian valued fields is stably embedded in an elementary extension if and only if its…