1322 search results - page 54 / 265 » Unsound Theorem Proving |
ECCC
2006
14 years 12 months ago
2006
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
COMBINATORICS
2004
14 years 11 months ago
2004
The Sandwich Theorems proved in this paper give a new method to show that the partition function a(n) of a partition identity A(x) := n=0 a(n)xn = n=1 (1 - xn )-p(n) satisfies t...
86
Voted
COMBINATORICS
2000
14 years 11 months ago
2000
: We prove two extensions of the Hales-Jewett coloring theorem. The first is a polynomial version of a finitary case of Furstenberg and Katznelson's multiparameter elaboration...
101
click to vote
STOC
2004
ACM
16 years 5 days ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
ICSE
2007
IEEE-ACM
15 years 12 months ago
2007
IEEE-ACM
The Verifying Compiler (VC) project is a core component of the Dependable Systems Evolution Grand Challenge. The VC offers the promise of automatically proving that a program or c...