This paper is the second of a two part series. In this Part, we prove, using the description of simples obtained in Part I, that the variety $mathbf{RDQDStSH_1}$ of regular dually quasi-De Morgan Stone semi-Heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{RDQDStSH_1}$-chains and the variety of dually quasi-De Morgan Boolean semi-Heyting algebras--...

class Element { attribute string name; attribute int position; abstract boolean isConnectedTo(Element n); string changeNameTo(string s); };boolean isConnectedTo(Element n); string changeNameTo(string s); }; abstract class Node extends Element {class Node extends Element { attribute set incomingLinks; attribute set outgoingLinks; boolean addIncomingLink(Link k); }; class ANode extend...

We follow throughout a heterogeneous approach to present some characterizations (Theorem 3.5 and Theorem 3.35) of subdirectly irreducible bijective Boolean modules. The notions of essential element (as modular element) and [1]-closed element (as Boolean element) were implemented to this class of algebras. Our final aim of reaching the class of simple bijective Boolean modules, as a particular c...

this paper is the second of a two part series. in this part, we prove, using the description of simples obtained in part i, that the variety $mathbf{rdqdstsh_1}$ of regular dually quasi-de morgan stone semi-heyting algebras of level 1 is the join of the variety generated by the twenty 3-element $mathbf{rdqdstsh_1}$-chains and the variety of dually quasi-de morgan boolean semi-heyting algebras--...

class Element { public abstract boolean Greater (Element e); public abstract boolean Equal (Element e); } Listing 3.2 Class Element Method Greater returns, weather the object Element, who calls this method, is greater then its parameter. Method Equal returns, if the object, who call this method, and parameter have the same values.

class Element { abstract boolean gleich (Element zuvergleichen); static int id = 0; int Id; Element () { Id = id++; } } Prog. 7–6 Die abstrakte Klasse Element Lehrbuch der Programmierung mit Java, Echtle Goedicke, Heidelberg, © dpunkt 2000

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) ...

We introduce a new Boolean computing element related to the Linear Threshold element, which is the Boolean version of the neuron. Instead of the sign function, it computes an arbitrary (with polynornialy many transitions) Boolean function of the weighted sum of its inputs. We call the new computing element an LT M element, which stands for Linear Threshold with Multiple transitions. The paper c...