290 search results - page 42 / 58 » Theorem Proving Using Lazy Proof Explication |
JCT
1998
14 years 9 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
CADE
2008
Springer
15 years 9 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
CADE
2005
Springer
15 years 9 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
IFM
2004
Springer
15 years 2 months ago
2004
Springer
Recent work on combining CSP and B has provided ways of describing systems comprised of components described in both B (to express requirements on state) and CSP (to express intera...
103
click to vote
FSTTCS
1991
Springer
15 years 1 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...