discrete assignment 1(a)

3
Logical Operators 1) Negation (~, ) Let β€˜β€™ be a proposition. The Negation of β€˜p’ denoted by "~". β„Ž β€œ~” β„Ž β„Ž β€˜β€™ β„Ž ~ 1 0 0 1 2) Conjunction (β‹€, ) Let β€˜β€™ and β€˜β€™ b two propositions. The conjunction of β€˜β€™ and β€˜β€™ denoted by " β‹€ ". "β„Ž " β‹€ " β„Ž β„Ž β€˜β€™ β€˜β€™ β„Ž " β„Ž β‹€ 1 1 1 1 0 0 0 1 0 0 0 0 3) Disjunction (⋁, ) Let β€˜β€™ and β€˜β€™ b two propositions. The disjunction of β€˜β€™ and β€˜β€™ denoted by " ⋁ ". "β„Ž " ⋁ " β„Ž β€˜β€™ β€˜β€™ β„Ž " β„Ž ⋁ 1 1 1 1 0 1 0 1 1 0 0 0

Upload: m-sohaib-azam

Post on 08-Dec-2015

4 views

Category:

Documents


0 download

DESCRIPTION

Discrete Assignment 1(a)Discrete Assignment 1(a)Discrete Assignment 1(a)Discrete Assignment 1(a)Discrete Assignment 1(a)

TRANSCRIPT

Page 1: Discrete Assignment 1(a)

Logical Operators

1) Negation (~, π‘›π‘œπ‘‘)

Let β€˜π‘β€™ be a proposition. The Negation of β€˜p’ denoted by "~𝑝".

π‘‡β„Žπ‘’ π‘‰π‘Žπ‘™π‘’π‘’ π‘œπ‘“ β€œ~𝑝” 𝑖𝑠 π‘‘β„Žπ‘’ π‘œπ‘π‘π‘œπ‘ π‘–π‘‘π‘’ π‘œπ‘“ π‘‘β„Žπ‘’ π‘£π‘Žπ‘™π‘’π‘’ π‘œπ‘“ β€˜π‘β€™

π‘‡π‘Ÿπ‘’π‘‘β„Ž π‘‡π‘Žπ‘π‘™π‘’ π‘œπ‘“ π‘π‘’π‘”π‘Žπ‘‘π‘–π‘œπ‘›

𝑝 ~𝑝

1 0

0 1

2) Conjunction (β‹€, π‘Žπ‘›π‘‘)

Let β€˜π‘β€™ and β€˜π‘žβ€™ b two propositions. The conjunction of β€˜π‘β€™ and β€˜π‘žβ€™ denoted by "𝑝 β‹€ π‘ž".

"π‘‡β„Žπ‘’ πΆπ‘œπ‘›π‘—π‘’π‘›π‘π‘‘π‘–π‘œπ‘› "𝑝 β‹€ π‘ž" 𝑖𝑠 𝟏 π‘€β„Žπ‘’π‘› π‘π‘œπ‘‘β„Ž β€˜π‘β€™ π‘Žπ‘›π‘‘ β€˜π‘žβ€™ π‘Žπ‘Ÿπ‘’ 𝟏 π‘œπ‘‘β„Žπ‘’π‘Ÿπ‘€π‘–π‘ π‘’ 𝟎"

π‘‡π‘Ÿπ‘’π‘‘β„Ž π‘‡π‘Žπ‘π‘™π‘’ π‘œπ‘“ πΆπ‘œπ‘›π‘—π‘’π‘›π‘π‘‘π‘–π‘œπ‘›

𝑝 π‘ž 𝑝 β‹€ π‘ž 1 1 1

1 0 0 0 1 0

0 0 0

3) Disjunction (⋁, π‘œπ‘Ÿ)

Let β€˜π‘β€™ and β€˜π‘žβ€™ b two propositions. The disjunction of β€˜π‘β€™ and β€˜π‘žβ€™ denoted by "𝑝 ⋁ π‘ž".

