11 search results - page 1 / 3 » A Formal Quantifier Elimination for Algebraically Closed Fie... |
AISC
2010
Springer
13 years 7 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
JSYML
2000
13 years 4 months ago
2000
The notion of a D-ring, generalizing that of a differential or a difference ring, is introduced. Quantifier elimination and a version of the AxKochen-Ershov principle is proven for...
JSYML
2006
13 years 4 months ago
2006
In [Sca99], T. Scanlon proved a quantifier elimination result for valued D-fields in a three-sorted language by using angular component functions. Here we prove an analogous theore...
AISC
2008
Springer
13 years 6 months ago
2008
Springer
We use higher-order logic to verify a quantifier elimination procedure for linear arithmetic over ordered fields, where the coefficients of variables are multivariate polynomials o...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...