My Math Forum  

Go Back   My Math Forum > High School Math Forum > Probability and Statistics

Probability and Statistics Basic Probability and Statistics Math Forum

LinkBack Thread Tools Display Modes
September 20th, 2018, 01:55 PM   #1
Joined: Sep 2018
From: United States

Posts: 1
Thanks: 0

Laws of equivalence

Use equivalence laws to show that (A ∨ C) ∧ (B ∨ C) ∧ (A ∨ D) ∧ (B ∨ D) and (A ∧ B) ∨ (C ∧ D) are logically equivalent.

I am trying to figure out how to go about this problem. The part that confuses me is that there are 4 separate terms. How would you apply the laws on that?
Darkblacks is offline  
September 20th, 2018, 03:19 PM   #2
Senior Member
Joined: Aug 2012

Posts: 2,409
Thanks: 753

You could always write out the truth table for each expression. With 4 variables there are only $2^4 = 16$ rows. Wouldn't take long to work out the truth value of each expression for each combination of truth values.
Maschke is online now  
October 20th, 2018, 01:12 PM   #3
Joined: Oct 2018
From: Netherlands

Posts: 39
Thanks: 3

When you need to reduce the number of logical terms, first look at the distributive laws (in reverse direction). Triple application brings you to the Holy Land.
Arisktotle is offline  

  My Math Forum > High School Math Forum > Probability and Statistics

equivalence, laws

Thread Tools
Display Modes

Similar Threads
Thread Thread Starter Forum Replies Last Post
Not sure if index laws or log laws PGibson Algebra 10 August 20th, 2017 09:45 PM
Exponent laws BreakingTheCode Algebra 1 March 18th, 2014 08:57 PM
Laws of Logic FloorPlay Applied Math 2 December 4th, 2012 12:11 PM
absorption laws: pappi Applied Math 2 March 25th, 2011 12:03 AM
Keplers laws Alex510 Calculus 1 October 6th, 2008 07:21 PM

Copyright © 2019 My Math Forum. All rights reserved.