Author： Horčík Rostislav
Publisher： Springer Publishing Company
ISSN： 1432-7643
Source： Soft Computing, Vol.11, Iss.2, 2007-01, pp. : 123-129
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
A coinductive completeness proof for the equivalence of recursive types
By Cardone
Theoretical Computer Science, Vol. 275, Iss. 1, 2002-03 ,pp. :
Access to resources
Recommend
A proof of Choffrut's theorem on subsequential functions
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem
By Carlucci L.
Theoretical Computer Science, Vol. 300, Iss. 1, 2003-05 ,pp. :
The Use of Proof Planning for Co-operative Theorem Proving
Journal of Symbolic Computation, Vol. 25, Iss. 2, 1998-02 ,pp. :