1322 search results - page 108 / 265 » Unsound Theorem Proving |
ENTCS
2007
13 years 10 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 ...
FAC
2007
13 years 10 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...
RML
2006
13 years 10 months ago
2006
Abstract. A topos version of Cantor's back and forth theorem is established and used to prove that the ordered structure of the rational numbers Q, < is homogeneous in any ...
ARSCOM
2004
13 years 10 months ago
2004
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...
CORR
2002
Springer
13 years 10 months ago
2002
Springer
We give a precise definition of "generic-case complexity" and show that for a very large class of finitely generated groups the classical decision problems of group theor...