Chapter 1 Propositional Logic

  This chapter is mainly on how you deal with logic and gates. This is the part 1 of the chapter so I will make it short and precise but you all will be understanding what is going on.

  In Chapter 1 of the Discrete Mathematics, basically you will surround in between True(T) and False (F) after you know what is proposition and the eligibility for a sentence to be a proposition (not preposition, they are different things).

  A proposition is basically a sentence that can be false or true but not both. It cannot be a question or unsure situation where there exists a variable in the sentence. In Logics, the logical operators or the connectives act as a bridge to connect in between two different propositions, in which we mention it as p and q, normally, although sometimes the propositions given can be up to three or even four, i.e. p, q, r, and s.

  Conjunction, disjunction, implication and biimplication are the 4 common logical operators in propositional logic. What are them?

Have a look at here, my very own Powtoon video.
https://www.youtube.com/watch?v=1XdOs7ZmF80&rel=0

Brought to you by,
Me, that is just me, very easy.

2017-10-09
4.07pm

Comments

Popular posts from this blog

Chapter 3 Methods of Proof