本文選題：模糊邏輯　切入點(diǎn)：命題邏輯系統(tǒng)BL　出處：《山東大學(xué)學(xué)報(bào)(理學(xué)版)》2017年11期 　論文類型：期刊論文

【摘要】：在命題邏輯系統(tǒng)BL中提出了演繹系統(tǒng)的概念,并且給出了由F(S)的子集生成演繹系統(tǒng)的方法,證明了命題邏輯系統(tǒng)BL中演繹系統(tǒng)和結(jié)論之集的同一性;其次,在命題邏輯系統(tǒng)BL中證明了在包含偏序關(guān)系下所有演繹系統(tǒng)構(gòu)成的集族D(F)中上,下確界的存在性;最后,在D(F)中定義了二元運(yùn)算∧,∨,*,→,證明了集代數(shù)(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, 鈫，

本文編號(hào)：1567830