Author： Carlucci L.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.300, Iss.1, 2003-05, pp. : 365-378
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
A proof of Choffrut's theorem on subsequential functions
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :
Access to resources
Recommend
Proof-search in type-theoretic languages: an introduction
Theoretical Computer Science, Vol. 232, Iss. 1, 2000-02 ,pp. :
The Use of Proof Planning for Co-operative Theorem Proving
Journal of Symbolic Computation, Vol. 25, Iss. 2, 1998-02 ,pp. :
Alternative Proof of Standard Completeness Theorem for MTL
Soft Computing, Vol. 11, Iss. 2, 2007-01 ,pp. :
A proof of Simon's theorem on piecewise testable languages
By Higgins P.M.
Theoretical Computer Science, Vol. 178, Iss. 1, 1997-05 ,pp. :