Deductive reasoning and computing based on propositional logic

Abstract

The satisfiability degree is a new means of describing the extent to which a proposition is satisfied, and employs deterministic logic rather than probabilistic logic or fuzzy logic. The independent formula-pair and the incompatible formula-pair of the propositions are discussed in this paper. Some properties of the satisfiability degree are given with a conditional satisfiability degree. Deductive reasoning methods based on the satisfiability degree are established. The formula reasoning and semantic checking are given by the conditional satisfiability degree. Some potential applications for the satisfiability degree are given.