118 search results - page 9 / 24 » A Simple Proof of Miller-Yu Theorem |
AML
2007
14 years 9 months ago
2007
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each...
CADE
2006
Springer
15 years 9 months ago
2006
Springer
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
COMBINATORICA
2008
14 years 9 months ago
2008
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...
ENTCS
2008
14 years 9 months ago
2008
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
CADE
2005
Springer
15 years 9 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...