1322 search results - page 137 / 265 » Unsound Theorem Proving |
IANDC
2008
13 years 10 months ago
2008
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We use entropy rates and Schur concavity to prove that, for every integer k 2, every nonzero rational number q, and every real number , the base-k expansions of , q + , and q all...
IJNSEC
2006
13 years 10 months ago
2006
Cryptographic algorithms often prescribe the use of primes whose length in bits is a power of 2. Recently, we proved that for m > 1, there is no prime number with 2m significan...
IPL
2006
13 years 10 months ago
2006
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
This paper presents experiments on common knowledge logic, conducted with the help of the proof assistant Coq. The main feature of common knowledge logic is the eponymous modality...