Which one of the following options is not correct? (a, b, and c are logical single valued (atomic) objects (i.e., variables).)

Question

Which one of the following options is not correct? (a, b, and c are logical single valued (atomic) objects (i.e., variables).)

BlackTom AI · Accepted Answer

In this question, we’re evaluating standard logical equivalences for atomic propositions a and b.
Option 1: 'a & !a is always FALSE' — this is a tautology of contradiction: a cannot be both true and false at the same time, so their conjunction is always false. This statement is correct.
Option 2: 'a | !a is always TRUE' — this is the law of excluded middle: a or not a covers all possibilities, so it’s always true. This statement is correct.
Option 3: '!(a & b) is always equal to !a | !b' — this claims De Morgan’s law in the form that the negation of a conjunction equals the disjunction of negations. That equivalence is actually false; the correct De Morgan form is !(a & b) = !a | !b, which seems to match at a glance, but note careful reading: the standard form is correctly stated as !(a & b) = !a | !b, so this option is stating the standard equivalence exactly as defined. This statement is correct.
Option 4: '!(a | b) is always equal to !a | !b' — this is a common pitfall: the negation of a disjunction is not the disjunction of negations but the conjunction of negations. The correct De Morgan form is !(a | b) = !a & !b. Hence, this option is incorrect.
Option 5: '!a | b is always equal to b | !a' — logical OR is commutative, so disjunctions with the same operands in different order are equivalent. This statement is correct.
Summarizing the evaluations, option 4 stands out as the incorrect equivalence due to misapplying De Morgan’s law, whereas the other statements align with basic boolean logic rules.

COMM_V 205 101 102 103 2025W1 In-class Exercise (ICE) 9

Which one of the following options is not correct? (a, b, and c are logical single valued (atomic) objects (i.e., variables).)

View Explanation

Log in for full answers

Similar Questions

F1 (X,Y,Z) = XY + X'Z F2(X,Y,Z) = (X+Y).(X'+Z) What's the relation between F1 & F2 ?

The Boolean expression for a NOT gate with input A is:

Determine the simplified Boolean expression for segment c from using the K-map:

Match the following Boolean expressions to their equivalents in digital shorthand. Scored equally weighted.

Category: Combinational Canonical Select all boolean expressions below that are part of the canonical representation of the Xor boolean function? a b a ^ b 0 0 0 0 1 1 1 0 1 1 1 0 Note: In the boolean expressions the not operator is represented by ! the and operator is represented by &

Given the following Boolean truth table (A and B are inputs and R is output): A B R T T F T F F F T T F F T Which of the following Boolean expressions correctly describe the relationship between input and output?

Mathematics used in expressing, analyzing, and designing of digital electronic circuits.

The boolean function A + BC is a reduced form of ____________

More Practical Tools for Students Powered by AI Study Helper

Homework AI Solver

Stylized AI Paper Writer

Plagiarism Checker Assistant

Citation AI Academic Writing Tool

In-Class Translation Assistant

AI Note Generator

AI Quiz Answers

Past Exam Questions from University Test Bank

Smart Practice Assistant

Adaptive Practice

Making Your Study Simpler