Sciweavers

351 search results - page 36 / 71
» Classical proof forestry
Sort
View
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
14 years 1 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
WADT
1998
Springer
13 years 12 months ago
Hierarchical Heterogeneous Specifications
We propose a definition of hierarchical heterogeneous formal specifications, where each module is specified according to its own homogeneous logic. We focus on the specification st...
Sophie Coudert, Gilles Bernot, Pascale Le Gall
BIRTHDAY
2009
Springer
14 years 2 months ago
No Syllogisms for the Numerical Syllogistic
The numerical syllogistic is the extension of the traditional syllogistic with numerical quantifiers of the forms at least C and at most C. It is known that, for the traditional s...
Ian Pratt-Hartmann
CRYPTO
2001
Springer
139views Cryptology» more  CRYPTO 2001»
14 years 5 days ago
Soundness in the Public-Key Model
The public-key model for interactive proofs has proved to be quite effective in improving protocol efficiency [CGGM00]. We argue, however, that its soundness notion is more subtle...
Silvio Micali, Leonid Reyzin
APLAS
2010
ACM
13 years 7 months ago
Reasoning about Computations Using Two-Levels of Logic
We describe an approach to using one logic to reason about specifications written in a second logic. One level of logic, called the "reasoning logic", is used to state th...
Dale Miller