7.3 FIRST INVERSE ANTECEDENT BAF(BAF) OPERATION

Size: px
Start display at page:

Download "7.3 FIRST INVERSE ANTECEDENT BAF(BAF) OPERATION"

Transcription

1 7.3 FIRST INVERSE ANTECEDENT BAFBAF OPERATION The inverse of the problem of the Direct BAFBAF Operation of the precedent Sections, could be also considered as a problem of Boolean Equations. Thus, if we consider the Direct BAFBAF Operation in the classical form, A q B p = C p x r x r x q, where the second member represents the result, it is possible to define two Inverse Operations, because the corresponding Direct BAFBAF Operation, as a Logical Implication, does not have the mathematical commutative property of the given terms. Then, in this First Inverse Antecedent BAFBAF Operation, the given data are the corresponding Result C6 rx System, A 6 px q q and the Consequent System B6 rx p. The Antecedent, is the Incognito System of this Inverse Operation. 05

2 In terms of Boolean Geometry language, we have Fig. 9: LJ In terms of Boolean Algebra language, we have the following literal expressions: Given the following two systems, C6 rx q C Z = F X, X,..., X q Z = F X, X,..., X q... Z r = F r X, X,..., X q of Boolean Functions, A logical equalities: and B and B6 rx p, in a given order, Z = G,,..., p Z = G,,..., p, determine a third System... Z r = G r,,..., p = f X, X,..., X q = f X, X,..., X q, in such way as to have the following... p = f p X, X,..., X q G f X, X,..., Xq, f X, X,..., Xq,..., fp X, X,..., Xq = F X, X,..., Xq G f X, X,..., Xq, f X, X,..., Xq,..., fp X, X,..., Xq = F X, X,..., Xq... Gr f3x, X,..., Xq 8, f3x, X,..., Xq8,..., fp3x, X,..., Xq8 = Fr 3X, X,..., Xq In order to solve this First Inverse Antecedent BAFBAF Operation, it will be determined previously the Inverse Analytical System of the given Consequent System 6 B rx p, that is, we determine system B 4 9. Thus, we reduce this problem to the q px solution of the following equivalent Direct BAFBAF Operation: 06

3 6 6 C rx q B px r = A px q To solve the operation given by 6, we can apply the practical gadget of the TABLES of the correspondent Discreet Function of Discreet Functions of the ordinary Algebra, using the given numerical compact representation. 6 th EXAMPLE: Given the systems of BAFs: = B = NT Z [ 03 3].{ 3 ; 3} x Z and C = NT Z = [ 0 3].{ ; XX }, determine the following system of BAF, x Z 646 A 3 = NT [ 3 a a a 0 ] 3.{ ; } x a X X =, so that we have: A 3 B 3 = C x x x. NOTE: This example corresponds to the First Inverse Antecedent BAFBAF Operation referring to the st EXAMPLE considered in Section 7.. In terms of Boolean Geometry language, we have Fig. 0: LJ It is opportune to remember that the Systems of BAFs, in the compact and vertical notation, could be also the numerical representative of the TABLES of the practical gadget. This practical gadget corresponds to the Discreet Function of Discreet Function of ordinary Algebra. 07

4 Then, it will be: 66 yx zy = z[yx] = zx, where: 67 yx = NT - { A 3x }, is the antecedent function; 68 zy = NT - { B x 3 }, is the consequent function and 69 z[yx] = zx = NT - { C x }, it is the result of the operation of the indicated functions. Then, in the definition of the First Inverse Antecedent BAFBAF Operation, the anti-numerical Transform of the Inverse Analytical System of the given Consequent System, will correspond to the inverse analytical of the respective consequent function, that is: 70 NT - { [ B x 3 ] - } = NT - { B 3x } = yz Therefore, the anti-numerical Transform of expression 6 will be: = 7 NT C rx q NT B px r NT A px q, where we have, in reference to the Discreet Functions of the Classical Mathematics, the following: NT C rx q = zx; NT B px r = yz and NT A px q = yx, that is, zx yz = yx In this example, expression 7 becomes: = 73 NT C NT B NT A x 3x 3 x Therefore, firstly we must determine the Inverse Analytical System of the given Consequent System through the following TABLE: 08

5 zy yz B x 3 B 3x b k b k SOLUTIONS: 7 3 4;0 sols. Nr. of solutions. 6 6;3; 3 sols. =x3xx= 5 0 7; sols. full solutions sol Therefore, we have: 74 B B NT ;. ; ZZ x x 3! $ = = = 6;3; 7; 5 x3xx = full solutions = B Then, we apply the practical gadget of TABLES of the correspondent Discreet Function of Discreet Function of the ordinary Algebra, we have: 75 C B A x 3x = 3 x NOTE: It is important to observe that it is an Inverse Operation, where the respective Direct Operation does not have the mathematical commutative property of the given terms. Therefore, this Inverse Operation is not UNIQUE. Then, there are several solutions that will be the same, which was considered in the st EXAMPLE of the First Inverse Antecedent BAFBAF Operation of Section 7.. Therefore, we have: GIVEN DATA RESULTS C x B 3 x A 3 x c k b k a k ; ;3; 6;3; 7; 7; ;0 09

6 This problem offers a result of x3xx = solutions, that is, the numerical vertical compact representation of the systems of BAF are the following, 76 A 3 x = NT 5 =! X X 3. ; 6 < A = form, 77 A63 x = NT = X XB ; 3! $ $ 6 6 3, or, as binary Boolean Matrix x3xx = full solutions In that global numerical expression of all those full solutions i.e. without any time-restriction, the abscissa component marked with corresponds to the solution that is the same, as it was considered in the st EXAMPLE of the First Inverse Antecedent BAFBAF Operation of the Section 7., that is, the numerical expression 4: A NT [ 6 4].{ ; XX } 3 x = 5 3 = 3 7 th EXAMPLE: Given the systems of BAFs: Z Z 78 B NT Z [ ].{ ; } 5 x 3 = =, and Z4 Z 5 0

7 Z Z 79 C NT Z [ ].{ ; XX } 5 x = 3 5 = 5 5 9, determine the following system of Z4 Z 5 BAF, 80 A NT [ a a a a 0 ].{ ; X X } 3 x = 3 3 =, so that we have: 3 8 A B C 3 x 5 x 3 = 5 x NOTE: This example corresponds to the Second Inverse Antecedent BAFBAF Operation referring to the nd EXAMPLE considered in Section 7.. In terms of Boolean Geometry language, we have the following Fig. : LJ It is opportune to remember that the Systems of BAFs, in the compact and vertical notation, could be also the numerical representative of the TABLES of the practical gadget. This practical gadget corresponds to the Discreet Function of Discreet Function of ordinary Algebra. Then, it will be: 8 yx zy = z[yx] = zx, where: 83 yx = NT - { A 3x }, it is the antecedent function; 84 zy = NT - { B x 3 }, it is the consequent function and 85 z[yx] = zx = NT - { C x }, it is the result of the operation of the indicated functions.

