In many-valued logic the decision of functional completeness is a basic and important problem, and the thorough solution to this problem depends on determining all maximal closed sets in the set of many-valued logic functions. It includes three famous problems, i.e., to determine all maximal closed
β¦ LIBER β¦
Generation of unary monotone functions of multi-valued logic
β Scribed by D. Yu. Panin
- Book ID
- 111494995
- Publisher
- Allerton Press Inc
- Year
- 2010
- Tongue
- English
- Weight
- 1015 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0027-1322
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The Maximal Closed Classes of Unary Func
β
Liu Renren; Lo Czukai
π
Article
π
1996
π
John Wiley and Sons
π
English
β 327 KB
A sequence of functions of the multi-val
β
A. A. Andreev
π
Article
π
2011
π
Allerton Press Inc
π
English
β 997 KB
Monotone insertion of lattice-valued fun
β
I. Mardones-PΓ©rez; M. A. de Prada Vicente
π
Article
π
2007
π
Akadmiai Kiad
π
English
β 328 KB
Monotonic functions of many-valued logic
β
M.M. Kovalev; P. Milanov
π
Article
π
1984
π
Elsevier Science
β 281 KB
Representation of Multiple-Valued Logic
β
StankoviΔ, Radomir S.; Astola, Jaakko T.; Moraga, Claudio
π
Article
π
2012
π
Morgan & Claypool
π
English
β 833 KB
Compared to binary switching functions, the multiple-valued functions (MV) offer more compact representations of the information content of signals modeled by logic functions and, therefore, their use fits very well in the general settings of data compression attempts and approaches. The first task
Generalized Convexity of Functions and G
β
J.-P. Penot; P. H. Quang
π
Article
π
1997
π
Springer
π
English
β 504 KB