摘要
本文给出了可表性概念．应用可表性，处理了命题逻辑符号间的关系．
In this paper,The concepts about representability are given,applying them,the relations among the symbols of propositional logic are treated.
出处
《松辽学刊（自然科学版）》
1997年第4期89-92,共4页
Songliao Journal (Natural Science Edition)
关键词
可表性
命题逻辑
功能完备集
Representability Reopositional Logic Function perfect set
