414 search results - page 20 / 83 » Resolution for Intuitionistic Logic |
LICS
1995
IEEE
13 years 11 months ago
1995
IEEE
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...
TABLEAUX
2007
Springer
14 years 1 months ago
2007
Springer
Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate lo...
JSYML
2006
13 years 7 months ago
2006
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
CADE
1998
Springer
13 years 12 months ago
1998
Springer
Proceedings of CADE-15, LNAI 1421, pp. 205
PADL
2004
Springer
14 years 29 days ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...