| http://www.w3.org/ns/prov#value | - CRYPTOGRAPHIC PROTOCOLS REFUTATION p ??? either all the terms are pure F1 -terms, and the rule is in F1 ; p ??? or t is a pure F2 -term, and the rule is in F2 . ??? the equational theory satis???es hypothesis 3; ??? the deduction system satis???es hypothesis 1; p ??? there is only a ???nite number of rules in F2 .Then D2 -satis???ability problems can be reduced to D1 -satis???ability problems.
|
