Author： Esik Z.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.177, Iss.1, 1997-04, pp. : 217-283
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
By Girard J.-Y.
Theoretical Computer Science, Vol. 227, Iss. 1, 1999-09 ,pp. :
Access to resources
Recommend
Algebraic proofs of consistency and completeness
Theoretical Computer Science, Vol. 150, Iss. 1, 1995-10 ,pp. :
Duality and the completeness of the modal -calculus
By Ambler S. Kwiatkowska M. Measor N.
Theoretical Computer Science, Vol. 151, Iss. 1, 1995-11 ,pp. :
Fixed points without completeness
By Mislove M.W. Roscoe A.W. Schneider S.A.
Theoretical Computer Science, Vol. 138, Iss. 2, 1995-02 ,pp. :
On Completeness under Random Reductions
Journal of Computer and System Sciences, Vol. 53, Iss. 3, 1996-12 ,pp. :