1101 search results - page 51 / 221 » Forcing in proof theory |
95
Voted
CSL
2005
Springer
15 years 6 months ago
2005
Springer
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
102
click to vote
ENTCS
2007
15 years 16 days ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
87
Voted
CP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
116
Voted
LICS
2003
IEEE
15 years 5 months ago
2003
IEEE
We present a constructive procedure for extracting polynomial-time realizers from ineffective proofs of Π0 2theorems in feasible analysis. By ineffective proof we mean a proof wh...
COCO
2008
Springer
15 years 2 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...