Scribd
Upload
2 views3 pages

Discrete Structures Notes

The document explains the concept of propositions, which are declarative sentences that can be true or false, and introduces logical operations such as negation, conjunction, disjunction, and conditional statements. It also covers the converse, contrapositive, and inverse of propositions, as well as biconditional statements that are true only when both propositions share the same truth value. Additionally, it outlines types of compound propositions: tautology, contradiction, and contingency.

Uploaded by

dahikaayyub
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views3 pages

Discrete Structures Notes

The document explains the concept of propositions, which are declarative sentences that can be true or false, and introduces logical operations such as negation, conjunction, disjunction, and conditional statements. It also covers the converse, contrapositive, and inverse of propositions, as well as biconditional statements that are true only when both propositions share the same truth value. Additionally, it outlines types of compound propositions: tautology, contradiction, and contingency.

Uploaded by

dahikaayyub
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

f Module 1:

A proposition is a declarative sentence, meaning it declares a fact. It is either true


or false, it cannot be both at the same time.

e.g: 2+2=4 (proposition as it declares a fact and is true)


10/5 =3 (proposition as it declares a fact even though the fact is false)

e.g of things that are not a proposition:


→ Where do you live? (it is a question, not a fact)
→ n-2=7 (we don’t know what n is, so we can’t come up with an answer so not a
proposition.)

Proposition → p
Negation of the proposition → ¬p (not p)

Conjunction of two propositions → and


(symbol Ʌ)
Disconjunction of two propositions → or -> 2 types: inclusive or exclusive.
(symbol V)
Inclusive means it can be either of the two options and can be both as well.
Exclusive means it has to be one or the other, it cannot be both.

Conditional statements. E.g if p is…, then q will be… In this p is called the
hypothesis and q is called the conclusion.

Converse, Contrapositive, and Inverse Propositions: (Learn)

Converse: is the inverse of the conditional statement of p → q.


the proposition q → p is called the converse of p → q

Contrapositive: the contrapositive of p → q is the proposition of ¬p → ¬q

Inverse: The proposition ¬p → ¬q is called the inverse of p → q


e.g

Statement: The home team wins whenever it is raining.


(Because “q whenever p” is one of the ways to express the conditional statement p
→ q, the original statement can be re-written as “If it is raining, then the home
team wins.”)

Converse of the statement: If the home team wins, then it is raining.

Contrapositive: If the home team does not win, then it is not raining.

Inverse: If it is not raining, then the home team does not win.

Biconditionals (symbol: ↔) :

Also known as bi-implications.

The biconditional statement p ↔ q is the proposition p if and only if q. This


biconditional statement will only be true if p and q have the same truth values
(meaning the same values, either both true or both false), otherwise, it will be false.
e.g
p = you can take the flight
q = you buy a ticket

p if and only if q

p ↔ q = you can take the flight if and only if you buy a ticket.

Logic and Bit operations:

A bit can either be 1 or 0.

So True (T) = 1 and False (F) = 0.


Conjunction = AND logical operation (logic gate) (both statements should be true)
Disconjunction = OR logic gate (both statements should be or, as in one or the
other, exclusive and inclusive.)

Module 2:

There are 3 types of compound propositions.


→ Tautology: A compound proposition th
→ Contradiction
→ Contingency

You might also like