some operations on lattice implication algebras一些格蕴涵代数上的操作.pdf

IJMMS 27:1 (2001) 45–52 PII. S0161171201006214 © Hindawi Publishing Corp. SOME OPERATIONS ON LATTICE IMPLICATION ALGEBRAS E. H. ROH, S. Y. KIM, Y. XU, and Y. B. JUN (Received 16 November 2000) Abstract. We introduce the concept of a ⊗-closed set and a ⊗-homomorphism in lattice implication algebras, and we discuss some of their properties. Next, we introduce the fuzzy implicative filter and obtain equivalent conditions. Finally, we discuss the operation ⊗, fuzzy filters, and fuzzy implicative filters. 2000 Mathematics Subject Classification. 03G10, 06B10, 94D05. 1. Introduction. In order to research the logical system whose propositional value is given in a lattice from the semantic viewpoint, Xu [3] proposed the concept of lat- tice implication algebras, and discussed some of their properties in [3, 4]. Xu and Qin [5] introduced the notion of filters in a lattice implication algebra, and investigated their properties. In [8], Xu and Qin defined the fuzzy filter in a lattice implication al- gebra, and they discussed some of their properties. Recently, Xu et al. [9] defined a congruence relation on lattice implication algebras induced by fuzzy filters and they proved the fuzzy homomorphism fundamental theorem, and Liu and Xu [ 1] intro- duced the notion of the new binary operation ⊗ on lattice implication algebras and they investigated their properties. 2. Preliminaries. We recall a few definitions and properties. Definition 2.1 (see [4]). By a lattice implication algebra we mean a bounded lattice (L, ∨, ∧,0, 1) with order-reversing involution “” and a binary operation “→” satisfying the following axioms: (I1) x → (y → z) = y → (x → z), (I2) x → x = 1, (I3) x → y = y → x , (I4) x → y = y → x = 1 ⇒ x = y, (I5) (x → y) → y = (y → x) → x,