111 search results - page 9 / 23 » A Proof of Strong Normalisation using Domain Theory |
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ļ...
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
LICS
2007
IEEE
14 years 1 months ago
2007
IEEE
Set theories are traditionally based on ļ¬rst-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many beneļ¬ts. To this end, we...
ML
2000
ACM
13 years 7 months ago
2000
ACM
Existing methods for exploiting awed domain theories depend on the use of a su ciently large set of training examples for diagnosing and repairing aws in the theory. In this paper,...