Scribd
Upload
5 views3 pages

Mat For Data Science 3

Uploaded by

msds24hari

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt

Mat For Data Science 3

Uploaded by

msds24hari
5 views3 pages

Original Title

Mat for Data Science 3

Copyright

© © All Rights Reserved

Available Formats

PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
5 views3 pages

Mat For Data Science 3

Uploaded by

msds24hari

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 3

Mathematics For Data Science

Hari Narayanan
20 October 2024

Contents
1 Disjunctive Normal Form(DNF) 2

2 Conjunctive Normal Form (CNF) 2

3 Boolean Variables 2
3.1 Boolean Function . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
3.2 Atomic Boolean Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

1
1 Disjunctive Normal Form(DNF)
In DNF, the Boolean expression is a disjunction (logical OR, denoted as ∨) of conjunctions
(logical AND, denoted as ∧) of literals (a variable or its negation). Each satisfying truth
assignment (truth table row where the function evaluates to true) contributes a conjunction
of literals.
The resulting DNF is the disjunction of all such conjunctions.

2 Conjunctive Normal Form (CNF)


In CNF, the Boolean expression is a conjunction (logical AND, denoted as ∧) of disjunctions
(logical OR, denoted as ∨) of literals. Each falsifying truth assignment (truth table row
where the function
evaluates to false) contributes a disjunction of literals. The resulting CNF is the conjunction
of all such disjunctions.

3 Boolean Variables
A Boolean variable is a variable that can take only one of two possible values, typically
represented as True or False, or equivalently as 1 or 0 in binary logic. Boolean variables are
the fundamental building blocks of Boolean algebra

Z2 which is {0, 1}

3.1 Boolean Function


A Boolean function is a mathematical function that operates on Boolean variables and
produces a Boolean output (either True/1 or False/0).

• Boolean Function of One Variable:


f:Z2 → Z2

• Boolean Function of two Variable:


f: Z2 × Z2 → Z2

2
1. f(x, y, z) =(x ∧ ¬y) ∨ (¬x ∧ y)

x y z ¬y ¬x x ∧ ¬y ¬x ∧ y f (x, y) f (x, y, z)
0 0 0 1 1 0 0 0 0
0 0 1 1 1 0 0 0 0
0 1 0 0 1 0 1 1 1
0 1 1 0 1 0 1 1 1
1 0 0 1 0 1 0 1 1
1 0 1 1 0 1 0 1 1
1 1 0 0 0 0 0 0 0
1 1 1 0 0 0 0 0 0

Table 1: Truth Table for f (x, y, z)

so f(x, y, z) =(¬x ∧ y ∧ ¬z) ∨ (¬x ∧ y ∧ z) ∨ (x ∧ ¬y ∧ ¬z) ∨ (x ∧ ¬y ∧ z)

2. g(x,y,z) = (x ∨ y) ∧ (y ∨ z) ∧ (¬x ∨ ¬y ∨ ¬z)

x y z x∨y y∨z ¬x ¬y ¬z ¬x ∨ ¬y ∨ ¬z g
0 0 0 0 0 1 1 1 1 0
0 0 1 0 1 1 1 0 1 0
0 1 0 1 1 1 0 1 1 1
0 1 1 1 1 1 0 0 1 1
1 0 0 1 0 0 1 1 1 0
1 0 1 1 1 0 1 0 1 0
1 1 0 1 1 0 0 1 1 1
1 1 1 1 1 0 0 0 0 0
1 0 1 1 1 0 1 0 1 1

The DNF of the function g is given by: g =(¬x ∧ y ∧ ¬z) ∨ (¬x ∧ y ∧ z) ∨ (x ∧ y ∧ ¬z) ∨
(x ∧ ¬y ∧ z)

3.2 Atomic Boolean Algebra


Result

• Any Finite Boolean Algebra is Atomic

• Any element of Boolean Algebra can be expressed as the union of atom

• It is unique

• Any finite boolean Algebra contains 2n many element where n ∈ N

You might also like