414 search results - page 19 / 83 » Resolution for Intuitionistic Logic |
JOLLI
2008
13 years 7 months ago
2008
In this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructive log...
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
CADE
2005
Springer
14 years 8 months ago
2005
Springer
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
CADE
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
TPHOL
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...