"π‘‡β„Žπ‘’ π·π‘–π‘ π‘—π‘’π‘›π‘π‘‘π‘–π‘œπ‘› "𝑝 ⋁ π‘ž" 𝑖𝑠 𝟏 π‘€β„Žπ‘’π‘› π‘Žπ‘‘ π‘™π‘’π‘Žπ‘ π‘‘ π‘œπ‘›π‘’ π‘œπ‘“ β€˜π‘β€™ π‘Žπ‘›π‘‘ β€˜π‘žβ€™ 𝑖𝑠 𝟏 π‘œπ‘‘β„Žπ‘’π‘Ÿπ‘€π‘–π‘ π‘’ 𝟎"

π‘‡π‘Ÿπ‘’π‘‘β„Ž π‘‡π‘Žπ‘π‘™π‘’ π‘œπ‘“ π·π‘–π‘ π‘—π‘’π‘›π‘π‘‘π‘–π‘œπ‘›

𝑝 π‘ž 𝑝 ⋁ π‘ž 1 1 1

1 0 1 0 1 1

0 0 0

Page 2: Discrete Assignment 1(a)

4) Implication (Conditional) (β†’, π‘–π‘šπ‘π‘™π‘–π‘’π‘ )

Let β€˜π‘β€™ and β€˜π‘žβ€™ b two propositions. The conditional statement of β€˜π‘β€™ and β€˜π‘žβ€™ denoted by "𝑝 β†’ π‘ž".

"π‘‡β„Žπ‘’ πΆπ‘œπ‘›π‘‘π‘–π‘œπ‘‘π‘–π‘œπ‘›π‘Žπ‘™ π‘†π‘‘π‘Žπ‘‘π‘’π‘šπ‘’π‘›π‘‘ "𝑝 β†’ π‘ž" 𝑖𝑠 𝟎 π‘€β„Žπ‘’π‘› β€˜π‘β€™ 𝑖𝑠 𝟏 π‘Žπ‘›π‘‘ β€˜π‘žβ€™ 𝑖𝑠 𝟎 π‘œπ‘‘β„Žπ‘’π‘Ÿπ‘€π‘–π‘ π‘’ 𝟏"

π‘‡π‘Ÿπ‘’π‘‘β„Ž π‘‡π‘Žπ‘π‘™π‘’ π‘œπ‘“ πΌπ‘šπ‘π‘™π‘–π‘π‘Žπ‘‘π‘–π‘œπ‘›

𝑝 π‘ž 𝑝 β†’ π‘ž 1 1 1

1 0 0 0 1 1

0 0 1

5) Bi-implication (bi-conditional) (↔, 𝑖𝑓 π‘Žπ‘›π‘‘ π‘œπ‘›π‘™π‘¦ 𝑖𝑓)

Let β€˜π‘β€™ and β€˜π‘žβ€™ b two propositions. The bi-conditional statement of β€˜π‘β€™ and β€˜π‘žβ€™ denoted by "𝑝 ↔ π‘ž".

"π‘‡β„Žπ‘’ 𝐡𝑖 βˆ’ π‘π‘œπ‘›π‘‘π‘–π‘œπ‘‘π‘–π‘œπ‘›π‘Žπ‘™ π‘†π‘‘π‘Žπ‘‘π‘’π‘šπ‘’π‘›π‘‘ "𝑝 ↔ π‘ž" 𝑖𝑠 𝟏 π‘€β„Žπ‘’π‘› π‘π‘œπ‘‘β„Ž β€˜π‘β€™ π‘Žπ‘›π‘‘ β€˜π‘žβ€™ β„Žπ‘Žπ‘£π‘’ π‘ π‘Žπ‘šπ‘’ π‘£π‘Žπ‘™π‘’π‘’

π‘œπ‘‘β„Žπ‘’π‘Ÿπ‘€π‘–π‘ π‘’ 𝟎"

π‘‡π‘Ÿπ‘’π‘‘β„Ž π‘‡π‘Žπ‘π‘™π‘’ π‘œπ‘“ 𝐡𝑖 βˆ’ π‘–π‘šπ‘π‘™π‘–π‘π‘Žπ‘‘π‘–π‘œπ‘›

