1302 search results - page 45 / 261 » Free-Style Theorem Proving |
JSYML
2006
13 years 7 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...
JNS
2010
13 years 6 months ago
2010
This paper is concerned with the Becker-D¨oring (BD) system of equations and their relationship to the Lifschitz-Slyozov-Wagner (LSW) equations. A diffusive version of the LSW eq...
SLOGICA
2010
13 years 6 months ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
PPCP
1993
13 years 11 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...