Related papers: Constructing o-minimal structures with decidable t…

The article develops techniques for solving equations G(x,y)=0, where G(x,y)=G(x_1,...,x_n,y) is a function in a given quasianalytic class (for example, a quasianalytic Denjoy-Carleman class, or the class of infinitely differentiable…

We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. We show that the relaxation of these requirements leads to the classes of…

In this chapter a general mathematical framework for probabilistic theories of operationally understood circuits is laid out. Circuits are comprised of operations and wires. An operation is one use of an apparatus and a wire is a…

The following representation theorem is proven: A partially ordered commutative ring $R$ is a subring of a ring of almost everywhere defined continuous real-valued functions on a compact Hausdorff space $X$ if and only if $R$ is archimedean…

Every o-minimal expansion R-tilde of the real field has an o-minimal expansion P(R-tilde) in which the solutions to Pfaffian equations with definable C^1 coefficients are definable.

For any ring $R$, we introduce an invariant in the form of a partially ordered abelian semigroup $\mathrm{S}(R)$ built from an equivalence relation on the class of countably generated projective modules. We call $\mathrm{S}(R)$ the Cuntz…

We introduce the quasiminimal subshifts, subshifts having only finitely many subsystems. With $\mathbb{N}$-actions, their theory essentially reduces to the theory of minimal systems, but with $\mathbb{Z}$-actions, the class is much larger.…

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…

We investigate the computational properties of basic mathematical notions pertaining to $\mathbb{R}\rightarrow \mathbb{R}$-functions and subsets of $\mathbb{R}$, like finiteness, countability, (absolute) continuity, bounded variation,…

We consider the ordered field which is the completion of the Puiseux series field over \bR equipped with a ring of analytic functions on [-1,1]^n which contains the standard subanalytic functions as well as functions given by t-adically…

For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…

For globally subanalytic manifolds we define de Rham complexes of globally subanalytic differential forms and of constructible differential forms. Whereas the de Rham theorem does not hold for the former in the non-compact case, it does…

The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…

In this paper, we establish the following criterion for divisibility in the local ring of those quasianalytic function germs at zero which are definable in a polynomially bounded structure. A sufficient (and necessary) condition for the…

We are concerned with rigid analytic geometry in the general setting of Henselian fields $K$ with separated analytic structure, whose theory was developed by Cluckers--Lipshitz--Robinson. It unifies earlier work and approaches of numerous…

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…

Kleene's computability theory based on the S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's 'machine model' which formalises computing with real numbers. A fundamental…

We develop synthetic notions of oracle computability and Turing reducibility in the Calculus of Inductive Constructions (CIC), the constructive type theory underlying the Coq proof assistant. As usual in synthetic approaches, we employ a…

We study the definable topological dynamics $(G(M), S_G(M))$ of a definable group acting on its type space, where $M$ is either an $o$-minimal structure or a $p$-adically closed field, and $G$ a definable amenable group. We focus on the…

Let $G$ be a connected, simply connected nilpotent Lie group, identified with a real algebraic subgroup of $\mathrm{UT}(n,\mathbb{R})$, and let $\Gamma$ be a lattice in $G$, with $\pi:G\to G/\Gamma$ the quotient map. For a semi-algebraic…