Sciweavers

351 search results - page 32 / 71
» Classical proof forestry
Sort
View
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
13 years 11 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz
MSCS
2006
53views more  MSCS 2006»
13 years 7 months ago
Random reals and Lipschitz continuity
Abstract. Lipschitz continuity is used as a tool for analyzing the relationship between incomputability and randomness. Having presented a simpler proof of one of the major results...
Andrew E. M. Lewis, George Barmpalias
ENTCS
2002
78views more  ENTCS 2002»
13 years 7 months ago
Theoretical Foundations of Value Withdrawal Explanations for Domain Reduction
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations. Domain reduction is formalized with ch...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
SLOGICA
2002
81views more  SLOGICA 2002»
13 years 7 months ago
Bicartesian Coherence
A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places...
Kosta Dosen, Zoran Petric
CORR
2011
Springer
194views Education» more  CORR 2011»
13 years 2 months ago
Polarized Montagovian Semantics for the Lambek-Grishin calculus
Grishin ([10]) proposed enriching the Lambek calculus with multiplicative disjunction (par) and coresiduals. Applications to linguistics were discussed by Moortgat ([15]), who spok...
Arno Bastenhof