CMPSC 40 Lecture Notes - Lecture 3: Universal Quantification, Existential Quantification, Satisfiability
Document Summary
From we can form new conditional statements is the converse: is the contrapositive, is the inverse. Electronic circuits = each input/output signal viewed as a 0 or 1. Complicated circuits are constructed from three basic circuits called cates. Takes input bit and produces the negation of that bit. Takes two input bits and produces the value equivalent to the disjunction of the two bits. Takes two input bits and produces the value equivalent to the conjunction of the two bits. Bit = binary digit (0 or 1) (1,0) (true,false) Bit string (i. e. char, int, float, double) = collection of bits. Computers implement efficient bitwise operations on 1+ bitstrings. Tautology = a proposition that is always true. Contradiction = a proposition that is always false. Contingency = a proposition that is neither a tautology nor a contradiction. Truth table column has both ts and fs.
