1302 search results - page 38 / 261 » Free-Style Theorem Proving |
CADE
2004
Springer
14 years 8 months ago
2004
Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
CIE
2010
Springer
14 years 16 days ago
2010
Springer
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
CADE
2002
Springer
14 years 8 months ago
2002
Springer
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires reasoning at the meta-level. There is a particularly elegan...
COMBINATORICS
2002
13 years 7 months ago
2002
We give a generalization for the Deza-Frankl-Singhi Theorem in case of multiple intersections. More exactly, we prove, that if H is a set-system, which satisfies that for some k, ...
RSA
2010
13 years 6 months ago
2010
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...