4099 search results - page 100 / 820 » A Framework for Interactive Proof |
CORR
1999
Springer
14 years 9 months ago
1999
Springer
This paper introduces a logical system, called BV , which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challe...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
CADE
2004
Springer
15 years 10 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
CSFW
2010
IEEE
15 years 1 months ago
2010
IEEE
—Zero-knowledge proofs have a vast applicability in the domain of cryptography, stemming from the fact that they can be used to force potentially malicious parties to abide by th...
IJCAI
1993
14 years 11 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...