Lec02

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: gate) takes an input bit and produces the negation of that bit. —༉  The OR gate takes two input bits and produces the value equivalent to the disjunction of the two bits. —༉  The AND gate takes two input bits and produces the value equivalent to the conjunction of the two bits. —༉  More complicated digital circuits can be constructed by combining these basic circuits to produce the desired output. For example: Proposi$onal Equivalences —༉  Tautologies, Contradictions, and Contingencies. —༉  Logical Equivalence —༉  Important Logical Equivalences —༉  Showing Logical Equivalence —༉  Normal Forms —༉  Disjunctive Normal Form —༉  Conjunctive Normal Form —༉  Propositional Satisfiability Tautologies, Contradic$ons, and Con$ngencies —༉  A tautology is a proposition which is always true. —༉  Example: p ∨¬p —༉  A contradiction is a proposition which is always false. —༉  Example: p ∧¬p —༉  A contingency is a proposition which is neither a tautology nor a contradiction, such as p...
View Full Document

This document was uploaded on 02/27/2014 for the course CS 215 at SIU Carbondale.

Ask a homework question - tutors are online