-
1
-
-
0000020502
-
Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics
-
A. Avellone, M. Ferrari, and P. Miglioli. Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics. Logic Journal of the IGPL, 7(4):447-480, 1999.
-
(1999)
Logic Journal of the IGPL
, vol.7
, Issue.4
, pp. 447-480
-
-
Avellone, A.1
Ferrari, M.2
Miglioli, P.3
-
2
-
-
0001055868
-
Contraction-free sequent calculi for intuitionistic logic
-
R. Dyckhoff. Contraction-free sequent calculi for intuitionistic logic. Journal of Symbolic Logic, 57:795-807, 1992.
-
(1992)
Journal of Symbolic Logic
, vol.57
, pp. 795-807
-
-
Dyckhoff, R.1
-
3
-
-
84957819884
-
Formulae-as-resources management for an intuitionistic theorem prover
-
Sao Paulo, Brazil, July
-
D. Galmiche and D. Larchey-Wendling. Formulae-as-resources management for an intuitionistic theorem prover. In 5th Workshop on Logic, Language, Information and Computation, WoLLIC'98, Sao Paulo, Brazil, July 1998.
-
(1998)
5th Workshop on Logic, Language, Information and Computation, WoLLIC'98
-
-
Galmiche, D.1
Larchey-Wendling, D.2
-
4
-
-
84887042561
-
Structural sharing and efficient proof-search in propositional intuitionistic logic
-
LNCS 1742 Phuket, Thailand, December
-
D. Galmiche and D. Larchey-Wendling. Structural sharing and efficient proof-search in propositional intuitionistic logic. In Asian Computing Science Conference, ASIAN'99, LNCS 1742, pages 101-112, Phuket, Thailand, December 1999.
-
(1999)
Asian Computing Science Conference, ASIAN'99
, pp. 101-112
-
-
Galmiche, D.1
Larchey-Wendling, D.2
-
5
-
-
0002449270
-
An O(n log n)-space decision procedure for intuitionistic propositional logic
-
J. Hudelmaier. An O(n log n)-space decision procedure for intuitionistic propositional logic. Journal of Logic and Computation, 3(1):63-75, 1993.
-
(1993)
Journal of Logic and Computation
, vol.3
, Issue.1
, pp. 63-75
-
-
Hudelmaier, J.1
-
6
-
-
0039705575
-
Loop-free construction of counter-models for intuitionistic propositional logic
-
Behara and al., editors
-
L. Pinto and R. Dyckhoff. Loop-free construction of counter-models for intuitionistic propositional logic. In Behara and al., editors, Symposia Gaussiana, pages 225-232, 1995.
-
(1995)
Symposia Gaussiana
, pp. 225-232
-
-
Pinto, L.1
Dyckhoff, R.2
-
7
-
-
0038631297
-
An intuitionistic predicate logic theorem prover
-
D. Sahlin, T. Franzén, and S. Haridi. An intuitionistic predicate logic theorem prover. Journal of Logic and Computation, 2(5):619-656, 1993.
-
(1993)
Journal of Logic and Computation
, vol.2
, Issue.5
, pp. 619-656
-
-
Sahlin, D.1
Franzén, T.2
Haridi, S.3
-
8
-
-
0039113443
-
Porgi: A proof-or-refutation generator for intuitionistic propositional logic
-
Rutgers University, New Brunswick, USA
-
A. Stoughton. Porgi: a proof-or-refutation generator for intuitionistic propositional logic. In CADE Workshop on Proof-search in Type-theoretic Languages, pages 109-116, Rutgers University, New Brunswick, USA, 1996.
-
(1996)
CADE Workshop on Proof-search in Type-theoretic Languages
, pp. 109-116
-
-
Stoughton, A.1
|