8 Then, in the definition of the First Inverse Antecedent BAFBAF Operation, the anti-numerical Transform of the Inverse Analytical System of the given Consequent System, will correspond to the inverse analytical of the respective consequent function, that is: 86 NT - { [ B x 3 ] - } = NT - { B 3x } = yz Therefore as we have seen, the anti-numerical Transform of expression 6 will be: = NT C rx q NT B px r NT A px q, where we have, in reference to the Discreet Functions of the Classical Mathematics, the following: NT C rx q = zx; NT B px r = yz and NT A px q = yx, that is, zx yz = yx In this example, that expression becomes: = NT C NT B NT A x 3x 3 x Therefore, firstly we must determine the Inverse Analytical System of the given Consequent System, through the following TABLE:

9 zy yz B 5x 3 B 3x 5 Col. k b k b k SOLUTIONS: {i 5 } {i 5 } one solution {i 5 } {i 5 } 5 6 {i 5 } 5 one solution 0 4 {i 5 } 3 {i 5 } {i 5 } {i 5 } 0 {i 5 } 9 {i 5 } 8 5 one solution 7 {i 5 } 6 {i 5 } 5 6;7 two solutions 4 {i 5 } 3 {i 5 } {i 5 } ;0 two solutions 0 {i 5 } 09 {i 5 } 08 {i 5 } 07 {i 5 } 06 {i 5 } 05 {i 5 } 04 {i 5 } 03 {i 5 } 0 {i 5 } 0 4 one solution 00 {i 5 } NOTE: The symbol {i 5 } means that, either we have a time-restriction at the indicated epoch or we have what corresponds to the Complementary System 0 5 x 5 referred as their own variables. 3

10 Z Z that is: {i 5 } = = ; 0 = 5 5 NT Z ZZ ZZ x 3 4Z5 Z4 Z 5 Therefore, we have: = B B = NT = i i i i i i i. ; Z Z Z Z Z 3 x ;7 53 ; ! $ 3 3 x = 4 restricted solutions 4 = B Then, we apply the practical gadget of TABLES of the correspondent Discreet Function of Discreet Function of the ordinary Algebra, we have: 87 C B A 5x 3x 5 = 3 x NOTE: It is important to observe that it is an Inverse Operation, where the respective Direct Operation does not have the mathematical commutative property of the given terms. Therefore, this Inverse Operation is not UNIQUE. Then, there are several solutions and one of them will be the same which as the one considered in the nd EXAMPLE of the First Inverse Antecedent BAFBAF Operation of Section 7.. Therefore, we have: 4

11 GIVEN DATA Result C 5 x B 3 x 5 A 3 x c k b k a k 3 3 to 30 {i 5 } 3 0; ;7 5 8 to 6 {i 5 } 6; to 9 {i 5 } to 6 {i 5 } 5 6;7 4 to {i 5 } ;0 0 to {i 5 } 4 0 {i 5 } This problem offers a result of xxx = 8 solutions, that is, the numerical vertical compact representation of the systems of BAF is the following, A 3 x = NT = 3! 3 6 = B $ 00 form, 89 A NT 3 x = = X X 3. ; = ; XX B 0 0! $ xxx = 8 full solutions, or, as binary Boolean Matrix In that global numerical expression of all those 8 full solutions i.e. without any time-restriction, the abscissa component marked with corresponds to the solution that is the same, as it was considered in the nd EXAMPLE of the First Inverse Antecedent BAFBAF Operation of the Section 7., that is, the numerical expression: A NT [ 6 7 3].{ ; XX } 3 x = 3 = 3 5

12 8 th EXAMPLE: Given the systems of BAFs: Z 90 B NT Z x 5 = = Z 3 and 3.{ 5 ; XXX3}, 9 C = 3 x 3 NT Z Z = Z 3 XX X 5. = 3; 3 B, determine the following system of BAF, 9 A NT [ a a... a ].{ ; X X X } 3 x = = 3, so that we have: 93 C 3 x 3 = A x 3 B 3 x 5 NOTE: This example corresponds to the First Inverse Antecedent BAFBAF Operation referring to the 3 rd EXAMPLE considered in Section 7.. In terms of Boolean Geometry language, we have the following Fig. : LJ It is opportune to remember that the Systems of BAFs, in the compact and vertical notation, could be also the numerical representative of the TABLES of the practical gadget. This practical gadget corresponds to the Discreet Function of Discreet Function of ordinary Algebra. Then, it will be: 94 yx zy = z[yx] = zx, where: 6

13 95 yx = NT - { A x 3 }, is the antecedent function; 96 zy = NT - { B 3 x 5 }, is the consequent function and 97 z[yx] = zx = NT - { C 3 x 3 }, is the result of the operation of the indicated functions. Then, in the definition of the First Inverse Antecedent BAFBAF Operation, the anti-numerical Transform of the Inverse Analytical System of the given Consequent System will correspond to the inverse analytical of the respective consequent function, that is: 98 NT - { [ B 3 x 5 ]- } = NT - { B 5 x 3 } = yz Therefore as we have seen, the anti-numerical Transform of expression 6 will be: = NT C rx q NT B px r NT A px q, where we have, referring to the Discreet Functions of the Classical Mathematics, the following: NT C rx q = zx; NT B px r = yz and NT A px q = yx, that is, zx yz = yx In this example, that expression becomes: NT C NT B = NT A 3 x 3 5 x 3 5 x 3, Therefore, firstly we must determine the Inverse Analytical System of the given Consequent System, through the following TABLE: 7

14 zy yz B 3 x 5 B 5 x 3 Col. k b k b k Therefore, it will be: 8

15 B 5x = NT X X X3 = [ ]. 3; ZZZ 3 5 Then, we have: GIVEN DATA C 3 x 3 B 5x 3 A c k b k RESULT 5 x 3 a k This problem offers a result of 4 8 = 6 = 65,536 full solutions, that is, the numerical vertical compact representation of the systems of BAF are the following, A [ 5 3 = NT X = x X X ]. 3; XX X3 5 < A also with 4 8 = full solutions But, this numerical expression 99 shows that the final solution is conditioned by the existence of the following Complementary System relative to the input variables {X X X 3 } of the Antecedent System: 9

16 X 00 NT X = [ ] 3.{3; X X X 3 } X 3 0 NT X X X3 =! XX X $.{ ; } Then, to verify this condition within the 4 8 = full solutions above, expression 99 can be written in the following classical binary Boolean representation given by expression 0: A = NT X =. 3; XX X x 3 X X ! $ 06 < A following: 036 The full solutions that satisfy those conditions are marked by and are the A 5 3 = NT ; x X XX X3 = X X ! $ = [ ] 5.{3;X X X 3 } or, x = 4 full solutions to the example = B In the numerical expression of these four solutions, the set of BAVs, {X, X, X 3 }, appears in both sides of the numerical expression give by 03 and then, it can be deleted. Therefore, we have: = 0

