96 search results - page 5 / 20 » On Several Proofs of the Recognizability Theorem |
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 10 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...
ECAI
2004
Springer
15 years 3 months ago
2004
Springer
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
COMBINATORICS
2007
14 years 9 months ago
2007
Sylvester’s identity is a classical determinantal identity with a straightforward linear algebra proof. We present combinatorial proofs of several non-commutative extensions, an...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...