12774 search results - page 105 / 2555 » A Framework for Proof Systems |
160
click to vote
ANSS
2007
IEEE
15 years 10 months ago
2007
IEEE
For embedded systems as well as for biological cell systems, design is a feature that defines their identity. The assembly of different components in designs of both systems can ...
111
Voted
CRYPTO
2009
Springer
15 years 10 months ago
2009
Springer
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other ...
135
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
106
Voted
LICS
2006
IEEE
15 years 10 months ago
2006
IEEE
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
127
click to vote
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...