✦ LIBER ✦

Deciphering of some classes of monotonic many-valued functions

✍ Scribed by V.B. Alekseev

Publisher: Elsevier Science
Year: 1976
Weight: 738 KB
Volume: 16
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(76)90083-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal deciphering algorithm for som

An optimal deciphering algorithm for some classes of monotonic functions

✍ A.V. Serzhantov 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 291 KB

Monotonic functions of many-valued logic

Monotonic functions of many-valued logic and supermatroids

✍ M.M. Kovalev; P. Milanov 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 281 KB

Existence of infinitely many critical va

Existence of infinitely many critical values of some nonsymmetric functionals

✍ Yan Yan Li 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 486 KB

Universal Classes of MV-chains with Appl

Universal Classes of MV-chains with Applications to Many-valued Logics

✍ Joan Gispert 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

In this paper we characterize, classify and axiomatize all universal classes of MV-chains. Moreover, we accomplish analogous characterization, classification and axiomatization for congruence distributive quasivarieties of MV-algebras. Finally, we apply those results to study some finitary extension

Characterizations of Learnability for Cl

Characterizations of Learnability for Classes of {0, ..., n)-Valued Functions

✍ S. Bendavid; N. Cesabianchi; D. Haussler; P.M. Long 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 885 KB

We investigate the PAC learnability of classes of \(\{0, \ldots, n\}\)-valued functions \((n<\infty)\). For \(n=1\) it is known that the finiteness of the Vapnik-Chervonenkis dimension is necessary and sulficient for learning. For \(n>1\) several generalizations of the VC-dimension, each yielding a

A class of matrix monotone functions

✍ V.E.S. Szabó 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 112 KB