LPAR
2010
Springer
13 years 2 months ago
2010
Springer
In the celebrated G
LICS
2010
IEEE
13 years 2 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...
IANDC
2010
13 years 3 months ago
2010
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...
BSL
2004
13 years 4 months ago
2004
Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mat...
APAL
2006
13 years 4 months ago
2006
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like...
CSL
2010
Springer
13 years 5 months ago
2010
Springer
It is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented i...
CIE
2006
Springer
13 years 8 months ago
2006
Springer
LJQ is a focused sequent calculus for intuitionistic logic, with
TABLEAUX
1997
Springer
13 years 8 months ago
1997
Springer
We present a Prolog program that implements a sound and complete theorem prover for first-order intuitionistic logic. It is based on free-variable semantic tableaux extended by an...
RTA
1998
Springer
13 years 8 months ago
1998
Springer
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...
TABLEAUX
2005
Springer
13 years 10 months ago
2005
Springer
The Intuitionistic Logic Theorem Proving (ILTP) Library provides a platfom for testing and benchmarking theorem provers for first-order intuitionistic logic. It includes a collect...