351 search results - page 14 / 71 » Classical proof forestry |
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...
FOCS
2008
IEEE
13 years 8 months ago
2008
IEEE
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
ENTCS
2006
13 years 7 months ago
2006
Inspired by the recent work on approximating classical logic, we present a procedure that approximates the modal logic K by determining a maximum limit of introspection. This proc...
COMBINATORICS
2007
13 years 7 months ago
2007
Sylvester’s identity is a classical determinantal identity with a straightforward linear algebra proof. We present combinatorial proofs of several non-commutative extensions, an...