CMPUT272 Lecture Notes - Lecture 1: Royal Institute Of Technology, Brix, Injective Function
26 Jan 2016
School
Department
Course
Professor
Document Summary
A mathematical proof of a proposition is a sequence of logical deductions leading to the proposition from the axioms. Def: a boolean function is a function with domain (set of all n tuples of 0s and 1s) and codomain {0,1}, for e. g. n=3 (0,0,0); (0,0,1); (0,1,0); (0,1,1);(1,0,0);(1,0,1);(1,1,0);(1,1,1) A function from a set a to a set b in a rule for mapping each element of a to an element of b. e. g. f{1,2,3}->n x. Def: a boolean operation is an expression combing boolean variable, constants,~, , ,(,),0 and 1. To prove that two boolean expressions are equivalent (i. e. have some function) Using algebraic rules to show that the boo lean expression represent the same function. Every boolean function has a boolean expression using . Disjunction normal form: disjunction of boolean expressions, each of which is a conjunction of variables and negation of variables.
