We prove that RS-BL-algebras are MV-algebras.

This paper is the first of a two part series. In this paper, we first prove that the variety of dually quasi-De Morgan Stone semi-Heyting algebras of level 1 satisfies the strongly blended $lor$-De Morgan law introduced in cite{Sa12}. Then, using this result and the results of cite{Sa12}, we prove our main result which gives an explicit description of simple algebras(=subdirectly irreducibles) ...

The aim of this paper is to introduce the notion of commutative pseudo BE-algebras and investigate their properties.We generalize some results proved by A. Walendziak for the case of commutative BE-algebras.We prove that the class of commutative pseudo BE-algebras is equivalent to the class of commutative pseudo BCK-algebras. Based on this result, all results holding for commutative pseudo BCK-...

Recently, an algorithm called Freqt was introduced which enumerates all frequent induced subtrees in an ordered data tree. We propose a new algorithm for mining unordered frequent induced subtrees. We show that the complexity of enumerating unordered trees is not higher than the complexity of enumerating ordered trees; a strategy for determining the frequency of unordered trees is introduced.

We consider the problem of enumerating triangulations of n points in the plane in general position. We introduce a tree of triangulations and present an algorithm for enumerating triangulations in O(log log n) time per triangulation. It improves the previous bound by almost linear factor.