Logic: exclusive-OR statements to form AND/OR statements

  • Thread starter Thread starter Back2College
  • Start date Start date
  • Tags Tags
    Form Logic
Click For Summary
SUMMARY

This discussion addresses the impossibility of constructing compound statements equivalent to "p OR q" and "p AND q" using only the NOT and XOR logical operations. The participant initially assumed that parentheses could be used but found that all combinations of NOT and XOR yield truth tables with two True and two False outputs. The conclusion drawn is that XOR alone, even when combined with NOT, cannot achieve functional completeness for AND/OR operations, as demonstrated by the properties of XOR and its inability to produce the required truth tables.

PREREQUISITES
  • Understanding of logical operations: NOT and XOR
  • Familiarity with truth tables for logical expressions
  • Basic knowledge of functional completeness in logic
  • Ability to interpret logical expressions and their equivalences
NEXT STEPS
  • Study the properties of functional completeness in logic, focusing on NAND and NOR gates
  • Learn about the Sheffer stroke and its applications in logical operations
  • Explore the concept of affine connectives and their implications in logic
  • Investigate alternative methods for constructing logical expressions using different gate combinations
USEFUL FOR

This discussion is beneficial for students of computer science, logic enthusiasts, and anyone interested in understanding the limitations of logical operations in constructing complex statements.

Back2College
Messages
5
Reaction score
0

Homework Statement



Using only NOT and XOR, construct a compound statement having the same truth table as:

(a) p OR q

(b) p AND q

Homework Equations



XOR is "exclusive OR." p XOR q = (p OR q) AND NOT (p AND q).

I have been working under the assumption that I can use parentheses.

The Attempt at a Solution



I know the truth tables for (p OR q) and (p AND q) are TTTF and TFFF, respectively. So, either three Trues and one false or one True and three Falses.

However, when I use only NOT and XOR I always get two Trues and two Falses. So far this has been the case no matter which combination I try or how many XORs I string together. It's always some combination of two Trues and two Falses.

Can anyone give me a hint?

Thanks.
 
Physics news on Phys.org
You can use parenthesis.

There is no solution:
XOR can be used to generate NOT: XOR(XOR(1,0),X) = NOT(X)
So the addition of the NOT gate is not needed.

XOR has affine connectives. That is: XOR(X,Y) = NOT(XOR(NOT(X),Y), so the XOR will always change when X changes. Of course, the same can be said for Y.
That's one of the attributes an operation must not have in order to be "functionally complete".
See https://en.wikipedia.org/wiki/Sheffer_stroke#Properties

The two operations that can be used to generate NOT, AND, and OR are NAND (the Sheffer Stroke) and NOR.

Actually, it's all explained here: https://en.wikipedia.org/wiki/Functional_completeness.
 
Last edited:
Using only NOT and XOR is exactly equivalent to "Using only XOR". This is because NOT is just an XOR with one input held high, so we can limit the analysis to just the XOR gate.

SO ... using a gate that ALWAYS has an output with two 1's and two 0's in the truth table would there be any way to make it have a single 1 or 3 ones?

This is the same as asking "if I always require an output of two apples, can I ever get outputs of 1 apple or 3 apples" ?

EDIT: Ah, I see Scott beat me to it.
 
Thanks for your replies. I now understand why there can't be any solution.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
Replies
1
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
9
Views
2K
  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K