3552 search results - page 136 / 711 » Proof theory in the abstract |
174
click to vote
AMAI
2006
Springer
15 years 6 months ago
2006
Springer
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
164
click to vote
DRM
2007
Springer
16 years 17 days ago
2007
Springer
The goal of obfuscation is to transform a program, without affecting its functionality, such that some secret information within the program can be hidden for as long as possible...
146
click to vote
CIE
2007
Springer
16 years 17 days ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
200
click to vote
AISC
2010
Springer
15 years 9 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
155
click to vote
ACNS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zeroknowledge (and witness-indistinguishable) proofs in bilinear groups. While av...