Discrete Structures Lecture 2 Segment

June 22, 2026
Media Summary: Hints on translating English sentences into propositions. 0:00 Let me count the ways to conjunct 6:45 The 0:00 What is a logical argument? 1:33 A logical argument is valid if its conclusion logically follows from its premise(s) More terminology in basic set theory 0:00 Set cardinality; finite vs infinite sets

Discrete Structures Lecture 2 Segment - Detailed Analysis & Overview

Hints on translating English sentences into propositions. 0:00 Let me count the ways to conjunct 6:45 The 0:00 What is a logical argument? 1:33 A logical argument is valid if its conclusion logically follows from its premise(s) More terminology in basic set theory 0:00 Set cardinality; finite vs infinite sets For our last example consider this true false question is the function f of n equals From recursive definition to closed-form formula 0:00 example of a recursive definition 1:08 What is a closed-form formula? Sequence examples 0:00 Three examples 4:23 a string (in CS) = a special kind of sequence.

+ Example: Linear-search algorithm + Best-case time complexity + Worst-case time complexity. 0:00 Syntax versus semantics 1:13 Definition of a truth table 1:27 Truth table for conjunction (AND) 7:15 Truth table for (inclusive) ...

Photo Gallery

Discrete Structures [Lecture 2 / Segment 2] - Propositional logic - Part 4/9
Discrete Structures [Lecture 2 / Segment 1] - Propositional logic - Part 3/9
Discrete Structures [Lecture 13 / Segment 2] - Intro to set theory- Part 2/10
Discrete Structures [Lecture 20 / Segment 2] - The growth of functions: function addition
Discrete Structures [Lecture 26 / Segment 2] - Structural induction - Part 2/8
Lecture 2: Contradiction and Induction
Discrete Structures [Lecture 23 / Segment 2] - Examples of sequences
Discrete Structures [Lecture 14 / Segment 2] - Intro to set theory- Part 6/10
Discrete Structures Lecture on Sets
Discrete Structures [Lecture 18 / Segment 2] - Big-O notation
Discrete Structures [Lecture 21 / Segment 2] - A second look at time complexity
Discrete Structures [Lecture 22 / Segment 2] - Matrix Algorithms - Diagonal summation

Related Updates

Discrete Structures [Lecture 2 / Segment 2] - Propositional logic - Part 4/9 Discrete Structures [Lecture 2 / Segment 1] - Propositional logic - Part 3/9 Discrete Structures [Lecture 13 / Segment 2] - Intro to set theory- Part 2/10 Discrete Structures [Lecture 20 / Segment 2] - The growth of functions: function addition Discrete Structures [Lecture 26 / Segment 2] - Structural induction - Part 2/8 Lecture 2: Contradiction and Induction Discrete Structures [Lecture 23 / Segment 2] - Examples of sequences Discrete Structures [Lecture 14 / Segment 2] - Intro to set theory- Part 6/10 MANTAP89 - Jadwal FIFA World Cup Terlengkap Resmi LOGIC89 - Jadwal FIFA World Cup Resmi Terlengkap ERNITA4D - Jadwal FIFA World Cup Terbaru Harian TIKTOKIO.COM - Jadwal FIFA World Cup Terlengkap MIMINBET - Jadwal FIFA World Cup Update Harian SOBAT500 - Jadwal FIFA World Cup Lengkap Resmi RAJABOTAK - Jadwal FIFA World Cup Dan Skor Terkini KONOHATOTO78 - Jadwal FIFA World Cup Terbaru Lengkap
View Detailed Profile
Discrete Structures [Lecture 2 / Segment 2] - Propositional logic - Part 4/9

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

Hints on translating English sentences into propositions. 0:00 Let me count the ways to conjunct 6:45 The

Discrete Structures [Lecture 2 / Segment 1] - Propositional logic - Part 3/9

Discrete Structures [Lecture 2 / Segment 1] - Propositional logic - Part 3/9

0:00 What is a logical argument? 1:33 A logical argument is valid if its conclusion logically follows from its premise(s)

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

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

More terminology in basic set theory 0:00 Set cardinality; finite vs infinite sets

Discrete Structures [Lecture 20 / Segment 2] - The growth of functions: function addition

Discrete Structures [Lecture 20 / Segment 2] - The growth of functions: function addition

For our last example consider this true false question is the function f of n equals

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

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

From recursive definition to closed-form formula 0:00 example of a recursive definition 1:08 What is a closed-form formula?

Lecture 2: Contradiction and Induction

Lecture 2: Contradiction and Induction

MIT 6.1200J

Discrete Structures [Lecture 23 / Segment 2] - Examples of sequences

Discrete Structures [Lecture 23 / Segment 2] - Examples of sequences

Sequence examples 0:00 Three examples 4:23 a string (in CS) = a special kind of sequence.

Discrete Structures [Lecture 14 / Segment 2] - Intro to set theory- Part 6/10

Discrete Structures [Lecture 14 / Segment 2] - Intro to set theory- Part 6/10

Two

Discrete Structures Lecture on Sets

Discrete Structures Lecture on Sets

Produced with CyberLink PowerDirector 12

Discrete Structures [Lecture 18 / Segment 2] - Big-O notation

Discrete Structures [Lecture 18 / Segment 2] - Big-O notation

Welcome back to this

Discrete Structures [Lecture 21 / Segment 2] - A second look at time complexity

Discrete Structures [Lecture 21 / Segment 2] - A second look at time complexity

+ Example: Linear-search algorithm + Best-case time complexity + Worst-case time complexity.

Discrete Structures [Lecture 22 / Segment 2] - Matrix Algorithms - Diagonal summation

Discrete Structures [Lecture 22 / Segment 2] - Matrix Algorithms - Diagonal summation

Welcome back in this second

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

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

0:00 Syntax versus semantics 1:13 Definition of a truth table 1:27 Truth table for conjunction (AND) 7:15 Truth table for (inclusive) ...