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

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

Terminating Calculi for Propositional Dummett Logic with Subformula Property

By Fiorino Guido  

Journal of Automated Reasoning, Vol. 52, Iss. 1, 2014-01 ,pp. : 67-97

Springer Publishing Company

Access to resources Recommend Favorite

Encoding transition systems in sequent calculus

By McDowell R.   Miller D.   Palamidessi C.  

Theoretical Computer Science, Vol. 294, Iss. 3, 2003-02 ,pp. : 411-437

Elsevier

Access to resources Recommend Favorite

Process algebra with propositional signals

By Baeten J.C.M.   Bergstra J.A.  

Theoretical Computer Science, Vol. 177, Iss. 2, 1997-05 ,pp. : 381-405

Elsevier

Access to resources Recommend Favorite