1101 search results - page 2 / 221 » Forcing in proof theory |
CSFW
2010
IEEE
13 years 9 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...
WOLLIC
2009
Springer
14 years 1 days ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
FLOPS
2006
Springer
13 years 9 months ago
2006
Springer
Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encodin...
TROB
2002
13 years 5 months ago
2002
This paper addresses the problem of achieving exact dynamic force control with manipulators possessing the low-level position and/or velocity controllers typically employed in indu...
ISCC
2008
IEEE
13 years 12 months ago
2008
IEEE
We propose efficient scheduling algorithms for downlink MIMO-CDMA systems using zero forcing beamforming to achieve high system throughput with low computational complexity. Base...