17 A NT = = = 3; XX X 3 B x! $ 05 A NT. ; XX X x = = 3 3! $ = B NOTE: The solution marked by in the above expression, that is, the following numerical expression, 05A A 3 NT x 3 = =. ; XX X 3! $ 6 = B the same numerical expression, as the data given in the 3 rd EXAMPLE., or, corresponds to 9 th EXAMPLE: Given the systems of BAFs: 066 B x 3 = NT Z { 3 ; X3X4}, Z = and 07 C = x 4 NT following system of BAF, Z = Z 08 A NT [ a a a a ].{ ; X X } x = = 3 0, so that we have: 09 C x 4 = A 3 x 4 B x 3. 4 = ; XX XX 3 4B, determine the NOTE: This example corresponds to the First Inverse Antecedent BAFBAF Operation relative to the 4 th EXAMPLE considered in Section 7.. In terms of Boolean Geometry language, we have the following Fig. 3:

18 LJ It is opportune to remember that the Systems of BAFs, in the compact and vertical notation, could be also the numerical representative of the TABLES of the practical gadget. This practical gadget corresponds to the Discreet Function of Discreet Function of the ordinary Algebra. Then, it will be: 0 yx zy = z[yx] = zx, where: yx = NT - { A }, is the antecedent function; x zy = NT - { B }, is the consequent function and x 3 3 z[yx] = zx = NT - { C }, is the result of the operation of the indicated x 4 functions. Then, in the definition of the First Inverse Antecedent BAFBAF Operation, the anti-numerical Transform of the Inverse Analytical System of the given Consequent System will correspond to the inverse analytical of the respective consequent function, that is: 4 NT - { [ B x 3 ]- } = NT - { B 3x } = yz Therefore as we have seen, the anti-numerical Transform of expression 6 will be: = NT C rx q NT B px r NT A px q, where we have, referring to the Discreet Functions of the Classical Mathematics, the following:

19 NT C rx q = zx; NT B px r = yz and NT A px q = yx, that is, zx yz = yx In this example, that expression becomes: 6 NT C NT B = NT A x 4 3 x 3 x 4, Therefore, firstly we must determine the Inverse Analytical System of the given Consequent System, that is: zy yz B x 3 B 3x col. b k b k Therefore, it will be: 7 B = NT X =. ; ZZ 3x = B X! $ 4 3 Then, we have: 3

20 C x 4 GIVEN DATA c k RESULTS B 3x A 3x This problem offers a result of 57,464 full solutions, that is, the numerical vertical compact representation of the systems of BAF is the following, b k a k [ A = NT X = x X ]. ; 3 4 XX XX 3 4 < A number of full solutions: 3 x x x x 3 x 3 x x x 3 x 3 x x x 3 x x x = = 57,464 But, this numerical expression 8 shows that the final solution is conditioned by the existence of the following Complementary System relative to the input variables VAB s {X 3, X 4 } of the Antecedent System, is projected in the same BAFi: x = NT X ; XX XX 3 4@ X =! $. ; or, in compact vertical numerical expression: 4

21 0 0 x or, 6 4 = NT = x X 3 X4 6 4 NT 30 X 3 X4 = =! $. 4 ; XX XX 3 4, 5. 4 ; XXXX 3 4, Then, to verify this condition within the 57,464 full solutions above, expression 8 can be written in the following classical binary Boolean representation given by expression : A 3 4 = NT X x 3 X =! ;XXX3X $ 3 Therefore, these marked full solutions are the following: A 3 4 = NT X x 3 X4 =! 0 = B $ with 8 = 56, or, in vertical compact form: 4 =! A 3 4 = NT X x 3 X = 4;XXX3X4B $ 4 0 = B. 4; XX 3 XX

22 also, with 8 = 56 full solutions In the numerical expression of these solutions, the set of BAVs, {X 3, X 4 }, appears in both sides of the numerical expression 3 and then, it can be deleted. Therefore, we have: 5 = =! A NT x $ = B. 4; XX XX From these = 56 above solutions represented, only the one is marked by is independent from BAVs {X 3, X 4 }, if we apply the properties of permutation from the ordinality ω 4 = { XX XX 3 4} to the ordinality ω 4 = { X 3 X 4 X X } of the new Boolean Arithmetical Field BAFi. In fact, we have: A NT. x 4 = = ! $. < 4; X4XXX3A= ! $. < 4; X3X4XXA Therefore, we have: { 3 4 } 4 [ ] { 3 4 } {} A = [ ]. 4; X X X X = 00. 4; X X X X = TN x Simplifying this last numerical expression, we have: 6 ;@ 6 A = [ 00] X X NT x. ; = unique solution It means that this unique solution obtained above 6 corresponds to the same numerical expression, as the data given in the 4 th EXAMPLE. 0 th EXAMPLE: The systems of BAFs are given: 6

23 7 Z B NT Z. 3 x 5 = Z 3 = {; 5 XXX3X4}, and 8 C = 3 x 4 NT the following system of BAF, ;@ Z Z = = 4 ; XX XX 3 4B, determine Z 3 9 A NT [ a a a a ].{ ; X X } x = = 3 0, so that we have: 30 C 3 x 4 = A 5 x 4 B 3 x 5 NOTE: This example corresponds to the First Inverse Antecedent BAFBAF Operation relative to the 5 th EXAMPLE considered in Section 7.. In terms of Boolean Geometry language, we have the following Fig. 4: LJ It is opportune to remember that the Systems of BAFs, in the compact and vertical notation, could be also the numerical representative of the TABLES of the practical gadget. This practical gadget corresponds to the Discreet Function of Discreet Function of ordinary Algebra. 7

24 Then, it will be: 3 yx zy = z[yx] = zx, where: 3 yx = NT - { A }, is the antecedent function; x 33 zy = NT - { B }, is the consequent function and 3x 5 34 z[yx] = zx = NT - { C 3x 4 }, is the result of the operation of the indicated functions. Then, in the definition of the First Inverse Antecedent BAFBAF Operation, the anti-numerical Transform of the Inverse Analytical System of the given Consequent System, will correspond to the inverse analytical of the respective consequent function, that is: 35 NT - { [ B 3x 5 ]- } = NT - { B 5x 3 } = yz Therefore as we have seen, the anti-numerical Transform of expression 6 will be: = 36 NT C rx q NT B px r NT A px q, where we have, respectively to the Discreet Functions of the Classical Mathematics, the following: NT C rx q = zx; NT B px r = yz and NT A px q = yx, that is, zx yz = yx In this example, that expression becomes: 37 = 6 B 4 9 = NT C 4 3x NT B NT A 5x 5x 3 4 Therefore, firstly we must determine the Inverse Analytical System of the given Consequent System, that is: 8

