Author： Hayashi S. Sumitomo R. Shii K.-i.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.272, Iss.1, 2002-02, pp. : 177-195
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Towards a semantics of proofs for non-commutative logic: multiplicatives and additives
By Abrusci V.M.
Theoretical Computer Science, Vol. 294, Iss. 3, 2003-02 ,pp. :
Access to resources
Recommend
Planning Proofs of Equations in CCS
By Monroy R.
Automated Software Engineering, Vol. 7, Iss. 3, 2000-07 ,pp. :
Scott Induction and Equational Proofs
Electronic Notes in Theoretical Computer Science, Vol. 1, Iss. 1, 2004-01 ,pp. :
Automated Proofs for Asymmetric Encryption
By Courant J. Daubignard M. Ene C. Lafourcade P. Lakhnech Y.
Journal of Automated Reasoning, Vol. 46, Iss. 3-4, 2011-04 ,pp. :