Completeness, functional completeness and relative completeness.
Congruence preserving operations on the ring
We investigate the interval in the lattice of clones on the ring between the clone of polynomial operations and the clone of congruence preserving operations. All clones in this interval are known and described by means of generators. In this paper, we characterize each of these clones by the property of preserving a small set of relations. These relations turn out to be in a close connection to commutators.
Deduction in many-valued logics: a survey.
Die Nichtaxiomatisierbarkeit der unendlichwertigen Mengenlehre.
Die Unentscheidbarkeit der einstelligen unendlichwertigen Prädikatenlogik.
Direct product decomposition of -algebras
DRl-semigroups and -algebras
Ein Beitrag zu der GUHA Methode in der dreiwertigen Logik
Embeddings of quasicells of iterative algebras.
Entropy on effect algebras with Riesz decomposition property II: MV-algebras
We study the entropy mainly on special effect algebras with (RDP), namely on tribes of fuzzy sets and sigma-complete MV-algebras. We generalize results from [RiMu] and [RiNe] which were known only for special tribes.
Entropy on effect algebras with the Riesz decomposition property I: Basic properties
We define the entropy, lower and upper entropy, and the conditional entropy of a dynamical system consisting of an effect algebra with the Riesz decomposition property, a state, and a transformation. Such effect algebras allow many refinements of two partitions. We present the basic properties of these entropies and these notions are illustrated by many examples. Entropy on MV-algebras is postponed to Part II.
Evaluating many valued modus ponens
This paper deals with many valued case of modus ponens. Cases with implicative and with clausal rules are studied. Many valued modus ponens via discrete connectives is studied with implicative rules as well as with clausal rules. Some properties of discrete modus ponens operator are given.
Exploring a Syntactic Notion of Modal Many-Valued Logics.
Filters of -algebras.
Finite Equations in n Unknowns
Finite Symmetric Functions with Non-Trivial Arity Gap
Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)). We prove several results concerning decomposition of the symmetric functions with non-trivial arity gap with its minors or subfunctions. We show that all non-empty sets of...
Formulas of the general solutions of Boolean equations.
From two- to four-valued logic
The purpose of this note is to show that a known and natural four-valued logic co-exists with classical two-valued logic in the familiar context of truth tables. The tool required is the power construction.
Fuzzy Boolean algebras and Łukasiewicz logic.
Galois correspondences for closed classes of functions with delay. I.