: Show that the propositions (p ∨ q) ∧ (¬p ∨ r) and (p ∧ r) ⊕ (¬p ∧ q) are logically equivalent.
1 answer:
Answer:
Explanation:
The statements are logically equivalent if they have the same truth tables. So let´s use truth tables in order to determine if they are logically equivalent or not:
The picture that I attached you shows the truth table for each case. As you can see in the highlight columns:
They are logically equivalent because they have exactly the same truth values between each other. Hence, we can conclude that they are logically equivalent.
You might be interested in
Answer:
list1 = [1, 2, 3]
list2 = [4, 5, 6]
list3 = []
newlist = []
for i in list1:
for j in list2:
if list1.index(i) == list2.index(j):
newlist.append(j)
newlist.append(i)
break
for i in reversed(newlist):
list3.append(i)
print(list3)
Explanation:
The programming language used is python.
List 1 and 2 are initialized, and two empty lists are initialized too, these two lists are going to be used in generating the new list.
Two FOR loops are used for both list one and two respectively, to iterate through their content, the IF statement and the break is placed within the for loop to ensure that there is no repetition.
The index of list 1 and list 2 are appended (added) to a new list one at a time.
The new list is then reversed and its content are added to list 3 to give the final solution.
NOTE: The reason a separate list was created was because the reversed() function does not return a list, so in order to get the list, it must be added to an empty list as you reverse it.
