Sciweavers

96 search results - page 1 / 20
» A lower bound for intuitionistic logic
Sort
View
APAL
2007
71views more  APAL 2007»
13 years 4 months ago
A lower bound for intuitionistic logic
We give an exponential lower bound on number of proof-lines in intuitionistic propositional logic, IL, axiomatised in the usual Frege-style fashion; i.e., we give an example of IL...
Pavel Hrubes
RTA
1998
Springer
13 years 9 months ago
The Decidability of Simultaneous Rigid E-Unification with One Variable
We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the fragment of i...
Anatoli Degtyarev, Yuri Gurevich, Paliath Narendra...
IANDC
2010
91views more  IANDC 2010»
13 years 3 months ago
Functional interpretations of linear and intuitionistic logic
This article shows how different functional interpretations can be combined into what we term hybrid functional interpretations. These hybrid interpretations work on the setting o...
Paulo Oliva
CADE
2006
Springer
14 years 5 months ago
Strong Cut-Elimination Systems for Hudelmaier's Depth-Bounded Sequent Calculus for Implicational Logic
Abstract. Inspired by the Curry-Howard correspondence, we study normalisation procedures in the depth-bounded intuitionistic sequent calculus of Hudelmaier (1988) for the implicati...
Roy Dyckhoff, Delia Kesner, Stéphane Lengra...
AIML
2004
13 years 6 months ago
A Lower Complexity Bound for Propositional Dynamic Logic with Intersection
This paper shows that satisfiability for Propositional Dynamic Logic with Intersection is EXPSPACE-hard. The proof uses a reduction from the word problem for alternating, exponent...
Martin Lange