61 search results - page 3 / 13 » What Is the Problem with Proof Nets for Classical Logic |
LPNMR
2001
Springer
13 years 10 months ago
2001
Springer
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
CADE
2008
Springer
14 years 6 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...
LICS
2010
IEEE
13 years 4 months ago
2010
IEEE
—We design an intuitionistic predicate logic that supports a limited amount of classical reasoning, just enough to prove a variant of Markov’s principle suited for predicate lo...
MLQ
2010
13 years 4 months ago
2010
This article systematically investigates so-called “truth variants” of several functional interpretations. We start by showing a close relation between two variants of modifi...
TPHOL
2003
IEEE
13 years 11 months ago
2003
IEEE
This paper addresses the crucial issue in the design of a proof development system of how to deal with partial functions and the related question of how to treat undefined terms. ...