命题演算 meaning in English
calculus of proposition
propositional calculus
sentential calculus
statement calculus
Examples
- The medium logic propositional calculus system mpm and the medium logic predicate calculus system mfm are new logic systems . they are fit for dealing with incomplete information
中介逻辑命题演算系统mp ~ m和中介逻辑谓词演算系统mf ~ m是一种适用于处理不完全信息的新的逻辑系统。 - In 1996 , professor wang guojun built formal deductive system l * of fuzzy prepositional calculus , then in the frame of system l * , constructed the logical base for fuzfcy reasoning rules from sematics
王国俊教授于1996年建立了模糊命题演算的形式系统l ~ * ，之后在系统l ~ *的框架中，从语义上为模糊推理规则构建了逻辑基础。 - In this paper , a new type algebra is introduced , it is the algebraic abstract of mpm system just as boolean algebra is the algebraic abstract of 2 - valued propositional calculus . the main purpose of this paper is to investigate the various properties of the new algebra . in addition , this paper constructs an axiom set based on the medium logic propositional calculus system mpm , and gives a proof of its completeness
本文通过对mpm中介逻辑命题演算系统进行代数抽象,建立了一个新的代数系统,讨论了该代数系统的性质,并利用该代数系统的代数性质构造了中介命题演算系统mpm上的一个公理完备集合,使用该公理集合可以方便的推导出mpm上的等值和互推公式,这对于处理不完全信息数据库的查询优化有着重要作用。 - The medium logic propositional calculus system mpm and the medium logic predicate calculus system mfm is a new logic system modified from the existing medium logic system . this system is fit for dealing with incomplete information . it can act as the theory foundation for dealing with incomplete information
中介逻辑命题演算系统mpm和中介逻辑谓词演算系统mfm是在改造原有的中介逻辑系统的基础上提出的一种新的逻辑系统,该逻辑系统特别适用于处理不完全信息,可以作为处理不完全信息的理论基础。 - The second part builds a new algebra syetem rl , which in the definition of bl - algebra gets rid of the stronger condition and studies the properties of rl - algebra . in the same time , using rl - algebra as the true - value field this paper builds a more extentively formal deductive system of fuzzy prepositional calculus - - - - - - logic system rl . obtains a series of theorems , and studies the completeness of rl logic
第二部分：在以bl逻辑为背景的bl代数的定义中去掉限制性较强的条件a b = a ( a b ) ，建立了一种新的代数系统rl ，并进一步研究了rl代数类的性质；以rl代数为赋值域建立了一种更为广泛的模糊命题演算的形式系统? ?剩余格值逻辑系统rl ，得到了一系列定理，同时研究了逻辑系统rl的(弱)完备性