MAT 1348 Lecture Notes - Lecture 8: Disjunctive Normal Form, Restricted Representation, Logical Biconditional
11 Oct 2014
School
Department
Course
Professor
Document Summary
Truth trees: like truth tables, truth trees are used to determine all truth assignments of the propositional variables (atomic propositions) that make a compound proposition true. A proposition is called complex is it contains logical connectives other than negation: let p be a complex proposition whose truth value we wish to examine. P consists of atomic propositions p1, p2, . , pn (propositional variables) and logical connectives , , , , . The goal is to determine all truth values of the atomic propositions p1, p2, . From each leaf, there is a unique path to the root of the tree: the paths from a leaf to the root in a truth tree are of two kinds: An inactive path contains an atomic proposition together with its negation (e. g. pi and pi). An active path contains no contradictions; that is, no atomic proposition pi together with its negation pi.
