CLASSICALLOGICandFUZZYLOGIC.pptVIP

CLASSICAL LOGIC and FUZZY LOGIC CLASSICAL LOGIC In classical logic, a simple proposition P is a linguistic, or declarative, statement contained within a universe of elements, X, that can be identified as being a collection of elements in X that are strictly true or strictly false. The veracity (truth) of an element in the proposition P can be assigned a binary truth value, called T (P), For binary (Boolean) classical logic, T (P) is assigned a value of 1 (truth) or 0 (false). If U is the universe of all propositions, then T is a mapping of the elements, u, in these propositions (sets) to the binary quantities (0, 1), or T : u ∈ U ?→ (0, 1) CLASSICAL LOGIC Let P and Q be two simple propositions on the same universe of discourse that can be combined using the following five logical connectives Disjunction (∨) Conjunction (∧) Negation (?) Implication (→) Equivalence (?) CLASSICAL LOGIC define sets A and B from universe, where these sets might represent linguistic ideas or thoughts. A propositional calculus (sometimes called the algebra of propositions) will exist for the case where proposition P measures the truth of the statement that an element, x, from the universe X is contained in set A and the truth of the statement Q that this element, x, is contained in set B, or more conventionally, P : truth that x ∈ A Q : truth that x ∈ B where truth is measured in terms of the truth value, i.e., ?f x ∈ A, T (P) = 1; otherwise, T (P) = 0 ?f x ∈ B, T (Q) = 1; otherwise, T (Q) = 0 or, using the characteristic function to represent truth (1) and falsity (0), the following notation results: CLASSICAL LOGIC The five logical connectives already defined can be used to create compound propositions, where a compound proposition is defined as a logical proposition formed by logically connecting two or more simple propositions. CLASSICAL LOGIC Truth table for various compound propositions CLASSICAL LOGIC The implication P →Q can be represented in set-theoretic terms by th