4850 search results - page 156 / 970 » Proof and Computation in Geometry |
122
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...
185
click to vote
TLCA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
164
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applic...
156
click to vote
MFCS
2005
Springer
15 years 12 months ago
2005
Springer
Let β be a real number with 1 < β < 2. We prove that the language of the β-shift is ∆0 n iff β is a ∆n-real. The special case where n is 1 is the independently inter...
146
click to vote
CSR
2008
Springer
15 years 8 months ago
2008
Springer
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...