25 zy yz B 3x 5 B 5x 3 b k b k Therefore, it will be: X B = NT X = 5 x ! X 3 X ; ZZ Z 5 3 < 3A $ 9

26 X B = TN X = x X 3 X { ; ZZZ} Then, we have: Col. k C 3x 4 c k GIVEN DATA RESULTS B 5 x 3 A 5 x b k a k This problem offers a result of 4 6 = full solutions, that is, the numerical vertical compact representation of the systems of BAF is the following, 30

27 X A = NT X = [ x X3 X ] 5.. 4; XX XX 3 4 But, this numerical expression 38 shows that the final solution is conditioned by the existence of the following Complementary System relative to the input variables VAB s { X, X, X 3, X 4 } of the Antecedent System, projected in the same BAFi: X X x 4 = NT ; 4 XX XX 3 4@ =. ; X X 4! $ or, in compact vertical form: X X x 4 = NT =. ; XXXX 3 4 X X 4 6 Inside these full solutions, there is only one marked by, which satisfies the condition of the existence of that Complementary System, relative to the input variables VAB s { X, X, X 3, X 4 } of the Antecedent System, that is: 4 A 5 x 4 = NT X X X3 X = ! ;XXX3X $ < A Then, the unique solution is: 3

28 5x A = { ; X X X X } In this numerical expression 4, by the properties given in Chapter 4, it is possible to cancel the Complementary System in both members of the given expression 39. Then, we have: 43 A6 x < XX XX A NT 4 = ; 3 4 = unique solution Therefore, applying the properties of permutation of the ordinality to ω = 4 { X X X X 3 4 } of the Boolean Arithmetical Field BAFi, we have: 44 6 < A A NT X X X X x 4 = = ; 4 3 = = ; X3X4XX = 006 < A! $. 4; X3X4XX < A Simplifying this last numerical expression, we have: 45 A = 00 { X X } = TN{} [ ]. ; unique solution x It means that this unique numerical solution obtained above 45, corresponds to the same numerical expression, as the data given in the 5 th EXAMPLE. = 3

DWMJL. i Mrs. Rouse carried a small in- Board of T r a d e to adopt or s p o n - of Hastings.

DWMJL. i Mrs. Rouse carried a small in- Board of T r a d e to adopt or s p o n - of Hastings. XXX Y Y 9 3 Q - % Y < < < - Q 6 3 3 3 Y Y 7 - - - - - - Y 93 ; - ; z ; x - 77 ; q ; - 76 3; - x - 37 - - x - - - - - q - - - x - - - q - - ) - - Y - ; ] x x x - z q - % Z Z # - - 93 - - x / } z x - - {

More information

For fine ti.ito vvt* have hcen in IS PUBLISHED EVERY. OF LOWELL. n t m r n T i l t " ^ n a i I Howk & White, CAPITAL, ,000.

