摘要
利用McNaughton函数,研究了Lukasiewicz逻辑系统中的可达广义重言式,证明了当α为无理数时,没有可达α 重言式,进而给出了F(S)的一个分划.还证明了在Lukasiewicz逻辑系统中,重言式可由对非重言式进行有限次升级算法得到.
The accessible generalized tautologies in Lukasiewicz logic system are studied by means of McNaughton function. The main result is that when α is an irrational number, the set of accessible (α-tautology) is empty, consequently, a kind of partition on F(S) is given. In addition, the theorem that a tautology can be got by using upgrade algorithm to non-tautologies within finite times in Lukasiewicz logic system is proved.
出处
《陕西师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2004年第2期1-4,共4页
Journal of Shaanxi Normal University：Natural Science Edition
基金
国家自然科学基金重点资助项目(19831040)
