Results 271 to 280 of about 4,125 (289)
Some of the next articles are maybe not open access.
Nodal filters and seminodes in equality algebras
Journal of Intelligent & Fuzzy Systems, 2019In this paper, we introduce the notions of node, nodal filter and seminode in equality algebras and study some properties of them. First, we study the relation between nodes and other specific elements. Furthermore, by defining some operations on N
Xin Xun, Xiao Long Xin 0001
openaire +1 more source
Pseudovarieties of algebras with fuzzy equalities
Fuzzy Sets and Systems, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Monadic pseudo-equality algebras
Soft Computing, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Fuzzy filters on equality algebras with applications
Journal of Intelligent & Fuzzy Systems, 2018In this paper, we introduce the notion of fuzzy filters on equality algebras and study a fuzzy filter generated by a fuzzy set. We also solve the open problem which was presented by Kadji, Lele and Tonga in [Soft Computing, 21 (2017) 1913-1922]. In addition, we denote the set of all cosets of a fuzzy filter f
Xiao Ye Yu +2 more
openaire +1 more source
On the algebraic complexity of set equality and inclusion
Information Processing Letters, 2004We present a linear-time algorithm in the algebraic computation tree model for checking whether two sets of integers are equal. The significance of this result is in the fact that it shows that set equality testing is computationally easier when the elements of the sets are restricted to be integers.
openaire +2 more sources
Implicative equality algebras and annihilators in equality algebras
Journal of Discrete Mathematical Sciences and Cryptography, 2021M. Aaly Kologani +3 more
openaire +1 more source
2016
In this paper, we introduce a new structure, called hyper equality algebras which are a generalization of equality algebras, and investigate some related properties. Then we define (weak, strong) hyper filters and (weak, strong) hyper deductive systems, and give relations between them.
Xiao-Yun Cheng +2 more
openaire +1 more source
In this paper, we introduce a new structure, called hyper equality algebras which are a generalization of equality algebras, and investigate some related properties. Then we define (weak, strong) hyper filters and (weak, strong) hyper deductive systems, and give relations between them.
Xiao-Yun Cheng +2 more
openaire +1 more source
On the equational theory of representable polyadic equality algebras
Journal of Symbolic Logic, 2000AbstractAmong others we will prove that the equational theory of ω dimensional representable polyadic equality algebras (RPEAω's) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is finite schema-axiomatizable (and hence ...
István Németi, Gábor Sági
openaire +2 more sources
On Equality Predicates in Algebraic Specification Languages
2007The execution of OBJ algebraic specification languages is based on the term rewriting system (TRS), which is an efficient theory to perform equational reasoning. We focus on the equality predicate implemented in OBJ languages. The equality predicate is used to test the equality of given terms by TRS.
Masaki Nakamura 0001, Kokichi Futatsugi
openaire +1 more source
On Definability of the Equality in Classes of Algebras with an Equivalence Relation
Studia Logica, 2000In an earlier paper, the author has presented [``A finitary 1-equivalential logic not finitely equivalential'', Bull. Sect. Log., Univ. Lódź, Dep. Log. 24, No. 3, 120-123 (1995; Zbl 0841.03037)] a (finitary) regularly algebraizable logic in the similarity type \(\{\leftrightarrow\}\) that is not finitely equivalential.
openaire +1 more source