Author: Dybjer P.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.176, Iss.1, 1997-04, pp. : 329-335
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 cartesian closed category in Martin-Lof's intuitionistic type theory
By Valentini S.
Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. :
Martin's game: a lower bound for the number of sets
By Ageev M.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Small sets in best approximation theory
Journal of Global Optimization, Vol. 50, Iss. 1, 2011-05 ,pp. :
Implementing Valiant's Learnability Theory Using Random Sets
By Oblow E.M.
Machine Learning, Vol. 08, Iss. 1, 1992-01 ,pp. :