199 search results - page 6 / 40 » Denotations for Classical Proofs - Preliminary Results |
BSL
2004
13 years 7 months ago
2004
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. We present randoCoP, a theorem prover for classical firstorder logic, which integrates randomized search techniques into the connection prover leanCoP 2.0. By randomly re...
JCT
2011
13 years 2 months ago
2011
Our recent paper [5] provides extensions to two classical determinantal results of Bressoud and Wei, and of Koike. The proofs in that paper were algebraic. The present paper conta...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
JAR
2010
13 years 6 months ago
2010
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...