إنشاء حساب
الرئيسية
الكورسات
Teaching & Academices
Discrete Mathematics: Logic, Propositions, and Truth Tables
Discrete Math - 1.1.3 Constructing a Truth Table for Compound Propositions

Discrete Math - 1.1.3 Constructing a Truth Table for Compound Propositions

Discrete Mathematics: Logic, Propositions, and Truth Tables

محتوى الكورس

جميع الدروس
80 درس
11:54 Discrete Math - 4.3.4 Greatest Common Divisors as Linear Combinations
11:57 Discrete Math - 6.1.1 Counting Rules
10:26 Discrete Math - 5.4.1 Recursive Algorithms
11:52 Discrete Math - 5.3.2 Structural Induction
20:39 Discrete Math - 5.3.1 Revisiting Recursive Definitions
09:40 Discrete Math - 5.2.1 The Well-Ordering Principle and Strong Induction
07:41 Discrete Math - 5.1.3 Proof Using Mathematical Induction - Divisibility
09:53 Discrete Math - 5.1.2 Proof Using Mathematical Induction - Inequalities
23:24 Discrete Math - 5.1.1 Proof Using Mathematical Induction - Summation Formulae
13:50 Discrete Math - 4.4.1 Solving Linear Congruences Using the Inverse
14:48 Discrete Math - 6.3.1 Permutations and Combinations
07:34 Discrete Math - 4.3.3 The Euclidean Algorithm
10:04 Discrete Math - 4.3.2 Greatest Common Divisors and Least Common Multiples
13:40 Discrete Math - 4.3.1 Prime Numbers and Their Properties
36:00 Discrete Math - 4.2.4 Algorithms for Integer Operations
16:12 Discrete Math - 4.2.3 Conversions Between Binary, Octal and Hexadecimal Expansions
07:44 Discrete Math - 4.2.2 Binary, Octal and Hexadecimal Expansions From Decimal
11:47 Discrete Math - 4.2.1 Decimal Expansions from Binary, Octal and Hexadecimal
22:27 Discrete Math - 4.1.2 Modular Arithmetic
17:29 Discrete Math - 4.1.1 Divisibility
21:40 Discrete Math - 9.1.2 Properties of Relations
17:19 Discrete Math - 11.1.1 Introduction to Trees
07:39 Discrete Math - 10.2.3 Applications of Graphs
11:33 Discrete Math - 10.2.2 Special Types of Graphs
13:12 Discrete Math - 10.2.1 Graph Terminology
06:19 Discrete Math - 10.1.1 Introduction to Graphs
22:30 Discrete Math - 9.5.1 Equivalence Relations
12:28 Discrete Math - 9.3.2 Representing Relations Using Digraphs
21:04 Discrete Math - 9.3.1 Matrix Representations of Relations and Properties
16:03 Discrete Math - 9.1.3 Combining Relations
07:35 Discrete Math - 3.1.4 Optimization Algorithms
10:28 Discrete Math - 9.1.1 Introduction to Relations
17:36 Discrete Math - 8.5.1 The Principle of Inclusion-Exclusion
25:28 Discrete Math - 8.1.1 Modeling with Recurrence Relations
13:49 Discrete Math - 7.2.2 Random Variables and the Binomial Distribution
11:27 Discrete Math - 7.2.1 Probability Theory
28:12 Discrete Math - 7.1.2 Discrete Probability Practice
11:34 Discrete Math - 7.1.1 An Intro to Discrete Probability
19:56 Discrete Math - 6.4.1 The Binomial Theorem
29:25 Discrete Math - 6.3.2 Counting Rules Practice
15:47 Discrete Math - 1.4.2 Quantifiers
18:47 Discrete Math - 1.8.1 Proof by Cases
09:40 Discrete Math - 1.7.3 Proof by Contradiction
06:39 Discrete Math - 1.7.2 Proof by Contraposition
09:44 Discrete Math - 1.7.1 Direct Proof
17:05 Discrete Math - 1.6.2 Rules of Inference for Quantified Statements
28:34 Discrete Math - 1.6.1 Rules of Inference for Propositional Logic
22:29 Discrete Math - 1.5.2 Translating with Nested Quantifiers
18:20 Discrete Math - 1.5.1 Nested Quantifiers and Negations
19:17 Discrete Math - 1.4.3 Negating and Translating with Quantifiers
08:59 Discrete Math - 1.8.2 Proofs of Existence And Uniqueness
08:02 Discrete Math - 1.4.1 Predicate Logic
14:29 Discrete Math - 1.3.3 Constructing New Logical Equivalences
06:09 Discrete Math - 1.3.2 Key Logical Equivalences Including De Morgan’s Laws
16:12 Discrete Math - 1.3.1 “Proving” Logical Equivalences with Truth Tables
07:37 Discrete Math - 1.2.3 Introduction to Logic Circuits
16:15 Discrete Math - 1.2.2 Solving Logic Puzzles
11:10 Discrete Math 1.2.1 - Translating Propositional Logic Statements
11:45 Discrete Math - 1.1.3 Constructing a Truth Table for Compound Propositions
19:05 Discrete Math - 1.1.2 Implications Converse, Inverse, Contrapositive, and Biconditionals
11:46 Discrete Math - 2.4.1 Introduction to Sequences
11:26 Discrete Math - 3.1.3 Sorting Algorithms
10:45 Discrete Math - 3.1.2 Searching Algorithms
08:44 Discrete Math - 3.1.1 Introduction to Algorithms and Pseudo Code
08:34 Discrete Math - 2.6.3 Zero-One Matrices
05:28 Discrete Math - 2.6.2 Matrix Operations on your TI-84
20:06 Discrete Math - 2.6.1 Matrices and Matrix Operations
13:53 Discrete Math - 2.4.4 Summation Properties and Formulas
06:40 Discrete Math - 2.4.3 Summations and Sigma Notation
15:07 Discrete Math - 2.4.2 Recurrence Relations
19:32 Discrete Math - 1.1.1 Propositions, Negations, Conjunctions and Disjunctions
04:51 Discrete Math - 2.3.4 Useful Functions to Know
12:02 Discrete Math - 2.3.3 Inverse Functions and Composition of Functions
10:59 Discrete Math - 2.3.2 One-to-One and Onto Functions
06:44 Discrete Math - 2.3.1 Introduction to Functions
17:49 Discrete Math - 2.2.3 Proving Set Identities
11:29 Discrete Math - 2.2.2 Set Identities
13:32 Discrete Math - 2.2.1 Operations on Sets
15:04 Discrete Math - 2.1.2 Set Relationships
12:42 Discrete Math - 2.1.1 Introduction to Sets