• Title/Summary/Keyword: cs-algebra

Search Result 3, Processing Time 0.015 seconds

ON A CLOSED DEDUCTIVE SYSTEM OF A CS-ALGEBRA

  • Lee, Yong Hoon;Rhee, Min Surp
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.27 no.1
    • /
    • pp.57-64
    • /
    • 2014
  • It is known that the class of CI-algebras is a generalization of the class of BE-algebras [5]. Recently, K. H. Kim introduced the notion of a CS-algebra [4]. In this paper we discuss a closed deductive system of a CS-algebra, and we find some fundamental properties. Moreover, we study a CS-algebra homomorphism and a congruence relation.

A Homomorphism on Orthoimplication Algebras for Quantum Logic (양자논리를 위한 직교함의 대수에서의 준동형사상)

  • Yon, Yong-Ho
    • Journal of Convergence for Information Technology
    • /
    • v.7 no.3
    • /
    • pp.65-71
    • /
    • 2017
  • The quantum logic was introduced by G. Birkhoff and 1. von Neumann in order to study projections of a Hilbert space for a formulation of quantum mechanics, and Husimi proposed orthomodular law and orthomodular lattices to complement the quantum logic. Abott introduced orthoimplication algebras and its properties to investigate an implication of orthomodular lattice. The commuting relation is an important property on orthomodular lattice which is related with the distributive law and the modular law, etc. In this paper, we define a binary operation on orthoimplication algebra and the greatest lower bound by using this operation and research some properties of this operation. Also we define a homomorphism and characterize the commuting relation of orthoimplication algebra by the homomorphism.

On Multipliers of Lattice Implication Algebras for Hierarchical Convergence Models (계층적 융합모델을 위한 격자함의 대수의 멀티플라이어)

  • Kim, Kyoum-Sun;Jeong, Yoon-Su;Yon, Yong-Ho
    • Journal of Convergence for Information Technology
    • /
    • v.9 no.5
    • /
    • pp.7-13
    • /
    • 2019
  • Role-based access or attribute-based access control in cloud environment or big data environment need requires a suitable mathematical structure to represent a hierarchical model. This paper define the notion of multipliers and simple multipliers of lattice implication algebras that can implement a hierarchical model of role-based or attribute-based access control, and prove every multiplier is simple multiplier. Also we research the relationship between multipliers and homomorphisms of a lattice implication algebra L, and prove that the lattice [0, u] is isomorphic to a lattice $[u^{\prime},1]$ for each $u{\in}L$ and that L is isomorphic to $[u,1]{\times}[u^{\prime},1]$ as lattice implication algebras for each $u{\in}L$ satisfying $u{\vee}u^{\prime}=1$.