Discrete Structures Lecture 12 Segment

Proof by cases: An example.

Proof by cases: A variation based on the logical equivalence between (P_1 OR P_2 OR ... OR P_n) → Q and (P_1 → Q) AND ...

An exhaustive proof is a special case of proof by cases.

Proof by cases: A template.

... at the time here okay it's been 40 minutes maybe we should better stop here and then we'll pick up here on the next

00:00 Equivalence proof: proving the conjunction of two conditionals 03:35 Proving n-1 equivalences using (only) n proofs of ...

0:00 Logical consequence in predicate logic 1:04 Proof by counter-example 5:52 Another proof by counter-example 8:06 Informal ...

It's a new semester and time to start my course,

Here is a quick tutorial on two different truth tables. If there's anyone wondering about the "IF/THEN" statements (the one way ...

Discrete Mathematics

0:00 Argument 3:08 Valid argument 5:09 Rule of inference - Example: modus ponens 11:20 Example: Modus tollens

Discrete Structures

Fundamental to Algebra is the concept of a binary relation. This concept is closely related to the concept of a function.