324_Book

# 7 comparison of integer ring and boolean algebra the

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

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: he C bit-level operations, as will be discussed later. The Boolean operation ˜ corresponds to the logical operation N OT, denoted in propositional logic as . That is, we say that È is true when È is not true, and vice-versa. Correspondingly, ˜Ô equals 1 when Ô equals 0, and vice-versa. Boolean operation & corresponds to the logical operation A ND, denoted in propositional logic as . We say that È É holds when both È and É are true. Correspondingly, Ô & Õ equals 1 only when Ô ½ and Õ ½. Boolean operation | corresponds to the logical operation O R, denoted in propositional logic as . We say that È É holds when either È or É are true. Correspondingly, Ô | Õ equals 1 when either Ô ½ or Õ ½. Boolean operation ˆ corresponds to the logical operation E XCLUSIVE -O R , denoted in propositional logic as ¨. We say that È ¨ É holds when either È or É are true, but not both. 2.1. INFORMATION STORAGE Shared Properties Property Commutativity Associativity Distributivity Identities Annihilator Cancellation Unique to Rings Inverse Unique to Boolean Alg...
View Full Document

## This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.

Ask a homework question - tutors are online