scientific article; zbMATH DE number 3937151
[For the entire collection see Zbl 0538.00003.] A theory T, extending the theory of dense linear ordering, is of finite type if in each of its models every definable set has only finitely many connected components. For such extensions of \(Th({\mathbb{R}},<,...)\), a partial characterization of definable subsets of \({\mathbb{R}}^ n\) and definable functions on subsets of \({\mathbb{R}}^ n\) is given. Namely, the main result is: Let \(n\geq 1\). (a) For each definable set \(X\subset {\mathbb{R}}^{n-1}\) and definable f:X\(\to {\mathbb{R}}\) there is a finite partition of X into definable sets on each of which f is continuous. (b) Given any finite family of definable subsets of \({\mathbb{R}}^ n\), there is a (cylindrical) decomposition of \({\mathbb{R}}^ n\) partitioning each set from the given family. The method of cylindrical decomposition, used in the proof (as well as in the above statement), is partly alternative to, partly a considerable sharpening of the notion of quantifier elimination. So the paper is a continuation of the well-known work of Tarski on decidability of the theory of real closed fields, being a step in extending Tarski's results on \(Th({\mathbb{R}},+,\cdot,\exp)\). Since it is not easy to prove if the theory \(Th({\mathbb{R}},+,\cdot,\exp)\) is of finite type (what is suggested in the paper), the results cannot be simply applied. Some interesting remarks are given on the possibilities and ways of attacking Tarski's problem (or rather - what the author calls the realistic part of this problem).
- On the number of topological types occurring in a parameterized family of arrangements
- On gradients of functions definable in o-minimal structures
- Queries with arithmetical constraints
- Definable utility in o-minimal structures.
- Real spectrum of ring of definable functions
- Extending Tamm's theorem
- Strongly minimal groups in o-minimal structures
- Decisiveness of stochastic systems and its application to hybrid models
- On the Reeb spaces of definable maps
- Structure theorems in tame expansions of o-minimal structures by a dense set
- A.D. Taimanov and model theory in Kazakhstan
- On the expressiveness and decidability of o-minimal hybrid systems
- On some global semianalytic sets
- O-minimal Hauptvermutung for polyhedra. I
- The rational points of a definable set
- On the Pila-Wilkie theorem
- A generalization of the Tarski-Seidenberg theorem, and some nondefinability results
- Definable Sets in Ordered Structures. I
- Definable Sets in Ordered Structures. II
- Exponentiation is Hard to Avoid
- Weakly o-minimal structures and real closed fields
- Globally subanalytic CMC surfaces in ℝ3 with singularities
- Convexity Relations and Generalizations of o-Minimality
- Characterizing o-minimal groups in tame expansions of o-minimal structures
- Hensel minimality I
- Lattice ordered o-minimal structures
- \(\text{P}\neq \text{NP}\) for the reals with various analytic functions
- Symbolic reachability computation for families of linear vector fields
- Global convergence of the gradient method for functions definable in o-minimal structures
- Deciding first-order formulas involving univariate mixed trigonometric-polynomials
- Decision problem for a class of univariate Pfaffian functions
- On the set of reduced states of translation invariant, infinite quantum systems
- \(o\)-minimality and the André-Oort conjecture for \(\mathbb{C}^{n}\)
- Half a century with the problem of the gradient of an analytic function
- Global stability of first-order methods for coercive tame functions
- Some generalizations of o-minimality
- De Rham cohomology for o-minimal manifolds
- On definably compact semigroups in o-minimal structures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3710508)