In this paper, by means of the completeness theory of Partial K-Valued Logic the authors proved that for simply (separable) function sets(m=2) whose relation graphics are trees, one kind of these is not the component part of the minimal covering of precomplete classes in P~*_k and the other is the (component) part of the minimal covering of precomplete classes in P~*_k.
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
