浏览全部资源
扫码关注微信
(陕西师范大学数学与信息科学学院, ),陕西,西安,710062
Published:2010
移动端阅览
FONT face, Verdana, WU Hong-bo, et al. On the Finite Strong Completeness of NM321;[J]. Acta Electronica Sinica, 2010, 38(6): 1414-1418.
DOI:
FONT face, Verdana, WU Hong-bo, et al. On the Finite Strong Completeness of NM321;[J]. Acta Electronica Sinica, 2010, 38(6): 1414-1418. DOI:
<
FONT face=Verdana>对NM
321;系统(Nilpotent Minimum
321;ukasiewicz Logic)进行了研究,讨论了NM
321;系统的强完备性问题.首先对NM
321;-链的性质作了进一步的研究
证明了任一NM
321;-链都可部分嵌入到 中;其次
利用这一性质证明了NM
321;系统的有限强完备性定理;最后指出
在NM
321;系统中
关于无限理论的强完备性定理是不成立的.
FONT face=Verdana>Having researched further into the NM
321; system(Nilpotent Minimum
321;ukasiewicz Logic)
the strong completeness of NM
321; is discussed. Firstly
the properties of NM
321;-chain are studied and it is proved that each NM
321; -chain is partially embeddable into . Secondly
the finite strong completeness theorem of NM
321; is investigated by means of the partially embeddable property. Finally
it points out that NM
321; does not enjoy the strong completeness about infinite theory.
0
Views
961
下载量
4
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution