基于BL系统的演绎系统集代数的剩余格属性

发布时间：2018-03-04 23:35

  本文选题：模糊逻辑　切入点：命题逻辑系统BL　出处：《山东大学学报(理学版)》2017年11期 　论文类型：期刊论文

【摘要】：在命题逻辑系统BL中提出了演绎系统的概念,并且给出了由F(S)的子集生成演绎系统的方法,证明了命题逻辑系统BL中演绎系统和结论之集的同一性;其次,在命题逻辑系统BL中证明了在包含偏序关系下所有演绎系统构成的集族D(F)中上,下确界的存在性;最后,在D(F)中定义了二元运算∧,∨,*,→,证明了集代数(D(F),∧,∨,*,→,0,1)是满足可除性的完备剩余格。
[Abstract]:In the propositional logic system BL, the concept of deductive system is put forward, and the method of generating deductive system from the subset of FSs is given. The identity of deductive system and conclusion set in propositional logic system BL is proved. In the propositional logic system BL, we prove the existence of upper and lower bounds in a family of deductive systems consisting of all deductive systems with partial order relations. 鈫扞n this paper, we prove that the set algebras are set algebras, 鈫，

本文编号：1567830