The extensions L-n* of the formal system L* and their completeness
In this paper, the method of well-combined semantics and syntax proposed by Pavelka is applied to the research of the propositional calculus formal system L*. The part of constant values are taken as formulas, formulas are fuzzified in two manners: semantically and syntactically, and inferring processes are fuzzified. A sequence of new extensions {L-n(*)} of the system L* is proposed, and the completeness of L-n* is proved. (C) 2002 Elsevier Science Inc. All rights reserved.
extension completeness many-valued logic fuzzy logic propositional calculus system