pith. sign in

arxiv: 1008.2575 · v1 · pith:IXBQSMYMnew · submitted 2010-08-16 · 🧮 math.LO · math.AG

Constructing o-minimal structures with decidable theories using generic families of functions from quasianalytic classes

classification 🧮 math.LO math.AG
keywords functionsdefinedgenericcertaincomputablydecidablefamiliesfamily
0
0 comments X
read the original abstract

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 function composition, division by variables, and extraction of implicitly defined functions. It is shown that if the family $S$ is generic (which is a certain technically defined transcendence condition), then the theory of $\RR_S$ is decidable if and only if $S$ is computably $C^\infty$ (which means that all the partial derivatives of the functions in $S$ may be effectively approximated). It is also shown that, in a certain topological sense, many generic, computably $C^\infty$ families $S$ exist.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.