Sciweavers

Share
ICNC
2005
Springer

On the Categorizing of Simply Separable Relations in Partial Four-Valued Logic

9 years 1 months ago
On the Categorizing of Simply Separable Relations in Partial Four-Valued Logic
In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important problem,and the solution can be reduced to determining the minimal coverings of precomplete categories. It’s well known that each precomplete set is a function set, ( )mT G , preserving the relation mG , therefore, the categorizing of this relation has provided the determination of precomplete set’s minimal covering with more convenient ways. In this paper, simply separable relations in partial four-valued logic are categorized by similar relation.
Renren Liu, Zhiwei Gong, Fen Xu
Added 27 Jun 2010
Updated 27 Jun 2010
Type Conference
Year 2005
Where ICNC
Authors Renren Liu, Zhiwei Gong, Fen Xu
Comments (0)
books