For fine ti.ito vvt* have hcen in IS PUBLISHED EVERY. OF LOWELL. n t m r n T i l t  ^ n a i I Howk & White, CAPITAL, ,000. G G 7 87 - G G * - -» *» - - -8 6 8 ( - * - - - [- -- ( G - ( X * ( - --» - ( - - G» # - - - x- G»»» * 6 q q 6» - * 6 76 G» q 6 * - Q * /» q ** - X - * (( G» - * * * 8 8» * * X - - - (»-» * - - G - - G

More information

FREE CONCERTS IN PAVILIO N.

FREE CONCERTS IN PAVILIO N. - 8 -» * /«>»*? - - * 6 * * - > 8< * * 77 < * * ««* ( 7 98 * «9 «8 [ 6 8 - «(» «* z-- < * ( * -»- «-?-- - * ]«-

More information

Section 1.8. Simplifying Expressions

Section 1.8. Simplifying Expressions Section 1.8 Simplifying Expressions But, first Commutative property: a + b = b + a; a * b = b * a Associative property: (a + b) + c = a + (b + c) (a * b) * c = a * (b * c) Distributive property: a * (b

More information

Boolean Algebra and Logic Gates

Boolean Algebra and Logic Gates Boolean Algebra and Logic Gates Binary logic is used in all of today's digital computers and devices Cost of the circuits is an important factor Finding simpler and cheaper but equivalent circuits can

More information

The Associahedra and Permutohedra Yet Again

The Associahedra and Permutohedra Yet Again The Associahedra and Permutohedra Yet Again M. D. Sheppeard Abstract The associahedra and permutohedra polytopes are redefined as subsets of discrete simplices, associated respectively to the commutative

More information

Permutation Matrices. Permutation Matrices. Permutation Matrices. Permutation Matrices. Isomorphisms of Graphs. 19 Nov 2015

Permutation Matrices. Permutation Matrices. Permutation Matrices. Permutation Matrices. Isomorphisms of Graphs. 19 Nov 2015 9 Nov 25 A permutation matrix is an n by n matrix with a single in each row and column, elsewhere. If P is a permutation (bijection) on {,2,..,n} let A P be the permutation matrix with A ip(i) =, A ij

More information

Circuit analysis summary

Circuit analysis summary Boolean Algebra Circuit analysis summary After finding the circuit inputs and outputs, you can come up with either an expression or a truth table to describe what the circuit does. You can easily convert

More information

Presentation of the book BOOLEAN ARITHMETIC and its Applications

Presentation of the book BOOLEAN ARITHMETIC and its Applications Presentation of the book BOOLEAN ARITHMETIC and its Applications This book is the handout of one Post Graduate Discipline, offered since 1973, named PEA - 5737 Boolean Equations Applied to System Engineering,

More information

Boolean Algebra. BME208 Logic Circuits Yalçın İŞLER

Boolean Algebra. BME208 Logic Circuits Yalçın İŞLER Boolean Algebra BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com 5 Boolean Algebra /2 A set of elements B There exist at least two elements x, y B s. t. x y Binary operators: +

More information

Generalized alternative and Malcev algebras

Generalized alternative and Malcev algebras Mathematics Publications Mathematics 1982 Generalized alternative and Malcev algebras Irvin R. Hentzel Iowa State University, hentzel@iastate.edu H.F. Smith Iowa State University Follow this and additional

More information

Lesson 24 - Exploring Graphical Transformations and Composite Functions

Lesson 24 - Exploring Graphical Transformations and Composite Functions (A) Lesson Objectives a. Review composite functions and how it can be represented numerically, algebraically and graphically. b. Introduce graphical transformations c. Understand that graphical transformations

More information

Unit-IV Boolean Algebra

Unit-IV Boolean Algebra Unit-IV Boolean Algebra Boolean Algebra Chapter: 08 Truth table: Truth table is a table, which represents all the possible values of logical variables/statements along with all the possible results of

More information

Boolean algebra. June 17, Howard Huang 1

Boolean algebra. June 17, Howard Huang 1 Boolean algebra Yesterday we talked about how analog voltages can represent the logical values true and false. We introduced the basic Boolean operations AND, OR and NOT, which can be implemented in hardware

More information

BOOLEAN ALGEBRA AND CIRCUITS

BOOLEAN ALGEBRA AND CIRCUITS UNIT 3 Structure BOOLEAN ALGEBRA AND CIRCUITS Boolean Algebra and 3. Introduction 3. Objectives 3.2 Boolean Algebras 3.3 Logic 3.4 Boolean Functions 3.5 Summary 3.6 Solutions/ Answers 3. INTRODUCTION This

More information

Section 4.2 selected answers Math 131 Multivariate Calculus D Joyce, Spring 2014

Section 4.2 selected answers Math 131 Multivariate Calculus D Joyce, Spring 2014 4. Determine the nature of the critical points of Section 4. selected answers Math 11 Multivariate Calculus D Joyce, Spring 014 Exercises from section 4.: 6, 1 16.. Determine the nature of the critical

More information

IT 201 Digital System Design Module II Notes

IT 201 Digital System Design Module II Notes IT 201 Digital System Design Module II Notes BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.

More information

Binary logic. Dr.Abu-Arqoub

Binary logic. Dr.Abu-Arqoub Binary logic Binary logic deals with variables like (a, b, c,, x, y) that take on two discrete values (, ) and with operations that assume logic meaning ( AND, OR, NOT) Truth table is a table of all possible

More information

3D Mathematics. Co-ordinate systems, 3D primitives and affine transformations

3D Mathematics. Co-ordinate systems, 3D primitives and affine transformations 3D Mathematics Co-ordinate systems, 3D primitives and affine transformations Coordinate Systems 2 3 Primitive Types and Topologies Primitives Primitive Types and Topologies 4 A primitive is the most basic

More information

Objectives: 1- Bolean Algebra. Eng. Ayman Metwali

Objectives: 1- Bolean Algebra. Eng. Ayman Metwali Objectives: Chapter 3 : 1- Boolean Algebra Boolean Expressions Boolean Identities Simplification of Boolean Expressions Complements Representing Boolean Functions 2- Logic gates 3- Digital Components 4-

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

ENGIN 112 Intro to Electrical and Computer Engineering

ENGIN 112 Intro to Electrical and Computer Engineering ENGIN 2 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra Overview Logic functions with s and s Building digital circuitry Truth tables Logic symbols and waveforms Boolean algebra

More information

Hw 4 Due Feb 22. D(fg) x y z (

Hw 4 Due Feb 22. D(fg) x y z ( Hw 4 Due Feb 22 2.2 Exercise 7,8,10,12,15,18,28,35,36,46 2.3 Exercise 3,11,39,40,47(b) 2.4 Exercise 6,7 Use both the direct method and product rule to calculate where f(x, y, z) = 3x, g(x, y, z) = ( 1

More information

SYSTEMS OF NONLINEAR EQUATIONS

SYSTEMS OF NONLINEAR EQUATIONS SYSTEMS OF NONLINEAR EQUATIONS Widely used in the mathematical modeling of real world phenomena. We introduce some numerical methods for their solution. For better intuition, we examine systems of two

More information

CS8803: Advanced Digital Design for Embedded Hardware

CS8803: Advanced Digital Design for Embedded Hardware CS883: Advanced Digital Design for Embedded Hardware Lecture 2: Boolean Algebra, Gate Network, and Combinational Blocks Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883

More information

Propositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson

Propositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions

More information

Some Properties of Regular Semigroups. Possess a Medial Idempotent

Some Properties of Regular Semigroups. Possess a Medial Idempotent International Journal of Algebra, Vol. 4, 2010, no. 9, 433-438 Some Properties of Regular Semigroups Possess a Medial Idempotent S. Hussain 1, T. Anwer 1, H. Chien 2 1 Higher Education Department, Pakistan

More information

3.1 Iterated Partial Derivatives

3.1 Iterated Partial Derivatives 3.1 Iterated Partial Derivatives Prof. Tesler Math 20C Fall 2018 Prof. Tesler 3.1 Iterated Partial Derivatives Math 20C / Fall 2018 1 / 19 Higher Derivatives Take the partial derivative of f (x, y) = x

More information

Vector Calculus: Understanding the Cross Product

Vector Calculus: Understanding the Cross Product University of Babylon College of Engineering Mechanical Engineering Dept. Subject : Mathematics III Class : 2 nd year - first semester Date: / 10 / 2016 2016 \ 2017 Vector Calculus: Understanding the Cross

More information

Lecture (04) Boolean Algebra and Logic Gates

Lecture (04) Boolean Algebra and Logic Gates Lecture (4) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 26, Logic Design Boolean algebra properties basic assumptions and properties: Closure law A set S is

More information

Lecture (04) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee

Lecture (04) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee Lecture (4) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee Boolean algebra properties basic assumptions and properties: Closure law A set S is closed with respect to a binary operator, for every

More information

Section 4.2 Combining Functions; Composite Functions... 1 Section 4.3 Inverse Functions... 4

Section 4.2 Combining Functions; Composite Functions... 1 Section 4.3 Inverse Functions... 4 Property: T. Hrubik-Vulanovic e-mail: thrubik@kent.edu Chapter 4 Additional Topics with Functions Content: Section 4.2 Combining Functions; Composite Functions... 1 Section 4. Inverse Functions... 4 Section

More information

(1) Tangent Lines on Surfaces, (2) Partial Derivatives, (3) Notation and Higher Order Derivatives.

(1) Tangent Lines on Surfaces, (2) Partial Derivatives, (3) Notation and Higher Order Derivatives. Section 11.3 Partial Derivatives (1) Tangent Lines on Surfaces, (2) Partial Derivatives, (3) Notation and Higher Order Derivatives. MATH 127 (Section 11.3) Partial Derivatives The University of Kansas

More information

Information Science 1

Information Science 1 Information Science Boolean Expressions Week College of Information Science and Engineering Ritsumeikan University Topics covered l Terms and concepts from Week 9 l Binary (Boolean) logic History Boolean

More information

Chapter 3 Simplification of Boolean functions

Chapter 3 Simplification of Boolean functions 3.1 Introduction Chapter 3 Simplification of Boolean functions In this chapter, we are going to discuss several methods for simplifying the Boolean function. What is the need for simplifying the Boolean

More information

UNIT 2 BOOLEAN ALGEBRA

UNIT 2 BOOLEAN ALGEBRA UNIT 2 BOOLEN LGEBR Spring 2 2 Contents Introduction Basic operations Boolean expressions and truth tables Theorems and laws Basic theorems Commutative, associative, and distributive laws Simplification

More information

Combinational Logic & Circuits

Combinational Logic & Circuits Week-I Combinational Logic & Circuits Spring' 232 - Logic Design Page Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other

More information

Variable, Complement, and Literal are terms used in Boolean Algebra.

Variable, Complement, and Literal are terms used in Boolean Algebra. We have met gate logic and combination of gates. Another way of representing gate logic is through Boolean algebra, a way of algebraically representing logic gates. You should have already covered the

More information

CS February 17

CS February 17 Discrete Mathematics CS 26 February 7 Equal Boolean Functions Two Boolean functions F and G of degree n are equal iff for all (x n,..x n ) B, F (x,..x n ) = G (x,..x n ) Example: F(x,y,z) = x(y+z), G(x,y,z)

More information

Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER

Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER Gate-Level Minimization BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com Complexity of Digital Circuits Directly related to the complexity of the algebraic expression we use to

More information

Chapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces

Chapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces Chapter 6 Curves and Surfaces In Chapter 2 a plane is defined as the zero set of a linear function in R 3. It is expected a surface is the zero set of a differentiable function in R n. To motivate, graphs

More information

Get Free notes at Module-I One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)

More information

Introduction to Computer Graphics. Modeling (3) April 27, 2017 Kenshi Takayama

Introduction to Computer Graphics. Modeling (3) April 27, 2017 Kenshi Takayama Introduction to Computer Graphics Modeling (3) April 27, 2017 Kenshi Takayama Solid modeling 2 Solid models Thin shapes represented by single polygons Unorientable Clear definition of inside & outside

More information

Lesson 2b Functions and Function Operations

Lesson 2b Functions and Function Operations As we continue to work with more complex functions it is important that we are comfortable with Function Notation, opertions on Functions and opertions involving more than one function. In this lesson,

More information

UNIT-4 BOOLEAN LOGIC. NOT Operator Operates on single variable. It gives the complement value of variable.

UNIT-4 BOOLEAN LOGIC. NOT Operator Operates on single variable. It gives the complement value of variable. UNIT-4 BOOLEAN LOGIC Boolean algebra is an algebra that deals with Boolean values((true and FALSE). Everyday we have to make logic decisions: Should I carry the book or not?, Should I watch TV or not?

More information

ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes)

ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) ACLT: Algebra, Categories, Logic in Topology - Grothendieck's generalized topological spaces (toposes) Steve Vickers CS Theory Group Birmingham 4. Toposes and geometric reasoning How to "do generalized

More information

Subset Groupoids. W. B. Vasantha Kandasamy Florentin Smarandache

Subset Groupoids. W. B. Vasantha Kandasamy Florentin Smarandache Subset Groupoids W. B. Vasantha Kandasamy Florentin Smarandache Educational Publisher Inc. Ohio 2013 This book can be ordered from: Education Publisher Inc. 1313 Chesapeake Ave. Columbus, Ohio 43212, USA

More information

Therefore, after becoming familiar with the Matrix Method, you will be able to solve a system of two linear equations in four different ways.

Therefore, after becoming familiar with the Matrix Method, you will be able to solve a system of two linear equations in four different ways. Grade 9 IGCSE A1: Chapter 9 Matrices and Transformations Materials Needed: Straightedge, Graph Paper Exercise 1: Matrix Operations Matrices are used in Linear Algebra to solve systems of linear equations.

More information

Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives

Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives. Partial Derivatives In general, if f is a function of two variables x and y, suppose we let only x vary while keeping y fixed, say y = b, where b is a constant. By the definition of a derivative, we have Then we are really

More information

X Y Z F=X+Y+Z

X Y Z F=X+Y+Z This circuit is used to obtain the compliment of a value. If X = 0, then X = 1. The truth table for NOT gate is : X X 0 1 1 0 2. OR gate : The OR gate has two or more input signals but only one output

More information

Introduction to Boolean Algebra

Introduction to Boolean Algebra Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems

More information

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions 1. Convert the following SOP expression to an equivalent POS expression. 2. Determine the values of A, B, C, and D that make

More information

Chapter 2 Boolean algebra and Logic Gates

Chapter 2 Boolean algebra and Logic Gates Chapter 2 Boolean algebra and Logic Gates 2. Introduction In working with logic relations in digital form, we need a set of rules for symbolic manipulation which will enable us to simplify complex expressions

More information

September 18, B Math Test Chapter 1 Name: x can be expressed as: {y y 0, y R}.

September 18, B Math Test Chapter 1 Name: x can be expressed as: {y y 0, y R}. September 8, 208 62B Math Test Chapter Name: Part : Objective Questions [ mark each, total 2 marks]. State whether each of the following statements is TRUE or FALSE a) The mapping rule (x, y) (-x, y) represents

More information

Menu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification

Menu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification Menu Minterms & Maxterms SOP & POS MSOP & MPOS Simplification using the theorems/laws/axioms Look into my... 1 Definitions (Review) Algebraic Simplification - Boolean Algebra Minterms (written as m i ):

More information

Introduction to Boolean Algebra

Introduction to Boolean Algebra Introduction to Boolean Algebra Boolean algebra which deals with two-valued (true / false or and ) variables and functions find its use in modern digital computers since they too use two-level systems

More information

Pure Math 30: Explained!

Pure Math 30: Explained! www.puremath30.com 30 part i: stretches about other lines Stretches about other lines: Stretches about lines other than the x & y axis are frequently required. Example 1: Stretch the graph horizontally

More information

In-plane principal stress output in DIANA

In-plane principal stress output in DIANA analys: linear static. class: large. constr: suppor. elemen: hx24l solid tp18l. load: edge elemen force node. materi: elasti isotro. option: direct. result: cauchy displa princi stress total. In-plane

More information

1 Basic Mathematical Operations

1 Basic Mathematical Operations 1 Basic Mathematical Operations Recall the basic operations of addition, substraction, multiplication, and division. Consider evaluating the following expression: 2+3 5 Do we add 2 and 3 first or do we

More information

2 Second Derivatives. As we have seen, a function f (x, y) of two variables has four different partial derivatives: f xx. f yx. f x y.

2 Second Derivatives. As we have seen, a function f (x, y) of two variables has four different partial derivatives: f xx. f yx. f x y. 2 Second Derivatives As we have seen, a function f (x, y) of two variables has four different partial derivatives: (x, y), (x, y), f yx (x, y), (x, y) It is convenient to gather all four of these into

More information

Propositional Calculus. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson

Propositional Calculus. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus

More information

On Fuzzy Topological Spaces Involving Boolean Algebraic Structures

On Fuzzy Topological Spaces Involving Boolean Algebraic Structures Journal of mathematics and computer Science 15 (2015) 252-260 On Fuzzy Topological Spaces Involving Boolean Algebraic Structures P.K. Sharma Post Graduate Department of Mathematics, D.A.V. College, Jalandhar

More information

BOOLEAN ALGEBRA. 1. State & Verify Laws by using :

BOOLEAN ALGEBRA. 1. State & Verify Laws by using : BOOLEAN ALGEBRA. State & Verify Laws by using :. State and algebraically verify Absorption Laws. (2) Absorption law states that (i) X + XY = X and (ii) X(X + Y) = X (i) X + XY = X LHS = X + XY = X( + Y)

More information

(1) Given the following system of linear equations, which depends on a parameter a R, 3x y + 5z = 2 4x + y + (a 2 14)z = a + 2

(1) Given the following system of linear equations, which depends on a parameter a R, 3x y + 5z = 2 4x + y + (a 2 14)z = a + 2 (1 Given the following system of linear equations, which depends on a parameter a R, x + 2y 3z = 4 3x y + 5z = 2 4x + y + (a 2 14z = a + 2 (a Classify the system of equations depending on the values of

More information

Exploring Rational Functions

Exploring Rational Functions Name Date Period Exploring Rational Functions Part I - The numerator is a constant and the denominator is a linear factor. 1. The parent function for rational functions is: Graph and analyze this function:

More information

Boolean Algebra. P1. The OR operation is closed for all x, y B x + y B

Boolean Algebra. P1. The OR operation is closed for all x, y B x + y B Boolean Algebra A Boolean Algebra is a mathematical system consisting of a set of elements B, two binary operations OR (+) and AND ( ), a unary operation NOT ('), an equality sign (=) to indicate equivalence

More information

5.3 Linear Function Graphs

5.3 Linear Function Graphs 5.3 Linear Function Graphs Learning Objectives Recognize and use function notation. Graph a linear function. Change slope and intercepts of function graphs. Analyze graphs of real-world functions. Introduction

More information

An Interesting Way to Combine Numbers

An Interesting Way to Combine Numbers An Interesting Way to Combine Numbers Joshua Zucker and Tom Davis October 12, 2016 Abstract This exercise can be used for middle school students and older. The original problem seems almost impossibly

More information

Algebra 1 Review. Properties of Real Numbers. Algebraic Expressions

Algebra 1 Review. Properties of Real Numbers. Algebraic Expressions Algebra 1 Review Properties of Real Numbers Algebraic Expressions Real Numbers Natural Numbers: 1, 2, 3, 4,.. Numbers used for counting Whole Numbers: 0, 1, 2, 3, 4,.. Natural Numbers and 0 Integers:,

More information

BIOL Gradation of a histogram (a) into the normal curve (b)

BIOL Gradation of a histogram (a) into the normal curve (b) (التوزيع الطبيعي ( Distribution Normal (Gaussian) One of the most important distributions in statistics is a continuous distribution called the normal distribution or Gaussian distribution. Consider the

More information

TRANSFORMATION GROUPS IN THE THEORY OF TOPOLOGICAL LOOPS

TRANSFORMATION GROUPS IN THE THEORY OF TOPOLOGICAL LOOPS TRANSFORMATION GROUPS IN THE THEORY OF TOPOLOGICAL LOOPS SIGMUND N. HUDSON In a recent paper [5] the author has applied the techniques of topological transformation group theory to the study of certain

More information

Mathematically Rigorous Software Design Review of mathematical prerequisites

Mathematically Rigorous Software Design Review of mathematical prerequisites Mathematically Rigorous Software Design 2002 September 27 Part 1: Boolean algebra 1. Define the Boolean functions and, or, not, implication ( ), equivalence ( ) and equals (=) by truth tables. 2. In an

More information

CHAPTER 5 SYSTEMS OF EQUATIONS. x y

CHAPTER 5 SYSTEMS OF EQUATIONS. x y page 1 of Section 5.1 CHAPTER 5 SYSTEMS OF EQUATIONS SECTION 5.1 GAUSSIAN ELIMINATION matrix form of a system of equations The system 2x + 3y + 4z 1 5x + y + 7z 2 can be written as Ax where b 2 3 4 A [

More information

Boolean Logic CS.352.F12

Boolean Logic CS.352.F12 Boolean Logic CS.352.F12 Boolean Algebra Boolean Algebra Mathematical system used to manipulate logic equations. Boolean: deals with binary values (True/False, yes/no, on/off, 1/0) Algebra: set of operations

More information

3. According to universal addressing, what is the address of vertex d? 4. According to universal addressing, what is the address of vertex f?

3. According to universal addressing, what is the address of vertex d? 4. According to universal addressing, what is the address of vertex f? 1. Prove: A full m-ary tree with i internal vertices contains n = mi + 1 vertices. 2. For a full m-ary tree with n vertices, i internal vertices, and l leaves, prove: (i) i = (n 1)/m and l = [(m 1)n +

More information

Algorithms for Verifying Variants of Boolean Algebra Equations and Expressions

Algorithms for Verifying Variants of Boolean Algebra Equations and Expressions Algorithms for Verifying Variants of Boolean Algebra Equations and Expressions O.E. Oguike Department of Computer Science University of Nigeria Nsukka, Nigeria osondu.oguike@unn.edu.ng ABSTRACT The word,

More information

Chapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.

Chapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal. Chapter 8 out of 7 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal 8 Matrices Definitions and Basic Operations Matrix algebra is also known

More information

Introduction to PDEs: Notation, Terminology and Key Concepts

Introduction to PDEs: Notation, Terminology and Key Concepts Chapter 1 Introduction to PDEs: Notation, Terminology and Key Concepts 1.1 Review 1.1.1 Goal The purpose of this section is to briefly review notation as well as basic concepts from calculus. We will also

More information

[Bharathi, 3(2): February, 2014] ISSN: Impact Factor: 1.852

[Bharathi, 3(2): February, 2014] ISSN: Impact Factor: 1.852 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY Associators in the Nucleus of Antiflexible Rings DR. D. Bharathi *1, M. Hema Prasad 2 *1 Associate Professor, Department of Mathematics,

More information

Module 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur

Module 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur Module 6 Knowledge Representation and Logic (First Order Logic) Lesson 15 Inference in FOL - I 6.2.8 Resolution We have introduced the inference rule Modus Ponens. Now we introduce another inference rule

More information

Lambda Calculus and Type Inference

Lambda Calculus and Type Inference Lambda Calculus and Type Inference Björn Lisper Dept. of Computer Science and Engineering Mälardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/ blr/ October 13, 2004 Lambda Calculus and Type

More information

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University Logic Design First Stage Lecture No.5 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Boolean Operations Laws of Boolean Algebra Rules of Boolean Algebra

More information

DRAFT: Analysis of Skew Tensegrity Prisms

DRAFT: Analysis of Skew Tensegrity Prisms DRAFT: Analysis of Skew Tensegrity Prisms Mark Schenk March 6, 2006 Abstract This paper describes the properties of skew tensegrity prisms. By showing that the analytical equilibrium solutions of regular

More information

2.1 Binary Logic and Gates

2.1 Binary Logic and Gates 1 EED2003 Digital Design Presentation 2: Boolean Algebra Asst. Prof.Dr. Ahmet ÖZKURT Asst. Prof.Dr Hakkı T. YALAZAN Based on the Lecture Notes by Jaeyoung Choi choi@comp.ssu.ac.kr Fall 2000 2.1 Binary

More information

AQA Computer Science A-Level Boolean algebra Advanced Notes

AQA Computer Science A-Level Boolean algebra Advanced Notes Q Computer Science -Level 465 Boolean algebra dvanced Notes Specification: 4651 Using Boolean algebra: Be familiar with the use of Boolean identities and De Morgan s laws to manipulate and simplify Boolean

More information

Fundamentals of Structural Geology Exercise: concepts from chapter 2

Fundamentals of Structural Geology Exercise: concepts from chapter 2 0B Reading: Fundamentals of Structural Geology, Ch 2 1) Develop a MATLAB script that plots the spherical datum (Fig. 2.1a) with unit radius as a wire-frame diagram using lines of constant latitude and

More information

Euclidean Space. Definition 1 (Euclidean Space) A Euclidean space is a finite-dimensional vector space over the reals R, with an inner product,.

Euclidean Space. Definition 1 (Euclidean Space) A Euclidean space is a finite-dimensional vector space over the reals R, with an inner product,. Definition 1 () A Euclidean space is a finite-dimensional vector space over the reals R, with an inner product,. 1 Inner Product Definition 2 (Inner Product) An inner product, on a real vector space X

More information

Introduction to Boolean logic and Logical Gates

Introduction to Boolean logic and Logical Gates Introduction to Boolean logic and Logical Gates Institute of Statistics Fall 2014 We saw the importance of the binary number system for data representation in a computer system. We ll see that the construction

More information

Computation of the gravity gradient tensor due to topographic masses using tesseroids

Computation of the gravity gradient tensor due to topographic masses using tesseroids Computation of the gravity gradient tensor due to topographic masses using tesseroids Leonardo Uieda 1 Naomi Ussami 2 Carla F Braitenberg 3 1. Observatorio Nacional, Rio de Janeiro, Brazil 2. Universidade

More information

Quaternion properties: addition. Introduction to quaternions. Quaternion properties: multiplication. Derivation of multiplication

Quaternion properties: addition. Introduction to quaternions. Quaternion properties: multiplication. Derivation of multiplication Introduction to quaternions Definition: A quaternion q consists of a scalar part s, s, and a vector part v ( xyz,,, v 3 : q where, [ s, v q [ s, ( xyz,, q s+ ix + jy + kz i 2 j 2 k 2 1 ij ji k k Quaternion

More information

Philadelphia University Faculty of Information Technology Department of Computer Science. Computer Logic Design. By Dareen Hamoudeh.

Philadelphia University Faculty of Information Technology Department of Computer Science. Computer Logic Design. By Dareen Hamoudeh. Philadelphia University Faculty of Information Technology Department of Computer Science Computer Logic Design By Dareen Hamoudeh Dareen Hamoudeh 1 Canonical Forms (Standard Forms of Expression) Minterms

More information

Matrices. A Matrix (This one has 2 Rows and 3 Columns) To add two matrices: add the numbers in the matching positions:

Matrices. A Matrix (This one has 2 Rows and 3 Columns) To add two matrices: add the numbers in the matching positions: Matrices A Matrix is an array of numbers: We talk about one matrix, or several matrices. There are many things we can do with them... Adding A Matrix (This one has 2 Rows and 3 Columns) To add two matrices:

More information

Key Terms. Writing Algebraic Expressions. Example

Key Terms. Writing Algebraic Expressions. Example Chapter 6 Summary Key Terms variable (6.1) algebraic expression (6.1) evaluate an algebraic expression (6.1) Distributive Property of Multiplication over Addition (6.2) Distributive Property of Multiplication

More information

Chapter 2. Boolean Algebra and Logic Gates

Chapter 2. Boolean Algebra and Logic Gates Chapter 2. Boolean Algebra and Logic Gates Tong In Oh 1 Basic Definitions 2 3 2.3 Axiomatic Definition of Boolean Algebra Boolean algebra: Algebraic structure defined by a set of elements, B, together

More information

DAY,.JANUARY 5, 1918 s.:i. A a T B O D B H « gg P li. SO UTH ST R E ET. BOY S A R B T A K E N FR O M T H E A G E O F E IG H T. i I..

DAY,.JANUARY 5, 1918 s.:i. A a T B O D B H « gg P li. SO UTH ST R E ET. BOY S A R B T A K E N FR O M T H E A G E O F E IG H T. i I.. ~~ * b ( : 3 5 0 BB Y Y 5 98 : : : ~ ~ : B B «8 B Y y < b / q b* x bb y :» > < ( q y x : K y b x y x x» b B y ^ 8 y Bx 3: ( ^ ^ 2* >? x 5 2 ^ Y ky Y b b B B B ( y ) B B ( ) B B B BK " B y Bkk / 2 B 5 y

More information

CGF Lecture 2 Numbers

CGF Lecture 2 Numbers CGF Lecture 2 Numbers Numbers A number is an abstract entity used originally to describe quantity. i.e. 80 Students etc The most familiar numbers are the natural numbers {0, 1, 2,...} or {1, 2, 3,...},

More information

1 Scope, Bound and Free Occurrences, Closed Terms

1 Scope, Bound and Free Occurrences, Closed Terms CS 6110 S18 Lecture 2 The λ-calculus Last time we introduced the λ-calculus, a mathematical system for studying the interaction of functional abstraction and functional application. We discussed the syntax

More information

Rational Functions. By: Kaushik Sriram, Roshan Kuntamukkala, and Sheshanth Vijayakumar

Rational Functions. By: Kaushik Sriram, Roshan Kuntamukkala, and Sheshanth Vijayakumar Rational Functions By: Kaushik Sriram, Roshan Kuntamukkala, and Sheshanth Vijayakumar What are Rational Functions? Dictionary Definition: In mathematics, a rational function is any function which can be

More information

Logical reasoning systems

Logical reasoning systems Logical reasoning systems Theorem provers and logic programming languages Production systems Frame systems and semantic networks Description logic systems CS 561, Session 19 1 Logical reasoning systems

More information

Logic Design: Part 2

Logic Design: Part 2 Orange Coast College Business Division Computer Science Department CS 6- Computer Architecture Logic Design: Part 2 Where are we? Number systems Decimal Binary (and related Octal and Hexadecimal) Binary

More information