Some results on the minimal coverings of precomplete classes in partialk-valued logic functions

Some results on the minimal coverings of precomplete classes in partialk-valued logic functions

In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this paper, someFull Symmetric Function Sets (m=3) are proved to be components of the minima...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer science and technology 2004-12, Vol.19 (6), p.981-985
Hauptverfasser: Liu, Ren-Ren, Chen, Song-Qiao, Chen, Jian-Er, Li, Shu
Format: Artikel
Sprache:eng
Schlagworte:
Completeness
Covering
Coverings
Logic
Mathematical analysis
Mathematical models
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In completeness theories of multiple-valued logic, the characterization of Sheffer functions is an important issue. The solution can be reduced to determining the minimal coverings of precomplete classes. In this paper, someFull Symmetric Function Sets (m=3) are proved to be components of the minimal covering of precomplete classes inPk*.
ISSN:1000-9000
1860-4749
DOI:10.1007/BF02973463