Logic Flashcards
And
a conjunction, only when both statements are true can the compound statement be true
Arithmetic Shift Function
multiplications of bit patterns, which involves moving the bits in specific directions, either left or right, by a specific number of places
Boolean
can be either true or false, shortened to bool
Absorptive Law
allows a reduction in complicated expression to a simpler one by absorbing terms, e.g. A+(A.B)=A, A(A+B)=A
Annulment Law
a law that states and always equals 1/or always equals 0. A variable and 0 is always equal to 0 e.g. A.0=0, A+1=1
Associative Law
this is a biconditional equivalence as long as they all use conjunction and disjunction i.e. not a continuation, e.g. A+(B+C)=(A+B)+C=A+B+C, A(B.C)
Commutative Law
the order for conjunctions or disjunctions does not matter A.B=B.A, A+B=B+A
Complement Law
a term and’d with its complement equals 0/ a term or’d with its complement equals 1, e.g. A.NotA=0, A+NotA=1.
Distributive Law
a non-associate law i.e. the order of brackets matter, however the contents of the brackets are commutative -you can multiply out an expression e.g. A(B+C)=A.B+A.C, A+(B.C)=(A+B).(A+C)
Double Complement Law
the double complement of a variable is always equal to the variable
Idempotent Law
an input that is and’d or or’d with itself is equal to the input e.g. A+A=A, A.A=A
Identity Law
a law that states if a term is or’d with a 0 it will always be a 0/ if a term is and’d with a 1 it will always be a 1
Implication
a relationship between two statements
Most Significant Bit
used to display a range of either positive or negative numbers, where 0 is positive and 1 is negative
Negation
a unary argument, ie is not