𝑝 π‘ž 𝑝 ↔ π‘ž 1 1 1

1 0 0 0 1 0

0 0 1

6) Exclusive or (⨁, 𝑒π‘₯ π‘œπ‘Ÿ)

Let β€˜π‘β€™ and β€˜π‘žβ€™ b two propositions. The exclusive or of β€˜π‘β€™ and β€˜π‘žβ€™ denoted by "𝑝 ⨁ π‘ž".

π‘‡β„Žπ‘’ 𝐸π‘₯𝑐𝑙𝑒𝑠𝑖𝑣𝑒 π‘œπ‘Ÿ 𝑝 ⨁ π‘ž" 𝑖𝑠 𝟏 π‘€β„Žπ‘’π‘› 𝑒π‘₯π‘Žπ‘π‘‘π‘™π‘¦ π‘œπ‘›π‘’ π‘œπ‘“ β€˜π‘β€™ π‘Žπ‘›π‘‘ β€˜π‘žβ€™ 𝑖𝑠 𝟏 π‘œπ‘‘β„Žπ‘’π‘Ÿπ‘€π‘–π‘ π‘’ 𝟎"

π‘‡π‘Ÿπ‘’π‘‘β„Ž π‘‡π‘Žπ‘π‘™π‘’ π‘œπ‘“ 𝐸π‘₯𝑐𝑙𝑒𝑠𝑖𝑣𝑒 π‘œπ‘Ÿ

𝑝 π‘ž 𝑝 ⨁ π‘ž 1 1 0

1 0 1 0 1 1

0 0 0

Page 3: Discrete Assignment 1(a)

7) NAND Logical Operator (↑)

Let β€˜π‘β€™ and β€˜π‘žβ€™ b two propositions. The NAND of β€˜π‘β€™ and β€˜π‘žβ€™ denoted by "𝑝 ↑ π‘ž".

π‘‡β„Žπ‘’ 𝑁𝐴𝑁𝐷 "p↑q" 𝑖𝑠 𝟎 𝑖𝑓 π‘π‘œπ‘‘β„Ž π‘œπ‘“ 𝑖𝑑𝑠 π‘œπ‘π‘’π‘Ÿπ‘Žπ‘‘π‘œπ‘Ÿπ‘  β€˜π‘β€™ π‘Žπ‘›π‘‘ β€˜π‘žβ€™ π‘Žπ‘Ÿπ‘’ 𝟏 π‘œπ‘‘β„Žπ‘’π‘Ÿπ‘€π‘–π‘ π‘’ 𝟏

π‘‡π‘Ÿπ‘’π‘‘β„Ž π‘‡π‘Žπ‘π‘™π‘’ π‘œπ‘“ 𝑁𝐴𝑁𝐷

𝑝 π‘ž 𝑝 ↑ π‘ž 1 1 0

1 0 1 0 1 1

0 0 1

8) NOR Logical Operator (↓)

Let β€˜π‘β€™ and β€˜π‘žβ€™ b two propositions. The Nor of β€˜π‘β€™ and β€˜π‘žβ€™ denoted by "𝑝 ↓ π‘ž".

π‘‡β„Žπ‘’ π‘π‘œπ‘Ÿ "p↓q" 𝑖𝑠 𝟏 π‘–π‘“π‘π‘œπ‘‘β„Ž π‘œπ‘“ 𝑖𝑑𝑠 π‘œπ‘π‘’π‘Ÿπ‘Žπ‘‘π‘œπ‘Ÿπ‘  β€˜π‘β€™ π‘Žπ‘›π‘‘ β€˜π‘žβ€™ π‘Žπ‘’ 𝟎 π‘œπ‘‘β„Žπ‘’π‘Ÿπ‘€π‘–π‘ π‘’ 𝟏

π‘‡π‘Ÿπ‘’π‘‘β„Ž π‘‡π‘Žπ‘π‘™π‘’ π‘œπ‘“ π‘π‘œπ‘Ÿ

𝑝 π‘ž 𝑝 ↓ π‘ž 1 1 0

1 0 0 0 1 0

0 0 1