1101 search results - page 116 / 221 » Forcing in proof theory |
125
Voted
JC
2008
15 years 3 months 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...
142
Voted
ALGORITHMICA
2002
15 years 3 months 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 ...
127
Voted
IANDC
2010
15 years 2 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...
114
Voted
MP
2010
15 years 2 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...
121
Voted
PPDP
2010
Springer
15 years 2 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...