Research On Axiomatic Truth Degree Of K~*(?) Predicate Logic System

As one of the standard formal logic of axiom system,first-order logic contains quantization and fuzzy reasoning,which has important research values.Based on the definition and properties of axiomatic truth degree of first-order logic,the quantization of K^*（?） predicate logic system is studied in this dissertation.Firstly,the operation properties of axiomatic truth degree containing non,intersection operator and implication operators are analyzed,which provides conditions for calculating the truth degree containing quantifier （?） and （?） formulas.A calculating method of the truth degree of complex formulas conversion simple formulas are given.Secondly,starting from the definition and property of similarity between formulas in first-order logic system and combining with the K^*（?） predicate logic system.The similarity degree and differences between the axiomatic truth degree in first-order logic and the truth degree of proposition in the L^*propositional logic system is compared and analyzed in this paper.The difference of the truth degree of formulas,absolute truth degree,conditional random truth degree,random truth degree,Γ-deductive truth degree,R-truth degree and axiomatic truth degree in the L^*propositional logic system are pointed out.Finally,based on the axiomatic truth degree of formulas in first-order logic,starting from the similarity degree between formulas,combined with the axiomatic truth degree in K^*（?） predicate logic system.The calculation methods of similarity degree and pseudo-distance between formulas are discussed,and the calculation methods of similarity are simplified.The continuity of ρ_Rn pseudo-distance of four kinds of operators including （?）,→,∨ and ∧ in logic system of K^*（?） are proved.