scientific article; zbMATH DE number 1169378

Publication date: 25 June 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Decidability and field theory (12L05) Decidability of theories and sets of sentences (03B25) Models of arithmetic and set theory (03C62) Model theory of fields (12L12) Categoricity and completeness of theories (03C35)

Related Items

A note on the decidability of exponential terms ⋮ Turing meets Schanuel ⋮ On the structure of nonarchimedean exponential fields. I ⋮ On the expressiveness and decidability of o-minimal hybrid systems ⋮ Ax-Schanuel for linear differential equations ⋮ When are emptiness and containment decidable for probabilistic automata? ⋮ Deciding first-order formulas involving univariate mixed trigonometric-polynomials ⋮ Between the Rings $${\mathbb Z}/p^n{\mathbb Z}$$ and the Ring $${\mathbb Z}_p$$: Issues of Axiomatizability, Definability and Decidability ⋮ Effective power series computations ⋮ Generic solutions of equations with iterated exponentials ⋮ Decision problem for a class of univariate Pfaffian functions ⋮ On the set of reduced states of translation invariant, infinite quantum systems ⋮ IS CAUSAL REASONING HARDER THAN PROBABILISTIC REASONING? ⋮ Embedding the prime model of real exponentiation into o‐minimal exponential fields ⋮ Unnamed Item ⋮ Uniformization in superstructures over some extensions of $\mathbb{R}$ ⋮ The computability of LQR and LQG control ⋮ On the decidability of reachability in continuous time linear time-invariant systems ⋮ On irreducible components of real exponential hypersurfaces ⋮ Weighted o-minimal hybrid systems ⋮ A decidable theory involving addition of differentiable real functions ⋮ Unnamed Item ⋮ An effective version of Wilkie's theorem of the complement and some effective o-minimality results. ⋮ From Schanuel's conjecture to Shapiro's conjecture ⋮ Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates ⋮ Complexity bounds for zero-test algorithms ⋮ $\Sigma$-definability in hereditarily finite superstructures and computable analysis ⋮ Independence in computable algebra ⋮ What can we do with a Solution? ⋮ Definability in o-minimal expansions of the real numbers ⋮ COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS ⋮ Some remarks on Schanuel's conjecture ⋮ Unnamed Item ⋮ Symbolic reachability computation for families of linear vector fields ⋮ Undefinability results in o-minimal expansions of the real numbers ⋮ Multiplicative independence of algebraic numbers and expressions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A game theory approach to the existence and uniqueness of nonlinear Perron-Frobenius eigenvectors ⋮ Inclusion dynamics hybrid automata ⋮ Zero counting for a class of univariate Pfaffian functions ⋮ On freely generated $E$-subrings ⋮ Weak Wu stratification in $\mathbb{R}^n$ ⋮ Model Completeness for the Real Field with the Weierstrass ℘ Function ⋮ Models of true arithmetic are integer parts of models of real exponentation ⋮ Axiomatic (and non-axiomatic) mathematics ⋮ Tropical varieties for exponential sums ⋮ O-Minimal Invariants for Discrete-Time Dynamical Systems ⋮ Model Theory in Algebra, Analysis and Arithmetic: A Preface ⋮ The uniformization problem for $\Sigma$-predicates in a hereditarily finite list superstructure over the real exponential field ⋮ Properties of $s\Sigma$-reducibility ⋮ Decisiveness of stochastic systems and its application to hybrid models