Permutability of proofs in intuitionistic sequent calculi

By Dyckhoff R.   Pinto L.  

Theoretical Computer Science, Vol. 212, Iss. 1, 1999-02 ,pp. : 141-155

Elsevier

Access to resources Recommend Favorite

Contraction-Free Linear Depth Sequent Calculi for Intuitionistic Propositional Logic with the Subformula Property and Minimal Depth Counter-Models

By Ferrari Mauro  

Journal of Automated Reasoning, Vol. 51, Iss. 2, 2013-08 ,pp. : 129-149

Springer Publishing Company

Access to resources Recommend Favorite

On the Complexity of Deduction Modulo Leaf Permutative Equations

By Boy de la Tour Thierry   Echenim Mnacho  

Journal of Automated Reasoning, Vol. 33, Iss. 3-4, 2004-10 ,pp. : 271-317

Springer Publishing Company

Access to resources Recommend Favorite

On categorical equivalence of Gentzen-style derivations in IMLL

By Soloviev S.   Orevkov V.  

Theoretical Computer Science, Vol. 303, Iss. 1, 2003-06 ,pp. : 245-260

Elsevier

Access to resources Recommend Favorite

Natural termination

By Dershowitz N.   Hoot C.  

Theoretical Computer Science, Vol. 142, Iss. 2, 1995-05 ,pp. : 179-207

Elsevier

Access to resources Recommend Favorite