Sciweavers

6 search results - page 1 / 2
» Generic Hermitian Quantifier Elimination
Sort
View
AISC
2004
Springer
13 years 11 months ago
Generic Hermitian Quantifier Elimination
We present a new method for generic quantifier elimination that uses an extension of Hermitian quantifier elimination. By means of sample computations we show that this generic Her...
Andreas Dolzmann, Lorenz A. Gilch
AISC
2004
Springer
14 years 28 days ago
Proof Search in Minimal Logic
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
Helmut Schwichtenberg
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
13 years 11 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm
APAL
2000
90views more  APAL 2000»
13 years 7 months ago
The definable multiplicity property and generic automorphisms
Let T be a strongly minimal theory with quantifier elimination. We show that the class of existentially closed models of T {" is an automorphism"} is an elementary clas...
Hirotaka Kikyo, Anand Pillay
JAR
2008
105views more  JAR 2008»
13 years 7 months ago
Proof Synthesis and Reflection for Linear Arithmetic
This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Coo...
Amine Chaieb, Tobias Nipkow