Tractability of cut-free Gentzen type propositional calculus with permutation inference

Author： Arai N.H.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.170, Iss.1, 1996-12, pp. : 129-144

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Polymorphic Environment Calculus and its Type-Inference Algorithm

By Nishizaki S-Y.  

LISP and Symbolic Computation, Vol. 13, Iss. 3, 2000-09 ,pp. : 239-278

Springer Publishing Company

Access to resources Recommend Favorite

Axiomatizing the Skew Boolean Propositional Calculus

By Veroff R.   Spinks M.  

Journal of Automated Reasoning, Vol. 37, Iss. 1-2, 2006-08 ,pp. : 3-20

Springer Publishing Company

Access to resources Recommend Favorite

Type inference for set theory

By Turner  

Theoretical Computer Science, Vol. 266, Iss. 1, 2001-09 ,pp. : 951-974

Elsevier

Access to resources Recommend Favorite

A Generalized Deadlock-Free Process Calculus

By Sumii E.   Kobayashi N.  

Electronic Notes in Theoretical Computer Science, Vol. 16, Iss. 3, 2004-01 ,pp. : 1-23

Elsevier

Access to resources Recommend Favorite

-calculus in (Co)inductive-type theory

By Honsell F.   Miculan M.   Scagnetto I.  

Theoretical Computer Science, Vol. 253, Iss. 2, 2001-02 ,pp. : 239-285

Elsevier

Access to resources Recommend Favorite