96 search results - page 4 / 20 » On Several Proofs of the Recognizability Theorem |
106
click to vote
ECCC
2006
14 years 9 months ago
2006
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
LOGCOM
2000
14 years 9 months ago
2000
The criterion for confluence using decreasing diagrams is a generalization of several well-known confluence criteria act rewriting, such as the strong confluence lemma. We give a ...
AML
2007
14 years 9 months ago
2007
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each...
AISC
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. The main goal of our work is to formally prove the correctness of the key commands of the SCHUR software, an interactive program for calculating with characters of Lie gr...
114
click to vote
ACL2
2006
ACM
15 years 3 months ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...