Alfred Tarski's elimination theory for real closed fields

DOI10.2307/2274424zbMath0651.03001OpenAlexW4234956720MaRDI QIDQ3795644

L. P. D. van den Dries

Publication date: 1988

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274424

zbMATH Keywords

Tarskireal closed fields

Mathematics Subject Classification ID

Decidability and field theory (12L05) History of mathematics in the 20th century (01A60) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) History of mathematical logic and foundations (03-03) Model theory of fields (12L12) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (24)

P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) ⋮ Unnamed Item ⋮ Undecidable existential theories of polynomial rings and function fields ⋮ On maps which preserve semipositivity and quantifier elimination theory for real numbers ⋮ Quantifier elimination for the reals with a predicate for the powers of two ⋮ Extensions of Hilbert's tenth problem ⋮ From LP to LP: Programming with constraints ⋮ Ascending chains of ideals in the polynomial ring ⋮ Quantifier elimination theory and maps which preserve semipositivity ⋮ Ordered Subrings of the Reals in which Output Sets are Recursively Enumerable ⋮ Equilibrium behavior in markets and games: Testable restrictions and identification. ⋮ On the time complexity of partial real functions ⋮ On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals ⋮ On quantified linear implications ⋮ Avoidable algebraic subsets of Euclidean space ⋮ Ordered Rings Over Which Output Sets are Recursively Enumerable Sets ⋮ Completeness and Categoricity. Part I: Nineteenth-century Axiomatics to Twentieth-century Metalogic ⋮ On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines ⋮ Isomorphism theorem for BSS recursively enumerable sets over real closed fields ⋮ On approximate and algebraic computability over the real numbers ⋮ A Note on Periodicity in Representation Theory of Finite Dimensional Algebras ⋮ Model Theory in Algebra, Analysis and Arithmetic: A Preface ⋮ Complete geometric query languages ⋮ Rational Samuelson maps are univalent

This page was built for publication: Alfred Tarski's elimination theory for real closed fields