• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.4
• /
• pp.401-409
• /
• 2007

This paper is sequel to [3]. In this paper, we discuss some properties of an algebraic meet-continuous lattice and study a complete lattice which can be embedded into an algebraic meet-continuous lattice.

• Journal of Applied and Pure Mathematics
• /
• v.5 no.1_2
• /
• pp.1-8
• /
• 2023

This study is on a Boolean B or Boolean lattice L in abstract algebra with closed binary operation *, complement and distributive properties. Both Binary operations and logic properties dominate this set. A lattice sheds light on binary operations and other algebraic structures. In particular, the construction of the elements of this L set from idempotent elements, our definition of k-order idempotent has led to the expanded definition of the definition of the lattice theory. In addition, a lattice offers clever solutions to vital problems in life with the concept of logic. The restriction on a lattice is clearly also limit such applications. The flexibility of logical theories adds even more vitality to practices. This is the main theme of the study. Therefore, the properties of the set elements resulting from the binary operation force the logic theory. According to the new definition given, some properties, lemmas and theorems of the lattice theory are examined. Examples of different situations are given.

• Korean Journal of Mathematics
• /
• v.26 no.3
• /
• pp.503-517
• /
• 2018

Keeping in view the expediency of soft sets in algebraic structures and as a mathematical approach to vagueness, in this paper the concept of lattice ordered soft near rings is introduced. Different properties of lattice ordered soft near rings by using some operations of soft sets are investigated. The concept of idealistic soft near rings with respect to lattice ordered soft near ring homomorphisms is deliberated.

• Journal of the Chungcheong Mathematical Society
• /
• v.20 no.3
• /
• pp.211-221
• /
• 2007

In this paper, we define ${\bigwedge}$-structure, ${\bigvee}$-structure to generalize some lattices, and study the conditions that a lattice which has ${\bigwedge}$-structure or ${\bigvee}$-structure to be continuous or algebraic.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.2
• /
• pp.201-208
• /
• 2014

Park et al. introduced the concept of generalized intuitionistic fuzzy soft sets, which can be seen as an effective mathematical tool to deal with uncertainties. In this paper, we introduce new operations such as restricted union and restricted intersection and study their basic properties, and deal with the algebraic structure of generalized intuitionistic fuzzy soft sets. The lattice structures of generalized intuitionistic fuzzy soft sets are constructed.

• Korean Journal of Mathematics
• /
• v.28 no.3
• /
• pp.439-447
• /
• 2020

Let M be a lattice module over a C-lattice L. Let Spec^s(M) be the collection of all second elements of M. In this paper, we consider a topology on Spec^s(M), called the second classical Zariski topology as a generalization of concepts in modules and investigate the interplay between the algebraic properties of a lattice module M and the topological properties of Spec^s(M). We investigate this topological space from the point of view of spectral spaces. We show that Spec^s(M) is always T₀-space and each finite irreducible closed subset of Spec^s(M) has a generic point.

• Proceedings of the Korea Database Society Conference
• /
• 2000.11a
• /
• pp.119-123
• /
• 2000

In this note, we study recent results concerning simplicity and spatiality of involutive quantales from the algebraic point of view. When S is a sup-lattice (with a duality), Q(S)$\times$Q( $S^{op}$ ) (Q(S)) is an involutive quantale. Using this, some characterizations of simplicity and spatiality of involutive quantales are investigated.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.531-536
• /
• 1998

It is well known that a Boolean algebra is one of the most important algebra for engineering. A fuzzy algebra, which is referred to also as a Kleen algebra, is obtained from a Boolean algebra by replacing the complementary law in the axioms of a Bloolean algebra with the Kleen's law, where the Kleen's law is a weaker condition than the complementary law. Removal of the Kleen's law from a Kleen algebra gives a De Morgan algebra. In this paper, we generate lattice structures of the above related algebraic systems having finite elements by using a computer. From the result, we could find out a hypothesis that the structure excepting for each element name between a Kleene algebra and a De Morgan algebra is the same from the lattice standpoint.

• Korean Journal of Logic
• /
• v.23 no.1
• /
• pp.1-23
• /
• 2020

This paper deals with mianorm-based logics with right and left n-potency axioms and their fixpointed involutive extensions. For this, first, right and left n-potent logic systems based on mianorms, their corresponding algebraic structures, and their algebraic completeness results are discussed. Next, completeness with respect to algebras whose lattice reduct is [0, 1], known as standard completeness, is established for these systems via Yang's construction in the style of Jenei-Montagna. Finally, further standard completeness results are introduced for their fixpointed involutive extensions.

• 한국논리학회:학술대회논문집
• /
• 2009.05a
• /
• pp.38-66
• /
• 2009

Weakening-free non-associative fuzzy logics, which are based on mica-norms, are introduced as non-associative substructural logics extending $GL_{e\bot}$ (Non-associative Full Lambek calculus with exchange and constants T, F) introduced by Galatos and Ono (cf. see [10, 11]). First, the mica-norm logic MICAL, which is intended to cope with the tautologies of left-continuous conjunctive mica-norms and their residua, and several axiomatic extensions of it are introduced as weakening-free non-associative fuzzy logics. The algebraic structures corresponding to the systems are then defined, and algebraic completeness results for them are provided. Next, standard completeness (i,e. completeness with respect to algebras whose lattice reduct is the real unit interval [0, 1]) is established for these logics by using Jenei and Montagna-style approach for proving standard completeness in [7, 18].