A bibliography of quantifier elimination for real closed fields
From MaRDI portal
Publication:1103610
DOI10.1016/S0747-7171(88)80016-6zbMath0646.03024OpenAlexW1995150618MaRDI QIDQ1103610
Publication date: 1988
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(88)80016-6
Symbolic computation and algebraic computation (68W30) Model theory of fields (12L12) Bibliographies for mathematics in general (00A15) Quantifier elimination, model completeness, and related topics (03C10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Some aspects of complexity in real algebraic geometry
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Elementary structure of real algebraic varieties
- Elimination of quantifiers in algebraic structures
- Definability and fast quantifier elimination in algebraically closed fields
- A continuous, constructive solution to Hilbert's \(17^{th}\) problem
- Lectures on formally real fields
- Geometric reasoning with logic and algebra
- Real addition and the polynomial hierarchy
- An introduction to real algebra
- On the application of Buchberger's algorithm to automated geometry theorem proving
- The complexity of elementary algebra and geometry
- Basic principles of mechanical theorem proving in elementary geometries
- On mechanical quantifier elimination for elementary algebra and geometry
- The complexity of linear problems in fields
- Quantifier elimination: Optimal solution for two classical examples
- An adjacency algorithm for cylindrical algebraic decompositions of three- dimensional space
- A cluster-based cylindrical algebraic decomposition algorithm
- Solving systems of polynomial inequalities in subexponential time
- Real quantifier elimination is doubly exponential
- Algebraic decomposition of regular curves
- A survey of motion planning and related geometric algorithms
- A refutational approach to geometry theorem proving
- Counting types of rigid frameworks
- A note on simplification orderings
- The complexity of logical theories
- Computer algebra. EUROCAM '82, European Computer Algebra Conference, Marseille, France, 5-7 April 1982
- Skolem's solution to a problem of Frobenius
- The computational complexity of logical theories
- Complexity of deciding Tarski algebra
- A nullstellensatz for ordered fields
- Das Problem der dreizehn Kugeln
- A new decision method for elementary algebra
- A :20piano movers' '
- On the real spectrum of a ring and its application to semialgebraic geometry
- On Approximations and Incidence in Cylindrical Algebraic Decompositions
- Ordered fields and real algebraic geometry
- A finiteness theorem for open semi-algebraic sets, with applications to Hilbert’s 17th problem
- A Decision Procedure for the First Order Theory of Real Addition with Order
- THE TOPOLOGY OF REAL PROJECTIVE ALGEBRAIC VARIETIES
- How to give an Exposition of the Cech-Alexander-Spanier type Homology Theory
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Decision procedures for real and p‐adic fields
- Decision Methods for Elementary Algebra
- Hilbert's sixteenth problem
This page was built for publication: A bibliography of quantifier elimination for real closed fields
