Continuing off my previous post, and ahead of the first midterm of this class, I wanted to release the rest of the Discrete Math (CIS1910) notes I had. In order for this to work in a blog format, I will be converting all my notes to readable text, hopefully at sometime in the future I can release a censored raw notes.

Terms

Some basic ideas that are mentioned profusely in the logical equivelence chapter is the following. I’ll include the symbols usually used to represent these, and everytime its symbolized, you can hover to see the meaning.

Tautologies (⊤): A Tautologie is a compound proposition (refer to propositions article, simply put, it combines one or more simple propositions using a logical connective (AND, OR, etc)) that no matter the truth values given as an input, no matter the expected result given those values, the conclusion will always be true.

Contradicition (⊥): pretty much ¬Tautologie (Not Tautologie). Its the same sort of thing but the conclusion will always be false, instead of true.

Logically Equivelent: When multiple compound proposition have identical truth values, they are considiered this. (Ex: r ≡ s (r is logically equivelent to s))