Sciweavers

177 search results - page 8 / 36
» Linearizing Intuitionistic Implication
Sort
View
AIML
2004
13 years 9 months ago
Complexity of Strict Implication
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
Félix Bou
LICS
1995
IEEE
13 years 11 months ago
Decision Problems for Second-Order Linear Logic
The decision problem is studied for fragments of second-order linear logic without modalities. It is shown that the structural rules of contraction and weakening may be simulated ...
Patrick Lincoln, Andre Scedrov, Natarajan Shankar
LICS
1995
IEEE
13 years 11 months ago
Structural Cut Elimination
We present new proofs of cut elimination for intuitionistic, classical, and linear sequent calculi. In all cases the proofs proceed by three nested structural inductions, avoiding...
Frank Pfenning
ESOP
2006
Springer
13 years 11 months ago
ILC: A Foundation for Automated Reasoning About Pointer Programs
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
Limin Jia, David Walker
MLQ
2010
99views more  MLQ 2010»
13 years 6 months ago
Proof interpretations with truth
This article systematically investigates so-called “truth variants” of several functional interpretations. We start by showing a close relation between two variants of modifi...
Jaime Gaspar, Paulo Oliva