1410 search results - page 31 / 282 » Proving theorems by reuse |
IWC
2000
13 years 9 months ago
2000
The practical utility of interactive, user-guided, theorem proving depends on the design of good interaction environments, the study of which should be grounded in methods of rese...
JAMDS
2002
13 years 9 months ago
2002
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...
TOC
2010
13 years 4 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
JCT
2010
13 years 8 months ago
2010
We prove a generalization of Pr¨omel’s theorem to finite structures with both relations and functions.
ECCC
2007
13 years 9 months ago
2007
We give a self-contained exposition of selected results in additive combinatorics over the group GF(2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Bal...