1101 search results - page 116 / 221 » Forcing in proof theory |
JC
2008
15 years 20 days ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
111
click to vote
ALGORITHMICA
2002
15 years 17 days ago
2002
Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very ...
106
click to vote
IANDC
2010
14 years 11 months ago
2010
The semantics of name-passing calculi is often defined employing coalgebraic models over presheaf categories. This elegant theory lacks finiteness properties, hence it is not ap...
MP
2010
14 years 11 months ago
2010
In this paper, we propose lifting techniques for generating strong cuts for nonlinear programs that are globally-valid. The theory is geometric and provides intuition into lifting...
PPDP
2010
Springer
14 years 11 months ago
2010
Springer
Permissive-Nominal Logic (PNL) is an extension of firstorder logic where term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such...