Discrete Structures Lecture 4 Segment

Media Summary: Laws of propositional logic (i.e., list of useful logical equivalences) 0:00 Commutativity laws 3:14 De Morgan's laws Bubble sort algorithm 0:00 Bubble sort algorithm to sort a finite sequence Second example of using mathematical induction to prove the correctness of a closed-form guess.

Discrete Structures Lecture 4 Segment - Detailed Analysis & Overview

Laws of propositional logic (i.e., list of useful logical equivalences) 0:00 Commutativity laws 3:14 De Morgan's laws Bubble sort algorithm 0:00 Bubble sort algorithm to sort a finite sequence Second example of using mathematical induction to prove the correctness of a closed-form guess. 0:00 Five examples of English sentences translated into predicate logic 7:47 Three examples of predicate logic expressions ... An exhaustive proof is a special case of proof by cases. Cartesian product 0:00 Definition: n-tuple 1:18 Definition: pair 2:44 Definition: Cartesian product 8:20 Definition: relation 10:01 ...

... let's discuss some direct applications of it for example let's compute the expansion of 3x minus 2y raised to the power Other useful logical equivalences + equational reasoning 0:00 Conditional equivalence (i.e., replacing implication with ... Predicate logic 0:00 Formalizing the Flipper argument 10:35 The need for quantification. 0:00 Definition of the "resolution" inference rule 1:43 CS applications of resolution 2:26 The disjunctive syllogism is a special case ...

Photo Gallery

Discrete Structures [Lecture 4 / Segment 1] - Propositional logic - Part 7/9

Discrete Structures [Lecture 17 / Segment 4] - Introduction to algorithms - Part 4/6

Discrete Structures [Lecture 26 / Segment 4] - Structural induction - Part 4/8

Discrete Structures [Lecture 7 / Segment 4] - Predicate logic - Part 13/20

Discrete Structures [Lecture 12 / Segment 4] - Intro to proofs - Part 17/17

Discrete Structures [Lecture 13 / Segment 4] - Intro to set theory- Part 4/10

Discrete Structures [Lecture 32 / Segment 4] - Applications of the binomial theorem

Discrete Structures [Lecture 4 / Segment 2] - Propositional logic - Part 8/9

Discrete Structures [Lecture 5 / Segment 4] - Predicate logic - Part 4/20

Discrete Structures [Lecture 24 / Segment 4] - Introduction to mathematical induction - Part 4/6

Discrete Structures [Lecture 19 / Segment 4] - Big-O results

Discrete Structures [Lecture 20 / Segment 4] - Good upper bounds: One example

View Detailed Profile

Discrete Structures [Lecture 4 / Segment 1] - Propositional logic - Part 7/9

Discrete Structures [Lecture 4 / Segment 1] - Propositional logic - Part 7/9

Laws of propositional logic (i.e., list of useful logical equivalences) 0:00 Commutativity laws 3:14 De Morgan's laws

Discrete Structures [Lecture 17 / Segment 4] - Introduction to algorithms - Part 4/6

Discrete Structures [Lecture 17 / Segment 4] - Introduction to algorithms - Part 4/6

Bubble sort algorithm 0:00 Bubble sort algorithm to sort a finite sequence

Discrete Structures [Lecture 26 / Segment 4] - Structural induction - Part 4/8

Discrete Structures [Lecture 26 / Segment 4] - Structural induction - Part 4/8

Second example of using mathematical induction to prove the correctness of a closed-form guess.

Discrete Structures [Lecture 7 / Segment 4] - Predicate logic - Part 13/20

Discrete Structures [Lecture 7 / Segment 4] - Predicate logic - Part 13/20

0:00 Five examples of English sentences translated into predicate logic 7:47 Three examples of predicate logic expressions ...

Discrete Structures [Lecture 12 / Segment 4] - Intro to proofs - Part 17/17

Discrete Structures [Lecture 12 / Segment 4] - Intro to proofs - Part 17/17

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

Discrete Structures [Lecture 13 / Segment 4] - Intro to set theory- Part 4/10

Discrete Structures [Lecture 13 / Segment 4] - Intro to set theory- Part 4/10

Cartesian product 0:00 Definition: n-tuple 1:18 Definition: pair 2:44 Definition: Cartesian product 8:20 Definition: relation 10:01 ...

Discrete Structures [Lecture 32 / Segment 4] - Applications of the binomial theorem

Discrete Structures [Lecture 32 / Segment 4] - Applications of the binomial theorem

... let's discuss some direct applications of it for example let's compute the expansion of 3x minus 2y raised to the power

Discrete Structures [Lecture 4 / Segment 2] - Propositional logic - Part 8/9

Discrete Structures [Lecture 4 / Segment 2] - Propositional logic - Part 8/9

Other useful logical equivalences + equational reasoning 0:00 Conditional equivalence (i.e., replacing implication with ...

Discrete Structures [Lecture 5 / Segment 4] - Predicate logic - Part 4/20

Discrete Structures [Lecture 5 / Segment 4] - Predicate logic - Part 4/20

Predicate logic 0:00 Formalizing the Flipper argument 10:35 The need for quantification.

Discrete Structures [Lecture 24 / Segment 4] - Introduction to mathematical induction - Part 4/6

Discrete Structures [Lecture 24 / Segment 4] - Introduction to mathematical induction - Part 4/6

Mathematical induction: Sample proof #3.

Discrete Structures [Lecture 19 / Segment 4] - Big-O results

Discrete Structures [Lecture 19 / Segment 4] - Big-O results

Welcome back in this last

Discrete Structures [Lecture 20 / Segment 4] - Good upper bounds: One example

Discrete Structures [Lecture 20 / Segment 4] - Good upper bounds: One example

Welcome back in previous

Discrete Structures [Lecture 8 / Segment 4] - Predicate logic - Part 17/20

Discrete Structures [Lecture 8 / Segment 4] - Predicate logic - Part 17/20

0:00 Definition of the "resolution" inference rule 1:43 CS applications of resolution 2:26 The disjunctive syllogism is a special case ...