1302 search results - page 120 / 261 » Free-Style Theorem Proving |
125
click to vote
IPL
2006
15 years 4 months ago
2006
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
141
click to vote
JAT
2006
15 years 4 months ago
2006
Abstract. Recently M. Dritschel proved that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another pro...
116
click to vote
JCT
2006
15 years 4 months ago
2006
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
130
click to vote
ENTCS
2007
15 years 4 months ago
2007
We define an observational equivalence for Lafont’s interaction combinators, which we prove to be the least discriminating non-trivial congruence on total nets (nets admitting ...
145
click to vote
FAC
2007
15 years 4 months ago
2007
Abstract. We report on a case study in applying different formal methods to model and verify an architecture for administrating digital signatures. The architecture comprises seve...