Media Summary: Basic Methods: We define tautology and contradiction and consider the conditions of Video Chapters: Introduction 0:00 Some Terminology 0:11 Show Two Compound Propositions are Discrete Mathematics: Propositional Logic −

Bm2 Logical Equivalence - Detailed Analysis & Overview

Basic Methods: We define tautology and contradiction and consider the conditions of Video Chapters: Introduction 0:00 Some Terminology 0:11 Show Two Compound Propositions are Discrete Mathematics: Propositional Logic − In this video we're going to look at a table of Background and set up for exercise 29 in section 1.3. This is a great preview of our coverage next week on rules of inference. This video shows the steps needed to verify a

This video explains how to simplify given statements using NOTE: Before watching this video it is recommended you tour the list of basic Learn what it means for two propositions to be Proving a compound proposition is a tautology.

Photo Gallery

BM2.  Logical Equivalence
Logical Equivalence of Two Statements
3 Ways to Show a Logical Equivalence | Ex: DeMorgan's Laws
Discrete Math - 1.3.1 “Proving” Logical Equivalences with Truth Tables
Propositional Logic − Logical Equivalences
Discrete Math - 1.3.2 Key Logical Equivalences Including De Morgan’s Laws
Logic - Proofs of Logical Equivalences
set up for proving logical equivalence
An Example of Verifying a Logical Equivalence
Simplify Statements Using Logically Equivalent Statements
Logical equivalence
12.2 Implication and Equivalence | Video 4--Logically Equivalent || Finite Mathematics
View Detailed Profile
BM2.  Logical Equivalence

BM2. Logical Equivalence

Basic Methods: We define tautology and contradiction and consider the conditions of

Logical Equivalence of Two Statements

Logical Equivalence of Two Statements

Two statements are

3 Ways to Show a Logical Equivalence | Ex: DeMorgan's Laws

3 Ways to Show a Logical Equivalence | Ex: DeMorgan's Laws

DeMorgan's Laws are two important

Discrete Math - 1.3.1 “Proving” Logical Equivalences with Truth Tables

Discrete Math - 1.3.1 “Proving” Logical Equivalences with Truth Tables

Video Chapters: Introduction 0:00 Some Terminology 0:11 Show Two Compound Propositions are

Propositional Logic − Logical Equivalences

Propositional Logic − Logical Equivalences

Discrete Mathematics: Propositional Logic −

Discrete Math - 1.3.2 Key Logical Equivalences Including De Morgan’s Laws

Discrete Math - 1.3.2 Key Logical Equivalences Including De Morgan’s Laws

A listing of many of the key

Logic - Proofs of Logical Equivalences

Logic - Proofs of Logical Equivalences

In this video we're going to look at a table of

set up for proving logical equivalence

set up for proving logical equivalence

Background and set up for exercise 29 in section 1.3. This is a great preview of our coverage next week on rules of inference.

An Example of Verifying a Logical Equivalence

An Example of Verifying a Logical Equivalence

This video shows the steps needed to verify a

Simplify Statements Using Logically Equivalent Statements

Simplify Statements Using Logically Equivalent Statements

This video explains how to simplify given statements using

Logical equivalence

Logical equivalence

NOTE: Before watching this video it is recommended you tour the list of basic

12.2 Implication and Equivalence | Video 4--Logically Equivalent || Finite Mathematics

12.2 Implication and Equivalence | Video 4--Logically Equivalent || Finite Mathematics

Learn what it means for two propositions to be

Logical Equivalence Proof

Logical Equivalence Proof

Proving a compound proposition is a tautology.