Subtraction of soft matrices

In this paper, we introduce subtraction operation notation on the soft matrix of size m×n with its entry on the set {0, 1}. In addition, we studied the characteristics of subtraction operations over intersection and union operations on soft matrices. The result shows the distributive law of subtraction operations over intersection and union operations on the soft matrix. Finally, we discuss the characteristics of De Morgan’s law analogous to set theory.

Rough Approximation Operators on a Complete Orthomodular Lattice

This paper studies rough approximation via join and meet on a complete orthomodular lattice. Different from Boolean algebra, the distributive law of join over meet does not hold in orthomodular lattices. Some properties of rough approximation rely on the distributive law. Furthermore, we study the relationship among the distributive law, rough approximation and orthomodular lattice-valued relation.

L -Fuzzy Prime Spectrums of ADLs

The notion of an Almost Distributive Lattice (ADL) is a common abstraction of several lattice theoretic and ring theoretic generalizations of Boolean algebra and Boolean rings. In this paper, the set of all L -fuzzy prime ideals of an ADL with truth values in a complete lattice L satisfying the infinite meet distributive law is topologized and the resulting space is discussed.

L-Fuzzy Congruences and L-Fuzzy Kernel Ideals in Ockham Algebras

In this paper, we study fuzzy congruence relations and kernel fuzzy ideals of an Ockham algebra A , f , whose truth values are in a complete lattice satisfying the infinite meet distributive law. Some equivalent conditions are derived for a fuzzy ideal of an Ockham algebra A to become a fuzzy kernel ideal. We also obtain the smallest (respectively, the largest) fuzzy congruence on A having a given fuzzy ideal as its kernel.

From Boolean Valued Analysis to Quantum Set Theory: Mathematical Worldview of Gaisi Takeuti

Gaisi Takeuti introduced Boolean valued analysis around 1974 to provide systematic applications of the Boolean valued models of set theory to analysis. Later, his methods were further developed by his followers, leading to solving several open problems in analysis and algebra. Using the methods of Boolean valued analysis, he further stepped forward to construct set theory that is based on quantum logic, as the first step to construct "quantum mathematics", a mathematics based on quantum logic. While it is known that the distributive law does not apply to quantum logic, and the equality axiom turns out not to hold in quantum set theory, he showed that the real numbers in quantum set theory are in one-to-one correspondence with the self-adjoint operators on a Hilbert space, or equivalently the physical quantities of the corresponding quantum system. As quantum logic is intrinsic and empirical, the results of the quantum set theory can be experimentally verified by quantum mechanics. In this paper, we analyze Takeuti’s mathematical world view underlying his program from two perspectives: set theoretical foundations of modern mathematics and extending the notion of sets to multi-valued logic. We outlook the present status of his program, and envisage the further development of the program, by which we would be able to take a huge step forward toward unraveling the mysteries of quantum mechanics that have persisted for many years.

Triangular Scheme Revisited in the Light of n-permutable Categories

The first diagrammatic scheme was developed by H.P. Gumm under the name Shifting Lemma in case to characterize congruence modularity. A diagrammatic scheme is developed for the generalized semi distributive law in Mal'tsev categories. In this paper we study this diagrammatic scheme in the context of $n$-permutable, and of Mal'tsev categories in particular. Several remarks concerning the Triangular scheme case are included.

Combining Semilattices and Semimodules

We describe the canonical weak distributive law $$\delta :\mathcal S\mathcal P\rightarrow \mathcal P\mathcal S$$ δ : S P → P S of the powerset monad $$\mathcal P$$ P over the S-left-semimodule monad $$\mathcal S$$ S , for a class of semirings S. We show that the composition of $$\mathcal P$$ P with $$\mathcal S$$ S by means of such $$\delta $$ δ yields almost the monad of convex subsets previously introduced by Jacobs: the only difference consists in the absence in Jacobs’s monad of the empty convex set. We provide a handy characterisation of the canonical weak lifting of $$\mathcal P$$ P to $$\mathbb {EM}(\mathcal S)$$ EM ( S ) as well as an algebraic theory for the resulting composed monad. Finally, we restrict the composed monad to finitely generated convex subsets and we show that it is presented by an algebraic theory combining semimodules and semilattices with bottom, which are the algebras for the finite powerset monad $$\mathcal P_f$$ P f .

Developing Cognitive Conflict to Overcome Students’ Thinking Difficulties

The purpose of this study is to describe the thinking difficulties of low-ability students. Low-ability students are those who can only reach score less than 66. The second objective is to know the effectiveness of cognitive conflict strategies in an effort to improve failed cognitive networks. The approach taken is qualitative with the type of classroom action research. In each action, it was applied the group learning strategy in the first session intended to explore additional thinking difficulties. In the second session their difficulties were overcome by implementing a cognitive conflict strategy. This research was completed in two actions based on the amount of material that consists of two parts. The research’s conclusions describe the basic difficulties of students’ thinking but are not summarized here. In this error, mostly students make their own formulas using distributive law on algebra. Another conclusion is that cognitive conflict strategies are effective at the level of 88.6% in overcoming thinking difficulties.