The Completeness And Compactness Of A Three-Valued First-Order Logic.
The lattice of linear classes in prime-valued logics
The logic of neural networks.
This paper establishes the equivalence between multilayer feedforward networks and linear combinations of Lukasiewicz propositions. In this sense, multilayer forward networks have a logic interpretation, which should permit to apply logical techniques in the neural networks framework.
Theorem-proving systems [Book]
Three semantical interpretations of a statistical theoremhood testing procedure
Three-valued logic and cut-elimination: The actual meaning of Takeuti's conjecture [Book]
Über die Kennzeichnung von Junktoren durch die Gestalt der Herleitbaren Ausdrücke.
Using maximal ideals in the classification of MV-algebras
Very true operators on MTL-algebras
The main goal of this paper is to investigate very true MTL-algebras and prove the completeness of the very true MTL-logic. In this paper, the concept of very true operators on MTL-algebras is introduced and some related properties are investigated. Also, conditions for an MTL-algebra to be an MV-algebra and a Gödel algebra are given via this operator. Moreover, very true filters on very true MTL-algebras are studied. In particular, subdirectly irreducible very true MTL-algebras are characterized...
Wajsberg algebras.
We present the basic theory of the most natural algebraic counterpart of the ℵ0-valued Lukasiewicz calculus, strictly logically formulated. After showing its lattice structure and its relation to C. C. Chang's MV-algebras we study the implicative filters and prove its equivalence to congruence relations. We present some properties of the variety of all Wajsberg algebras, among which there is a representation theorem. Finally we give some characterizations of linear, simple and semisimple algebras....
Группы автострофий разделимых сильно зависимых операций
Достаточное условие, при котором замкнутые классы -значной логики имеют только тривиальные конгруэнции
Критррий полноты систем операций в операторных алгоритмах, реализующих функции k-значной логики
Некоторые комбинаторные вопросы, касающиеся функциональных построений в k-значной логике
Некоторые свойства решетки параметрически замкнутых классов функций трехзначной логики
О параметрической выразимости функций трехзначной логики
Об L-эквивалентности систем функций в многозначных логиках
Об аксиоматизации конечнозначных логических исчислений
Об итеративных алгебрах без проекций
Обобщение двух теорем Белоусова для сильно зависимых функций k-значной логики